Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:elar.urfu.ru:10995/102082

EERTREE: An efficient data structure for processing palindromes in strings

Authors
Publication date
1 January 2018
Publisher
Academic Press
Doi

    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 Lt

    Similar works

    Full text

    thumbnail-image

    Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin

    redirect
    oaioai:elar.urfu.ru:10995/102082
    Last time updated on 06/11/2021

    This paper was published in Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.