Algorithms for indexing highly similar DNA sequences
From MaRDI portal
Recommendations
- Indexing similar DNA sequences
- Full-text indexes for high-throughput sequencing
- An efficient similarity search based on indexing in large DNA databases
- Algorithms for next-generation sequencing data. Techniques, approaches, and applications
- String-matching and alignment algorithms for finding motifs in NGS data
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- An experimental study of an opportunistic index
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Approximate string matching with suffix automata
- Combinatorial Pattern Matching
- Complete inverted files for efficient text retrieval and analysis
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Efficient string matching
- Elements of Information Theory
- Encyclopedia of Database Systems
- Engineering a lightweight suffix array construction algorithm
- Fast relative Lempel-Ziv self-index for similar sequences
- Faster suffix sorting
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 1962793 (Why is no real title available?)
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 6469201 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- Indexing compressed text
- Indexing similar DNA sequences
- Linear-time construction of suffix arrays (extended abstract)
- New text indexing functionalities of the compressed suffix arrays
- On the Complexity of Finite Sequences
- On the sorting-complexity of suffix tree construction
- On-line construction of compact directed acyclic word graphs
- On-line construction of suffix trees
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Reducing the Space Requirement of LZ-Index
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Space efficient linear time construction of suffix arrays
- String Processing and Information Retrieval
- Suffix Arrays: A New Method for On-Line String Searches
- Suffix tree of alignment: an efficient index for similar data
- The smallest automaton recognizing the subwords of a text
Cited in
(10)- Estimating sequence similarity from read sets for clustering next-generation sequencing data
- An efficient similarity search based on indexing in large DNA databases
- On-line string matching in highly similar DNA sequences
- Full-text indexes for high-throughput sequencing
- DNA-seq error correction based on substring indices
- String-matching and alignment algorithms for finding motifs in NGS data
- scientific article; zbMATH DE number 5671091 (Why is no real title available?)
- Indexing similar DNA sequences
- Algorithms for next-generation sequencing data. Techniques, approaches, and applications
- scientific article; zbMATH DE number 5172014 (Why is no real title available?)
This page was built for publication: Algorithms for indexing highly similar DNA sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305514)
