Sciweavers

1074 search results - page 21 / 215
» Alignment of Non-Overlapping Sequences
Sort
View
COCOA
2007
Springer
14 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
RECOMB
2001
Springer
14 years 11 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
COCOA
2007
Springer
14 years 5 months ago
A New Dynamic Programming Algorithm for Multiple Sequence Alignment
Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment alg...
Jean-Michel Richer, Vincent Derrien, Jin-Kao Hao
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 3 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