Replacing suffix trees with enhanced suffix arrays
Top Cited Papers
- 13 February 2004
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 2 (1), 53-86
- https://doi.org/10.1016/s1570-8667(03)00065-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Efficient multiple genome alignmentBioinformatics, 2002
- Fast algorithms for large-scale genome alignment and comparisonNucleic Acids Research, 2002
- REPuter: the manifold applications of repeat analysis on a genomic scaleNucleic Acids Research, 2001
- Initial sequencing and analysis of the human genomeNature, 2001
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Alignment of whole genomesNucleic Acids Research, 1999
- Sublinear approximate string matching and biological applicationsAlgorithmica, 1994
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977