Sciweavers

10988 search results - page 33 / 2198
» Algorithmic Folding Complexity
Sort
View
RECOMB
2002
Springer
14 years 9 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot
JCDL
2003
ACM
92views Education» more  JCDL 2003»
14 years 2 months ago
Correcting Common Distortions in Camera-Imaged Library Materials
We present a technique to correct image distortion that can occur when library materials are imaged by cameras. Our approach provides a general framework to undo a variety of comm...
Michael S. Brown, Desmond Tsoi
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
BMCBI
2010
102views more  BMCBI 2010»
13 years 9 months ago
SAMPLEX: Automatic mapping of perturbed and unperturbed regions of proteins and complexes
Background: The activity of proteins within the cell is characterized by their motions, flexibility, interactions or even the particularly intriguing case of partially unfolded st...
Mickaël Krzeminski, Karine Loth, Rolf Boelens...
ISBRA
2007
Springer
14 years 3 months ago
Reconstruction of 3D Structures from Protein Contact Maps
Proteins are large organic compounds made of amino acids arranged in a linear chain (primary structure). Most proteins fold into unique threedimensional (3D) structures called inte...
Marco Vassura, Luciano Margara, Filippo Medri, Pie...