Related references
Note: Only part of the references are listed.A space and time efficient algorithm for constructing compressed suffix arrays
Wing-Kai Hon et al.
ALGORITHMICA (2007)
Space-efficient whole genome comparisons with Burrows-Wheeler transforms
RA Lippert
JOURNAL OF COMPUTATIONAL BIOLOGY (2005)
Annotating large genomes with exact word matches
J Healy et al.
GENOME RESEARCH (2003)
New text indexing functionalities of the compressed suffix arrays
K Sadakane
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2003)
Database indexing for large DNA and protein sequence collections
E Hunt et al.
VLDB JOURNAL (2002)
SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size
E Giladi et al.
BIOINFORMATICS (2002)
Indexing and retrieval for genomic databases
HE Williams et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2002)
Share Paper
