Sciweavers

10988 search results - page 29 / 2198
» Algorithmic Folding Complexity
Sort
View
RECOMB
2011
Springer
12 years 11 months ago
Rich Parameterization Improves RNA Structure Prediction
Motivation. Current approaches to RNA structure prediction range from physics-based methods, which rely on thousands of experimentally-measured thermodynamic parameters, to machin...
Shay Zakov, Yoav Goldberg, Michael Elhadad, Michal...
ISBI
2008
IEEE
14 years 9 months ago
Defining cortical sulcus patterns using partial clustering based on bootstrap and bagging
The cortical folding patterns are very different from one individual to another. Here we try to find folding patterns automatically using large-scale datasets by non-supervised cl...
Zhong Yi Sun, Denis Rivière, Edouard Duches...
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
14 years 22 days ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
ICCV
2009
IEEE
1052views Computer Vision» more  ICCV 2009»
15 years 1 months ago
A direct approach for efficiently tracking with 3D Morphable Models
We present an efficient algorithm for fitting a morphable model to an image sequence. It is built on a projective geometry formulation of perspective projection, which results in a...
Enrique Muñoz, José M. Buenaposada, Luis Baumela
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida