Skip to main content
Springer Nature Link
Log in

Suffix Tree Construction

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 299 Accesses

Years and Authors of Summarized Original Work

  • 1973; Weiner

  • 1976; McCreight

  • 1995; Ukkonen

  • 2000; Farach-Colton, Ferragina, Muthukrishnan

Problem Definition

The suffix tree is perhaps the best-known and most-studied data structure for string indexing with applications in many fields of sequence analysis. After its invention in the early 1970s, several approaches for the efficient construction of the suffix tree of a string have been developed for various models of computation. The most prominent of those that construct the suffix tree in main memory are summarized in this entry.

Notations

Given an alphabet \(\varSigma\), a trie over \(\varSigma\) is a rooted tree whose edges are labeled with strings over \(\varSigma\) such that no two labels of edges leaving the same vertex start with the same symbol. A trie is compacted if all its internal vertices, except possibly the root, are branching. Given a finite string \(S \in \varSigma ^{n}\), the suffix tree of S, T(S), is the compacted trie...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Amir A, Kopelowitz T, Lewenstein M, Lewenstein N (2005) Towards real-time suffix tree construction. In: Proceedings of the 12th international symposium on string processing and information retrieval (SPIRE 2005). LNCS, vol 3772. Springer, Berlin, pp 67–78

    Google Scholar 

  2. Apostolico A (1985) The myriad virtues of subword trees. In: Apostolico A, Galil Z (eds) Combinatorial algorithms on words. NATO ASI Series, vol F12. Springer, Berlin, pp 85–96

    Chapter  Google Scholar 

  3. Chen MT, Seiferas J (1985) Efficient and elegant subword tree construction. In: Apostolico A, Galil Z (eds) Combinatorial algorithms on words. Springer, New York

    Google Scholar 

  4. Farach-Colton M, Ferragina P, Muthukrishnan S (2000) On the sorting-complexity of suffix tree construction. J ACM 47(6):987–1011

    Article  MathSciNet  MATH  Google Scholar 

  5. Ferragina P, Grossi R, Montangero M (1998) A note on updating suffix tree labels. Theor Comput Sci 201:249–262

    Article  MathSciNet  MATH  Google Scholar 

  6. Fiala ER, Greene DH (1989) Data compression with finite windows. Commun ACM 32:490–505

    Article  Google Scholar 

  7. Giegerich R, Kurtz S, Stoye J (2003) Efficient implementation of lazy suffix trees. Softw Pract Exp 33:1035–1049

    Article  Google Scholar 

  8. Gusfield D (1997) Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York

    Book  MATH  Google Scholar 

  9. Kärkkäinen J, Sanders P (2003) Simple linear work suffix array construction. In: Proceedings of the 30th international colloquium on automata, languages, and programming (ICALP 2003). LNCS, vol 2719. Springer, Berlin, pp 943–955

    Google Scholar 

  10. Kurtz S (1999) Reducing the space requirements of suffix trees. Softw Pract Exp 29:1149–1171

    Article  Google Scholar 

  11. McCreight EM (1976) A space-economical suffix tree construction algorithm. J ACM 23:262–272

    Article  MathSciNet  MATH  Google Scholar 

  12. Ukkonen E (1995) On-line construction of suffix trees. Algorithmica 14:249–260

    Article  MathSciNet  MATH  Google Scholar 

  13. Weiner P (1973) Linear pattern matching algorithms. In: Proceedings of the 14th annual IEEE symposium on switching and automata theory. IEEE Press, New York, pp 1–11

    Chapter  Google Scholar 

  14. Cheung C-F, Yu JX, Lu H (2005) Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Trans Knowl. Data Eng. 17:90–105

    Article  Google Scholar 

  15. Tian Y, Tata S, Hankins RA, Patel JM (2005) Practical methods for constructing suffix trees. VLDB J 14:281–299

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Technology, Genome Informatics, Bielefeld University, Bielefeld, Germany

    Jens Stoye

Authors
  1. Jens Stoye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jens Stoye .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Stoye, J. (2016). Suffix Tree Construction. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_414

Download citation

Publish with us

Policies and ethics