224 search results - page 10 / 45 » The Complexity of Phrase Alignment Problems |
127
Voted
BMEI
2008
IEEE
15 years 9 months ago
2008
IEEE
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...
138
Voted
CPM
2008
Springer
15 years 4 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
129
Voted
CSJM
2006
15 years 2 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
122
Voted
KELSI
2004
Springer
15 years 8 months ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
114
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...