Publications
- Robert Giegerich, Stefan Kurtz and Jens Stoye, Efficient implementation of lazy suffix trees, Software-Practice and Experience, 33(11), pp. 1035-1049, 2003.
[http://www.zbh.uni-hamburg.de/staff/kurtz/papers/GieKurSto2003.pdf]
- Klaus-Bernd Schurmann and Jens Stoye, Suffix Tree Construction and Storage with Limited Main Memory, Technical report 2003-06, Technische Fakultat, Universitat Bielefeld, Germany, 2003.
[http://bieson.ub.uni-bielefeld.de/volltexte/2004/601/pdf/report2003-06.pdf]
[http://www.cebitec.uni-bielefeld.de/~klaus/klaus_files/techreport_2003_06.pdf]
[http://www.cebitec.uni-bielefeld.de/~klaus/klaus_files/techreport_2003_06.ps]
- Klaus-Bernd Schurmann and Jens Stoye, Suffix Tree Construction for Large Strings, Technical report CS-01-02, Fachbereich Informatik, Universitat Rostock, pp. 101-105, 2002.
[http://www.cebitec.uni-bielefeld.de/~klaus/klaus_files/schuermann_stoye2002.pdf]
[http://www.cebitec.uni-bielefeld.de/~klaus/klaus_files/schuermann_stoye2002.ps]
- Martin Farach, Paolo Ferragina and S. Muthukrishnan, On the Sorting-Complexity of Suffix Tree Construction, Journal of the Association for Computing Machinery, 47(6), pp. 987-1011, 2000.
[http://www.cs.rutgers.edu/~farach/pubs/FarFerrMuthu00.pdf]
- Arne Andersson, Jesper Larsson and Kurt Swanson, Suffix Trees on Words, Algorithmica, 23(3), pp. 246-260, 1999.
[http://citeseer.ist.psu.edu/59895.html]
[http://user.it.uu.se/~arnea/ps/suffwj.ps]
[http://user.it.uu.se/~arnea/ps/suffwj.pdf]
[http://www.larsson.dogma.net/words-alg.ps.gz]
[http://www.larsson.dogma.net/words-alg.pdf]
- Robert Giegerich, Stefan Kurtz and Jens Stoye, Efficient Implementation of Lazy Suffix Trees, Proceedings of the 3rd International Workshop on Algorithm Engineering, LNCS 1668, Springer-Verlag, pp. 30-42, 1999.
[http://www.techfak.uni-bielefeld.de/~kurtz/PS/wae99final.ps.gz]
[http://www.techfak.uni-bielefeld.de/~stoye/cpublications/wae99final.ps]
[http://www.zbh.uni-hamburg.de/staff/kurtz/papers/GieKurSto1999.pdf]
- Dong Kyue Kim and Kunsoo Park, Linear-Time Construction of Two-Dimensional Suffix Trees, Proceedings of the 26th International Colloquium on Automata, Languages and Programming, pp. 463-472, 1999.
[http://citeseer.ist.psu.edu/kim99lineartime.html]
[http://theory.snu.ac.kr/paper/dkkim_icalp99.ps]
- Dong Kyue Kim, Jeong Seop Sim and Kunsoo Park, Suffix Trees for Integer Alphabets Revisited, 3rd Korea-Japan Joint Workshop on Algorithms and Computation, pp. 171-178, 1999.
[http://citeseer.ist.psu.edu/470891.html]
[http://theory.snu.ac.kr/paper/dkkim_waac99.ps]
- Stefan Kurtz, Reducing the Space Requirement of Suffix Trees, Software-Practice and Experience, 29(13), pp. 1149-1171, 1999.
[http://www.zbh.uni-hamburg.de/staff/kurtz/papers/Kur1999.pdf]
- Jesper Larsson, Structures of String Matching and Data Compression, PhD thesis, Department of Computer Science, Lund University, Sweden, 1999.
[http://citeseer.ist.psu.edu/larsson99structures.html]
[http://www.larsson.dogma.net/thesis.ps.gz]
[http://www.larsson.dogma.net/thesis.pdf]
- Stefan Kurtz, Reducing the Space Requirement of Suffix Trees, Technical report 98-03, Technische Fakultat, Universitat Bielefeld, 1998.
[http://citeseer.ist.psu.edu/kurtz98reducing.html]
[http://www.techfak.uni-bielefeld.de/~kurtz/PS/redspace.ps.gz]
- Jesper Larsson, Attack Of The Mutant Suffix Trees, Licentiate thesis, 1998.
[http://citeseer.ist.psu.edu/larsson98attack.html]
[http://www.larsson.dogma.net/lic.ps.gz]
[http://www.larsson.dogma.net/lic.pdf]
- Martin Farach, Optimal suffix tree construction with large alphabets, Proceedings of the 38th Annual Symposium on the Foundations of Computer Science, pp. 137-143, 1997.
[http://citeseer.ist.psu.edu/224804.html]
[http://www.cs.rutgers.edu/~farach/pubs/Suffix.pdf]
- Robert Giegerich and Stefan Kurtz, From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction, Algorithmica, 19(3), pp. 331-353, 1997.
[http://citeseer.ist.psu.edu/giegerich97from.html]
[ftp://ftp.uni-bielefeld.de/pub/papers/techfak/pi/WMUAlgorithmica.ps.gz]
[http://www.zbh.uni-hamburg.de/staff/kurtz/papers/GieKur1997.pdf]
- Martin Farach and S. Muthukrishnan, Optimal Logarithmic Time Randomized Suffix Tree Construction, Proceedings of the 23th International Colloquium on Automata, Languages and Programming, pp. 550-561, 1996.
[http://citeseer.ist.psu.edu/farach96optimal.html]
[http://www.cs.rutgers.edu/~farach/pubs/PRAMSuffixICALP.pdf]
- Jesper Larsson, Extended Application of Suffix Trees to Data Compression, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 190-199, 1996.
[http://citeseer.ist.psu.edu/larsson96extended.html]
[http://www.larsson.dogma.net/dccpaper.ps.gz]
[http://www.larsson.dogma.net/dccpaper.pdf]
- Mark Nelson, Fast String Searching With Suffix Trees, Dr. Dobb's Journal, 1996.
[http://www.dogma.net/markn/articles/suffixt/suffixt.htm]
- Arne Andersson and Stefan Nilsson, Efficient Implementation of Suffix Trees, Software-Practice and Experience, 25(2), pp. 129-141, 1995.
[http://citeseer.ist.psu.edu/andersson95efficient.html]
[http://user.it.uu.se/~arnea/ps/suffimpl.ps]
[http://user.it.uu.se/~arnea/ps/suffimpl.pdf]
[http://www.nada.kth.se/~snilsson/public/papers/effi/text.ps]
[http://www.nada.kth.se/~snilsson/public/papers/effi/text.pdf]
- Robert Giegerich and Stefan Kurtz, A Comparison of Imperative and Purely Functional Suffix Tree Constructions, Science of Computer Programming, 25(2-3), pp. 187-218, 1995.
[http://citeseer.ist.psu.edu/giegerich95comparison.html]
[ftp://ftp.uni-bielefeld.de/pub/papers/techfak/pi/ToAppearInSCP25No2-3.ps.gz]
[http://www.zbh.uni-hamburg.de/staff/kurtz/papers/GieKur1995a.pdf]
- Esko Ukkonen, On-line construction of suffix-trees, Algorithmica, 14(3), pp. 249-260, 1995.
[http://citeseer.ist.psu.edu/637443.html]
[http://www.cs.helsinki.fi/u/ukkonen/SuffixT1.ps]
[http://www.cs.helsinki.fi/u/ukkonen/SuffixT1.pdf]
- Edward McCreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, 23(2), pp. 262-272, 1976.
[http://www.akira.ruc.dk/~keld/teaching/algoritmedesign_f03/Artikler/10/McCreight76.pdf]
- Wikipedia, Suffix tree.
[http://en.wikipedia.org/wiki/Suffix_tree]
Source Code
日本語の資料