Sciweavers

23 search results - page 1 / 5
» Lower bounds on multiple sequence alignment using exact 3-wa...
Sort
View
BMCBI
2007
153views more  BMCBI 2007»
13 years 2 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
RECOMB
2004
Springer
14 years 2 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
BMCBI
2007
107views more  BMCBI 2007»
13 years 2 months ago
Progressive multiple sequence alignments from triplets
Motivation: The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step c...
Matthias Kruspe, Peter F. Stadler
COCOA
2007
Springer
13 years 8 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
CIBCB
2007
IEEE
13 years 8 months ago
Overestimation for Multiple Sequence Alignment
Abstract— Multiple sequence alignment is an important problem in computational biology. A-star is an algorithm that can be used to find exact alignments. We present a simple mod...
Tristan Cazenave