Sciweavers

184 search results - page 5 / 37
» A branch-and-cut algorithm for multiple sequence alignment
Sort
View
RECOMB
1997
Springer
13 years 12 months ago
Progressive multiple alignment with constraints
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 ...
Gene Myers, Sanford Selznick, Zheng Zhang 0004, We...
BMCBI
2005
134views more  BMCBI 2005»
13 years 7 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
BMCBI
2008
122views more  BMCBI 2008»
13 years 7 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood
ALMOB
2006
106views more  ALMOB 2006»
13 years 7 months ago
Multiple sequence alignment with user-defined anchor points
Background: Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the qua...
Burkhard Morgenstern, Sonja J. Prohaska, Dirk P&ou...
CIBCB
2007
IEEE
14 years 2 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