Towards real-time suffix tree construction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 67-78

  Amir, Amihood ^a,b   Kopelowitz, Tsvi ^a   Lewenstein, Moshe ^a   Lewenstein, Noa ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

^c NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING STRUCTURE; REAL-TIME SUFFIX; SEARCHING ALGORITHM; TREE CONSTRUCTION;

ALGORITHMS; CODES (SYMBOLS); KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; ONLINE SYSTEMS; PROBLEM SOLVING; SEARCH ENGINES; TREES (MATHEMATICS);

REAL TIME SYSTEMS;

EID: 33646723485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_9     Document Type: Conference Paper

References (17)

1. G.M. Adelson-Velskii and E.M. Landis. An algorithm for the organization of information. Soviet Math. Doklady, 3:1259-1263, 1962.
2. R. Bayer. Symetrie Binary B-trees: Data structure and maintenance algorithms. In Acta Informatica, 1:290-306, 1972.
3. R. Bayer, E. M. McCreight. Organization and maintenance of large ordered indexes, In Acta Informatica, 1(3):173-189, 1972.
4. M. Bender, R. Cole, E. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Proc. 10th Annual European Symposium on Algorithms (ESA 2002), pages 152-164, 2002.
5. R. Cole and R. Hariharan. Dynamic lea queries in trees. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 235-244, 1999.
6. P.P. Dietz and D.D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th ACM Symposium on Theory of Computing (STOC), pages 365-372, 1987.
7. M. Far ach. Optimal suffix tree construction with large alphabets. Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 137-143, 1997.
8. G. Franceschini and R. Grossi. A general technique for managing strings in comparison-driven data structures. In Proc. 31 Intl. Col. on Automata, Languages and Programming (ICALP), pages 606-617, 2004.
9. R. Grossi and G. P. Italiano. Efficient techniques for maintaining multidimensional keys in linked data structures. In Proc. 26th Intl. Col, on Automata, Languages and Programming (ICALP), pages 372-381, 1999.
10. Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
11. Juha Kärkkäinen and Peter Sanders. Simple linear work suffix array construction. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP 03), pages 943-955, 2003. LNCS 2719.
12. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. In Proc. 1st ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 319-327, 1990.
13. E. M. McCreight. A space-economical suffix tree construction algorithm. J. of the ACM, 23:262-272, 1976.
14. T. Rauhe S. Alstrup, G. S. Brodai. Pattern matching in dynamic texts. In Proc. 11th ACM-SIAM Symposium on Discrete algorithms(SODA), pages 819-828, 2000.
15. S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. Proc. 37th FOCS, pages 320-328, 1996.
16. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
17. P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.