Sciweavers

10988 search results - page 31 / 2198
» Algorithmic Folding Complexity
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 9 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
EUROGP
2005
Springer
14 years 2 months ago
Evolving L-Systems to Capture Protein Structure Native Conformations
Abstract. A protein is a linear chain of amino acids that folds into a unique functional structure, called its native state. In this state, proteins show repeated substructures lik...
Gabi Escuela, Gabriela Ochoa, Natalio Krasnogor
DAC
2005
ACM
13 years 11 months ago
Response compaction with any number of unknowns using a new LFSR architecture
This paper presents a new test response compaction technique with any number of unknown logic values (X’s) in the test response bits. The technique leverages an X-tolerant respo...
Erik H. Volkerink, Subhasish Mitra
GCB
2010
Springer
198views Biometrics» more  GCB 2010»
13 years 7 months ago
RNALfoldz: Efficient Prediction of Thermodynamically Stable, Local Secondary Structures
Abstract: The search for local RNA secondary structures and the annotation of unusually stable folding regions in genomic sequences are two well motivated bioinformatic problems. I...
Andreas R. Gruber, Stephan H. F. Bernhart, You Zho...