A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Finding Optimal Alignment and Consensus of Circular Strings
[chapter]
2010
Lecture Notes in Computer Science
We consider the problem of finding the optimal alignment and consensus (string) of circular strings. Circular strings are different from linear strings in that the first (leftmost) symbol of a circular string is wrapped around next to the last (rightmost) symbol. In nature, for example, bacterial and mitochondrial DNAs typically form circular strings. The consensus string problem is finding a representative string (consensus) of a given set of strings, and it has been studied on linear strings
doi:10.1007/978-3-642-13509-5_28
fatcat:mxwhkae6p5aypnon47egsshnfm