10988 search results - page 8 / 2198 » Algorithmic Folding Complexity |
NIPS
2008
15 years 1 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
AI
2003
Springer
15 years 5 months ago
2003
Springer
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
103
click to vote
BMCBI
2005
14 years 11 months ago
2005
Background: The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to for...
ISMB
1996
15 years 1 months ago
1996
Weshowin this paper that manypopular models of folding and/or alignment maybe described by a new formalism: multi-tape S-attribute grammars(MTSAG's).This formalism relieves t...
BMCBI
2007
14 years 11 months ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...