10988 search results - page 23 / 2198 » Algorithmic Folding Complexity |
BIBE
2008
IEEE
14 years 3 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
BMCBI
2008
13 years 9 months ago
2008
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
WABI
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
ISBI
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we describe the use of three different shape measures -- i.e., shape index, curvedness, and L2 norm of mean curvature -- to quantify cortical gyrification and compl...
BMCBI
2004
13 years 8 months ago
2004
Background: An increasing number of researchers have released novel RNA structure analysis and prediction algorithms for comparative approaches to structure prediction. Yet, indep...