On Suffix Extensions in Suffix Trees

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

[2]  Z. Galil,et al.  Pattern matching algorithms , 1997 .

[3]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[4]  S. Muthukrishnan,et al.  On the sorting-complexity of suffix tree construction , 2000, JACM.

[5]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[6]  Richard Cole,et al.  Two Simplified Algorithms for Maintaining Order in a List , 2002, ESA.

[7]  Srinivas Aluru,et al.  Space efficient linear time construction of suffix arrays , 2005, J. Discrete Algorithms.

[8]  Jens Stoye,et al.  Linear time algorithms for finding and representing all the tandem repeats in a string , 2004, J. Comput. Syst. Sci..

[9]  Robert Giegerich,et al.  From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction , 1997, Algorithmica.

[10]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[11]  Jeffery R. Westbrook.  Fast Incremental Planarity Testing , 1992, ICALP.

[12]  Laurent Mouchard,et al.  Dynamic extended suffix arrays , 2010, J. Discrete Algorithms.

[13]  Gad M. Landau,et al.  Construction of Aho Corasick automaton in linear time for integer alphabets , 2006, Inf. Process. Lett..

[14]  S. Rao Kosaraju,et al.  Computation of Squares in a String (Preliminary Version) , 1994, CPM.

[15]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

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

[17]  Tetsuo Shibuya.  Constructing the Suffix Tree of a Tree with a Large Alphabet , 1999, ISAAC.

[18]  Dong Kyue Kim,et al.  Constructing suffix arrays in linear time , 2005, J. Discrete Algorithms.

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

[20]  Athanasios K. Tsakalidis.  Maintaining order in a generalized linked list , 2004, Acta Informatica.

[21]  Maxime Crochemore,et al.  Transducers and Repetitions , 1986, Theor. Comput. Sci..

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

[23]  Ely Porat,et al.  Range Non-overlapping Indexing , 2009, ISAAC.

[24]  Alberto Apostolico,et al.  The Myriad Virtues of Subword Trees , 1985 .

[25]  Laurent Mouchard,et al.  A four-stage algorithm for updating a Burrows-Wheeler transform , 2009, Theor. Comput. Sci..

[26]  Gregory Kucherov,et al.  Finding maximal repetitions in a word in linear time , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[27]  Alejandro A. Schäffer,et al.  Improved dynamic dictionary matching , 1995, SODA '93.

[28]  Franco P. Preparata,et al.  Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..

[29]  Peter Sanders,et al.  Linear work suffix array construction , 2006, JACM.

[30]  M. Farach.  Optimal suffix tree construction with large alphabets , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.