Publications
- Kunihiko Sadakane, Compressed Suffix Trees with Full Functionality, Theory of Comupting Systems, 2007.
[http://tcslab.csce.kyushu-u.ac.jp/~sada/papers/sada07.pdf]
- Kashyap Dixit, Wolfgang Gerlach, Veli Makinen and Niko Valimaki, Engineering a Compressed Suffix Tree Implementation, Technical report C-2006-37, Department of Computer Science, University of Helsinki, Finland, 2006.
[http://www.cs.helsinki.fi/u/vmakinen/papers/icst.pdf]
- Ho-Leung Chan, Wing-Kai Hon, Tak-Wah Lam and Kunihiko Sadakane, Dynamic Dictionary Matching and Compressed Suffix Trees, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.
[http://www.csis.hku.hk/~hlchan/research/publications/soda05-chan.pdf]
- Roberto Grossi and Jeffrey Vitter, Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching, SIAM Journal on Computing, 2005.
[http://www.di.unipi.it/~grossi/PAPERS/sicomp05.pdf]
- Roberto Grossi, Ankur Gupta and Jeffrey Vitter, When Indexing Equals Compression: Experiments with Compressing Suffix Arrays and Applications, Proceedings of the 15th Annual SIAM/ACM Symposium on Discrete Algorithms, pp. 636-645, 2004.
[http://www.di.unipi.it/~grossi/PAPERS/soda04.pdf]
[http://www.cs.duke.edu/~jsv/Papers/GGV04.TextIndexingExperimentsJournal.pdf]
- Kunihiko Sadakane, Compressed Suffix Trees with Full Functionality, Theory of Comupting Systems, 2004.
[http://citeseer.ist.psu.edu/658763.html]
[http://tcslab.csce.kyushu-u.ac.jp/~sada/papers/cst.ps]
- Wing-Kai Hon and Kunihiko Sadakane, Space-Economical Algorithms for Finding Maximal Unique Matches, Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, LNCS 2373, Springer-Verlag, pp. 144-152, 2002.
[http://citeseer.ist.psu.edu/640435.html]
- Kunihiko Sadakane, Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 225-232, 2002.
[http://citeseer.ist.psu.edu/sadakane02succinct.html]
- Roberto Grossi and Jeffrey Vitter, Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 397-406, 2000.
[http://citeseer.ist.psu.edu/grossi00compressed.html]
[ftp://ftp.di.unipi.it/pub/Papers/grossi/stoc00.ps.gz]
[http://www.cs.duke.edu/~jsv/Papers/GrV00.text_indexing.ps.gz]
[http://www.cs.duke.edu/~jsv/Papers/GrV00.text_indexing.pdf]
[http://www.cs.duke.edu/~jsv/Papers/GrV00.text_indexing_slides.ps.gz]
[http://www.cs.duke.edu/~jsv/Papers/GrV00.text_indexing_slides.pdf]
Source Code