Better greedy sequence clustering with fast banded alignment
From MaRDI portal
Publication:5111792
Recommendations
- A heuristic clustering method based on neighbor-seeds for 454 sequencing data
- Fast embedding methods for clustering tens of thousands of sequences
- Clustering Near-Identical Sequences for Fast Homology Search
- A Comparative Study of Protein Sequence Clustering Algorithms
- Estimating sequence similarity from read sets for clustering next-generation sequencing data
Cites work
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- A faster algorithm computing string edit distances
- Algorithms on Strings, Trees and Sequences
- An \(O(ND)\) difference algorithm and its variations
Cited in
(5)- Efficient relaxed search in hierarchically clustered sequence datasets
- Estimating sequence similarity from read sets for clustering next-generation sequencing data
- A heuristic clustering method based on neighbor-seeds for 454 sequencing data
- Fast embedding methods for clustering tens of thousands of sequences
- A succinct four Russians speedup for edit distance computation and one-against-many banded alignment
This page was built for publication: Better greedy sequence clustering with fast banded alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111792)
