A Sux Tree Or Not A Sux Tree

In this paper we study the structure of sux trees. Given an unlabeled tree on n nodes and sux links of its internal nodes, we ask the question \Is a sux tree?", i.e., is there a string

[1]  Ramesh Hariharan,et al.  Optimal Parallel Construction of Minimal Suffix and Factor Automata , 1996, Parallel Process. Lett..

[2]  Hideo Bannai,et al.  Inferring strings from suffix trees and links on a binary alphabet , 2011, Discret. Appl. Math..

[3]  Maxime Crochemore,et al.  Cover Array String Reconstruction , 2010, CPM.

[4]  Maxime Crochemore,et al.  Forty Years of Text Indexing , 2013, CPM.

[5]  Hideo Bannai,et al.  Counting Parameterized Border Arrays for a Binary Alphabet , 2009, LATA.

[6]  Ayumi Shinohara,et al.  Inferring Strings from Graphs and Arrays , 2003, MFCS.

[7]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[8]  Giuseppe F. Italiano,et al.  On suffix extensions in suffix trees , 2011, Theor. Comput. Sci..

[9]  Artur Jez,et al.  Validating the Knuth-Morris-Pratt Failure Function, Fast and Online , 2010, Theory of Computing Systems.

[10]  Hideo Bannai,et al.  Verifying a Parameterized Border Array in O(n1.5) Time , 2010, CPM.

[11]  W. F. Smyth,et al.  Verifying a border array in linear time , 1999 .

[12]  Hideo Bannai,et al.  Verifying and enumerating parameterized border arrays , 2011, Theor. Comput. Sci..

[13]  Arnaud Lefebvre,et al.  Efficient validation and construction of border arrays and validation of string matching automata , 2009, RAIRO Theor. Informatics Appl..

[14]  Eric Rivals,et al.  Reverse engineering of compact suffix trees and links: A novel algorithm , 2014, J. Discrete Algorithms.

[15]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[16]  Arnaud Lefebvre,et al.  Border Array on Bounded Alphabet , 2002, Stringology.

[17]  Esko Ukkonen,et al.  On-line construction of suffix trees , 1995, Algorithmica.