Graphs for Core Molecular Biology

@misc{citeulike:485720, abstract = {A graphic language---the graphic \# calculus---modeling protein interactions at the domain level is introduced. Complexation, activation and mixed forms of interaction are expressed as graph rewriting rules. A compilation in a low-level graph rewriting calculus, called mobile \#, is given and shown to be correct up to some suitable notion of observational equivalence. This intermediate language is of independent interest and can be easily implemented in \#-like calculi.}, author = {Danos, V. and Laneve, C. }, citeulike-article-id = {485720}, keywords = {bio, formalism, graphrewriting, network}, posted-at = {2006-01-30 10:25:49}, priority = {2}, title = {Graphs for Core Molecular Biology}, url = {http://citeseer.ist.psu.edu/613887.html}, year = {2003} }

TY - GEN ID - citeulike:485720 L3 - citeulike-article-id:485720 N2 - A graphic language---the graphic # calculus---modeling protein interactions at the domain level is introduced. Complexation, activation and mixed forms of interaction are expressed as graph rewriting rules. A compilation in a low-level graph rewriting calculus, called mobile #, is given and shown to be correct up to some suitable notion of observational equivalence. This intermediate language is of independent interest and can be easily implemented in #-like calculi. TI - Graphs for Core Molecular Biology KW - bio KW - formalism KW - graphrewriting KW - network AU - Danos, V AU - Laneve, C PY - 2003/// UR - http://citeseer.ist.psu.edu/613887.html ER -