71 search results - page 3 / 15 » Comparing Best-First Search and Dynamic Programming for Opti... |
BIBM
2007
IEEE
14 years 21 days ago
2007
IEEE
In this paper, we present an algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. Our algorithm can be fu...
CSB
2005
IEEE
13 years 12 months ago
2005
IEEE
We present TreeRefiner, a tool for refining multiple alignments of biological sequences. Given a multiple alignment, a phylogenetic tree, and scoring parameters as input, TreeRefi...
ISMB
1994
13 years 7 months ago
1994
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
CP
2003
Springer
13 years 11 months ago
2003
Springer
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...
BMCBI
2011
12 years 10 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...