Sciweavers

10988 search results - page 91 / 2198
» Algorithmic Folding Complexity
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 10 months ago
Pairwise covariance adds little to secondary structure prediction but improves the prediction of non-canonical local structure
Background: Amino acid sequence probability distributions, or profiles, have been used successfully to predict secondary structure and local structure in proteins. Profile models ...
Christopher Bystroff, Bobbie-Jo M. Webb-Robertson
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 2 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich
JDA
2006
59views more  JDA 2006»
13 years 10 months ago
A note on the complexity of minimum dominating set
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
Fabrizio Grandoni

Book
393views
15 years 8 months ago
Computational Modeling and Complexity Science
"This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science"
Allen B. Downey
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
14 years 10 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...