Sciweavers

CPM
2001
Springer
72views Combinatorics» more  CPM 2001»
14 years 5 months ago
Tandem Cyclic Alignment
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
Gary Benson