A Suffix Tree Or Not a Suffix Tree?
| Autor: | Tatiana Starikovskaya, Hjalte Wedel Vildhøj |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Suffix tree
String (computer science) Structure (category theory) Generalized suffix tree Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Data_CODINGANDINFORMATIONTHEORY law.invention Longest common substring problem Combinatorics Tree (descriptive set theory) law Data_FILES Suffix Computer Science::Data Structures and Algorithms Symbol (formal) Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319193144 IWOCA |
| DOI: | 10.1007/978-3-319-19315-1_30 |
| Popis: | In this paper we study the structure of suffix trees. Given an unlabeled tree \(\tau \) on n nodes and suffix links of its internal nodes, we ask the question “Is \(\tau \) a suffix tree?", i.e., is there a string S whose suffix tree has the same topological structure as \(\tau \)? We place no restrictions on S, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. We prove that \(\tau \) is a suffix tree if and only if it is realized by a string S of length \(n-1\), and we give a linear-time algorithm for inferring S when the first letter on each edge is known. This generalizes the work of I et al. [Discrete Appl. Math. 163, 2014]. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|