论文信息 - Suffix Tree Construction in RAM - 字舞流文

Suffix Tree Construction in RAM

[1] Moshe Lewenstein,et al. Towards Real-Time Suffix Tree Construction , 2005, SPIRE.

[2] Edward R. Fiala,et al. Data compression with finite windows , 1989, CACM.

[3] Z. Galil,et al. Combinatorial Algorithms on Words , 1985 .

[4] Peter Sanders,et al. Simple Linear Work Suffix Array Construction , 2003, ICALP.

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

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

[7] Roberto Grossi,et al. On Updating Suffix Tree Labels , 1998, Theor. Comput. Sci..

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

[9] Roberto Grossi,et al. A Note on Updating Suffix Tree Labels , 1997, CIAC.

[10] Robert Giegerich,et al. Efficient implementation of lazy suffix trees , 2003, Softw. Pract. Exp..

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

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

[13] Stefan Kurtz,et al. Reducing the space requirement of suffix trees , 1999 .

[14] J. Seiferas,et al. Efficient and Elegant Subword-Tree Construction , 1985 .

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