Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102275
Title: EERTREE: An efficient data structure for processing palindromes in strings
Authors: Rubinchik, M.
Shur, A. M.
Issue Date: 2016
Publisher: Springer Verlag
Citation: Rubinchik M. EERTREE: An efficient data structure for processing palindromes in strings / M. Rubinchik, A. M. Shur. — DOI 10.1007/978-3-319-29516-9_27 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2016. — Vol. 9538. — P. 321-333.
Abstract: We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure, we present simple and efficient solutions for a number of problems involving palindromes © Springer International Publishing Switzerland 2016.
Keywords: COMBINATORIAL MATHEMATICS
DATA STRUCTURES
LINGUISTICS
EFFICIENT DATA STRUCTURES
PALINDROMIC
SUB-STRINGS
SUFFIX TRIE
SUFFIX-TREES
DATA HANDLING
URI: http://hdl.handle.net/10995/102275
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84961226250
PURE ID: 738523
d662fb37-40dc-4c57-8301-2b769bbbd303
ISSN: 3029743
ISBN: 9783319295152
DOI: 10.1007/978-3-319-29516-9_27
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84961226250.pdf437,89 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.