25 search results - page 1 / 5 » Tandem Cyclic Alignment |
CPM
2001
Springer
14 years 3 months ago
2001
Springer
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...
RECOMB
1997
Springer
14 years 3 months ago
1997
Springer
Algorithm development for comparing and aligning biological sequences has, until recently, been based on the SI model of mutational events which assumes that modi cation of sequen...
WABI
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Traditional sequence comparison by alignment applies a mutation model comprising two events, substitutions and indels (insertions or deletions) of single positions (SI). ...
CPM
2001
Springer
14 years 3 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
RECOMB
2002
Springer
14 years 11 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...