Sciweavers

23 search results - page 4 / 5
» Combinatorial Interpretation of Kolmogorov Complexity
Sort
View
83
Voted
ICPADS
2008
IEEE
15 years 6 months ago
Parallel Large Scale Inference of Protein Domain Families
The resolution of combinatorial assortments of protein sequences into domains is a prerequisite for protein sequence interpretation. However the recognition and clustering of homo...
Daniel Kahn, Clément Rezvoy, Fréd&ea...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 1 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
ECCC
2010
106views more  ECCC 2010»
14 years 10 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
118
Voted
BMCBI
2008
121views more  BMCBI 2008»
14 years 11 months ago
Modularization of biochemical networks based on classification of Petri net t-invariants
Background: Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from ...
Eva Grafahrend-Belau, Falk Schreiber, Monika Heine...
BMCBI
2007
136views more  BMCBI 2007»
14 years 11 months ago
Reduced modeling of signal transduction - a modular approach
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
Markus Koschorreck, Holger Conzelmann, Sybille Ebe...