Boolean constraint satisfaction problems for reaction networks
This Thesis presents research at the boundary between Statistical Physics and Biology. First, we have devised a class of Boolean constraint satisfaction problems (CSP) whose solutions describe the feasible operational states of a chemical reaction network. After developing statistical mechanics techniques to generate solutions and studying the properties of the solution space for both ensembles and individual instances of random reaction networks, we have applied this framework to the metabolic network of the bacterium E.Coli. Results highlight, on one hand, a complex organization of operational states into "modules" involving different biochemically-defined pathways, and, on the other, a high degree of cross-talk between modules. In summary, we propose that this class of CSPs may provide novel and useful quantitative information linking structure to function in cellular reaction networks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Quantum-Inspired Approximations to Constraint Satisfaction Problems
Two contrasting algorithmic paradigms for constraint satisfaction problems are successive local explorations of neighboring configurations versus producing new configurations using global information about the problem (e…
Learning to Select SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
Many constraint satisfaction and optimisation problems can be solved effectively by encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the simplest types of constraints have many encodi…
Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints
Determining the satisfiability of Boolean constraint-satisfaction problems with different types of constraints, that is hybrid constraints, is a well-studied problem with important applications. We study here a new appli…
Counting the Number of Solutions to Constraints
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints …
SurveyFourierCSP: Differentiable Constraint Satisfaction Problem Solving by Walsh-Fourier Expansion
The Constraint-satisfaction problem (CSP) is fundamental in mathematics, physics, and theoretical computer science. Continuous local search (CLS) solvers, as recent advancements, can achieve highly competitive results on…