Name: index_suffix_trees
Author: Alexander Aumann <aumann@in.tum.de>
Author: Andre Dau <dau@in.tum.de>
Author: Johannes Krugel <krugel@in.tum.de>
Maintainer: Johannes Krugel <krugel@in.tum.de>
License: BSD 3-clause
Copyright: 2011, Technische Universitaet Muenchen
Status: under development
Homepage: http://www14.in.tum.de/papi/
Description: Suffix tree data structures and their respective construction algorithms.
 .
 [BSTU2008] M. Barsky, U. Stege, A. Thomo, C. Upton
 "A new method for indexing genomes using on-disk suffix trees"
 17th ACM Conference on Information and Knowledge Management
 (CIKM'08), ACM, 2008, 649-658, http://dx.doi.org/10.1145/1458082.1458170
 .
 [BST2010] M. Barsky, U. Stege, A. Thomo "A survey of practical
 algorithms for suffix tree construction in external memory",
 Software - Practice and Experience, John Wiley & Sons, Inc.,
 2010, 40, 965-988, http://dx.doi.org/10.1002/spe.960
 .
 [Kurtz1999] S. Kurtz "Reducing the space requirement of suffix trees"
 Software - Practice and Experience, John Wiley & Sons, Inc., 1999, 29,
 1149-1171,
 http://dx.doi.org/10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O
 .
 [HST2007] M. Halachev, N. Shiri, A. Thamildurai
 "Efficient and Scalable Indexing Techniques for Biological Sequence Data",
 First International Conference on Bioinformatics Research and Development
 (BIRD'07), Springer, 2007, 4414, 464-479
 http://dx.doi.org/10.1007/978-3-540-71233-6_36
 .
 See also:
 [Aumann2011] A. Aumann "Implementation and comparison of suffix tree
 representations", Bachelor thesis, Technische Universitt Mnchen, 2011
