Sciweavers

211 search results - page 8 / 43
» Algorithms for Loosely Constrained Multiple Sequence Alignme...
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 4 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
96
Voted
COCOA
2007
Springer
15 years 5 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
CP
2003
Springer
15 years 4 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
99
Voted
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 5 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
BMCBI
2010
147views more  BMCBI 2010»
14 years 11 months ago
Automatic detection of anchor points for multiple sequence alignment
Background: Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software. This f...
Florian Pitschi, Claudine Devauchelle, Eduardo Cor...