Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Border array on bounded alphabet
Journal of Automata, Languages and Combinatorics
Counting suffix arrays and strings
Theoretical Computer Science
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Verifying a parameterized border array in O(n1.5) time
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Cover array string reconstruction
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Counting and verifying maximal palindromes
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
| Hi-index | 0.04 |
A suffix tree, which provides us with a linear space full-text index of a given string, is a fundamental data structure for string processing and information retrieval. In this paper we consider the reverse engineering problem on suffix trees: given an unlabeled ordered rooted tree T accompanied with a node-to-node transition function f, infer a string whose suffix tree and its suffix links for inner nodes are isomorphic to T and f, respectively. Also, we consider the enumeration problem in which we enumerate all strings corresponding to an input tree and links. By introducing new characterizations of suffix trees, we show that the reverse engineering problem and the enumeration problem on suffix trees on a binary alphabet can be solved in optimal time.