Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment

DOI10.1007/978-3-319-20086-6_19zbMath1462.68244DBLPconf/wea/BartonIKPRV15OpenAlexW2537423815WikidataQ60315586 ScholiaQ60315586MaRDI QIDQ2948308

Ahmad Retha, Carl Barton, Costas S. Iliopoulos, Fatima Vayani, Solon P. Pissis, Ritu Kundu

Publication date: 30 September 2015

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20086-6_19

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (5)

Circular Sequence Comparison with q-grams ⋮ Tight Hardness Results for Consensus Problems on Circular Strings and Time Series ⋮ Searching and Indexing Circular Patterns ⋮ Alignment-free sequence comparison using absent words ⋮ Circular pattern matching with \(k\) mismatches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of Aho Corasick automaton in linear time for integer alphabets
• On a cyclic string-to-string correction problem
• Comparison of phylogenetic trees
• Fast and practical approximate string matching
• On-line construction of suffix trees
• Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny
• Average-Case Optimal Approximate Circular String Matching
• 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

This page was built for publication: Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment