Accurate and efficient methods to improve multiple circular sequence alignment
From MaRDI portal
Recommendations
- Circular sequence comparison with q-grams
- scientific article; zbMATH DE number 5171932
- Fast vectorized distance matrix computation for multiple sequence alignment on multi-cores
- Finding optimal alignment and consensus of circular strings
- A simple, fast, filter-based algorithm for circular sequence comparison
Cites work
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
- Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny
- Average-case optimal approximate circular string matching
- Comparison of phylogenetic trees
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Fast and practical approximate string matching
- scientific article; zbMATH DE number 3845091 (Why is no real title available?)
- scientific article; zbMATH DE number 1857503 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- On a cyclic string-to-string correction problem
- On-line construction of suffix trees
Cited in
(8)- Alignment-free sequence comparison using absent words
- Finding consensus and optimal alignment of circular strings
- Searching and indexing circular patterns
- Tight hardness results for consensus problems on circular strings and time series
- Circular helix-like curve: an effective tool of biological sequence analysis and comparison
- Circular sequence comparison with q-grams
- Circular pattern matching with \(k\) mismatches
- Approximate circular pattern matching
This page was built for publication: Accurate and efficient methods to improve multiple circular sequence alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948308)
