The Enhanced Suffix Array and Its Applications to Genome Analysis
- 10 October 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 449-463
- https://doi.org/10.1007/3-540-45784-4_35
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Finding maximal repetitions in a word in linear timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- REPuter: the manifold applications of repeat analysis on a genomic scaleNucleic Acids Research, 2001
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsLecture Notes in Computer Science, 2001
- Initial sequencing and analysis of the human genomeNature, 2001
- Evidence for symmetric chromosomal inversions around the replication origin in bacteriaGenome Biology, 2000
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Alignment of whole genomesNucleic Acids Research, 1999
- Algorithms on Strings, Trees and SequencesPublished by Cambridge University Press (CUP) ,1997
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985