RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
RECOMB
1997
Springer
13 years 8 months ago
1997
Springer
RECOMB
1997
Springer
13 years 8 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...