Finding optimal alignment and consensus of circular strings

DOI10.1007/978-3-642-13509-5_28MaRDI QIDQ3575257zbMATH OpenOpenAlexFDO

Authors Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, J. S. Sim

Publication date 26 July 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13509-5_28

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Finding consensus and optimal alignment of circular strings
• Efficient algorithms for consensus string problems minimizing both distance sum and radius
• Tight hardness results for consensus problems on circular strings and time series
• Finding similar regions in many strings
• Fast circular dictionary-matching algorithm

Cited in

(5)

• Finding consensus and optimal alignment of circular strings
• Accurate and efficient methods to improve multiple circular sequence alignment
• Searching and indexing circular patterns
• Finding rotational symmetries by cyclic string matching
• Tight hardness results for consensus problems on circular strings and time series

This page was built for publication: Finding optimal alignment and consensus of circular strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575257)