Name
Abstract | ||
|---|---|---|
The analysis of biochemical networks is mainly done using relational or procedu- ral languages. Combining or designing new analyses requires lot of programming effort that cannot be reused for other analyses. To overcome these limitations, we introduce CP(BioNet) a new constraint programming domain for the analysis of biochemical networks. Analyses are formulated using constraints over graph domain variables. The constraints are then solved by a constraint solver designed for biochemical networks. This provides a flexible and powerful approach as simple analyses can then easily be combined to form complex ones. We focus here on Constrained path finding, finding a path from node A to node B in a graph with additional constraints, such as requiring this path to include a predefined set of mandatory intermediate nodes. Constraints for path finding are introduced and their implementation (propagators) is described. A prototype is presented and constrained path finding experiments are performed and analyzed to illustrate the benefits of this new approach. MOTS-CLÉS :Réseaux biochimiques, analyse de réseaux, programmation par contraintes, analyse de graphes |
Year | Venue | Keywords |
|---|---|---|
2004 | JFPLC | graph analysis.,constraint programming,mots-clés : réseaux biochimiques,network analysis,analyse de réseaux,analyse de graphes keywords: biochemical networks,programmation par contraintes |
Field | DocType | Citations |
Procedural programming,Graph,Mathematical optimization,Constraint programming,Constraint satisfaction problem,Mathematics | Conference | 2 |
PageRank | References | Authors |
0.45 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grégoire Dooms | 1 | 65 | 5.01 |
| Yves Deville | 2 | 987 | 110.84 |
| Pierre Dupont | 3 | 380 | 29.30 |