Prospects and limitations of full-text index structures in genome analysis
Published 2012 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Prospects and limitations of full-text index structures in genome analysis
Authors
Keywords
-
Journal
NUCLEIC ACIDS RESEARCH
Volume 40, Issue 15, Pages 6993-7015
Publisher
Oxford University Press (OUP)
Online
2012-05-15
DOI
10.1093/nar/gks408
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Succinct data structures for assembling large genomes
- (2011) Thomas C. Conway et al. BIOINFORMATICS
- Structator: fast index-based search for RNA sequence-structure patterns
- (2011) Fernando Meyer et al. BMC BIOINFORMATICS
- Space-efficient construction of Lempel–Ziv compressed text indexes
- (2011) Diego Arroyuelo et al. INFORMATION AND COMPUTATION
- A quick tour on suffix arrays and compressed suffix arrays
- (2011) Roberto Grossi THEORETICAL COMPUTER SCIENCE
- Stronger Lempel-Ziv Based Compressed Text Indexing
- (2010) Diego Arroyuelo et al. ALGORITHMICA
- RepMaestro: scalable repeat detection on disk-based genome sequences
- (2010) Nikolas Askitis et al. BIOINFORMATICS
- Efficient construction of an assembly string graph using the FM-index
- (2010) J. T. Simpson et al. BIOINFORMATICS
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- (2010) Ge Nong et al. IEEE TRANSACTIONS ON COMPUTERS
- Suffix trees for inputs larger than main memory
- (2010) Marina Barsky et al. INFORMATION SYSTEMS
- Storage and Retrieval of Highly Repetitive Sequence Collections
- (2010) Veli Mäkinen et al. JOURNAL OF COMPUTATIONAL BIOLOGY
- A survey of practical algorithms for suffix tree construction in external memory
- (2010) M. Barsky et al. SOFTWARE-PRACTICE & EXPERIENCE
- SHREC: a short-read error correction method
- (2009) J. Schroder et al. BIOINFORMATICS
- A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays
- (2009) Zia Khan et al. BIOINFORMATICS
- SOAP2: an improved ultrafast tool for short read alignment
- (2009) R. Li et al. BIOINFORMATICS
- Fast and accurate short read alignment with Burrows-Wheeler transform
- (2009) H. Li et al. BIOINFORMATICS
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- (2009) Enno Ohlebusch et al. INFORMATION PROCESSING LETTERS
- Sense from sequence reads: methods for alignment and assembly
- (2009) Paul Flicek et al. NATURE METHODS
- Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
- (2009) Wing-Kai Hon et al. SIAM JOURNAL ON COMPUTING
- A four-stage algorithm for updating a Burrows–Wheeler transform
- (2009) M. Salson et al. THEORETICAL COMPUTER SCIENCE
- Faster entropy-bounded compressed suffix trees
- (2009) Johannes Fischer et al. THEORETICAL COMPUTER SCIENCE
- Fast Mapping of Short Sequences with Mismatches, Insertions and Deletions Using Index Structures
- (2009) Steve Hoffmann et al. PLoS Computational Biology
- Searching for SNPs with cloud computing
- (2009) Ben Langmead et al. GENOME BIOLOGY
- Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
- (2009) Ben Langmead et al. GENOME BIOLOGY
- SeqAn An efficient, generic C++ library for sequence analysis
- (2008) Andreas Döring et al. BMC BIOINFORMATICS
- De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer
- (2008) D. Hernandez et al. GENOME RESEARCH
- A compressed self-index using a Ziv–Lempel dictionary
- (2008) Luís M. S. Russo et al. Information Retrieval Journal
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now