Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102082
Title: EERTREE: An efficient data structure for processing palindromes in strings
Authors: Rubinchik, M.
Shur, A. M.
Issue Date: 2018
Publisher: Academic Press
Citation: Rubinchik M. EERTREE: An efficient data structure for processing palindromes in strings / M. Rubinchik, A. M. Shur. — DOI 10.1016/j.ejc.2017.07.021 // European Journal of Combinatorics. — 2018. — Vol. 68. — P. 249-265.
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. © 2017 Elsevier Ltd
URI: http://hdl.handle.net/10995/102082
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85028303600
PURE ID: 6162361
efc219d4-6fb6-4680-9bc6-febaaf00c682
ISSN: 1956698
DOI: 10.1016/j.ejc.2017.07.021
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

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


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