Sciweavers

71 search results - page 1 / 15
» Comparing Best-First Search and Dynamic Programming for Opti...
Sort
View
IJCAI
2003
13 years 6 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
COCOA
2007
Springer
13 years 11 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
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
13 years 10 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
BMCBI
2006
139views more  BMCBI 2006»
13 years 5 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
BMEI
2008
IEEE
13 years 11 months ago
A New Approach for Tree Alignment Based on Local Re-Optimization
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
Feng Yue, Jijun Tang