TY - CONF
TI - Applications of Categories to Biology and Cognition
AU - Ehresmann, Andrée C.
DA - 2018///
PY - 2018
DO - 10/ggdf93
DP - Semantic Scholar
KW - Biology
KW - Emergence
KW - Neuroscience
ER -
TY - JOUR
TI - BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge
AU - Fages, F.
AU - Calzone, L.
AU - Soliman, S.
T2 - Bioinformatics
DA - 2006/07/15/
PY - 2006
DO - 10/dfv
DP - Crossref
VL - 22
IS - 14
SP - 1805
EP - 1807
LA - en
SN - 1367-4803, 1460-2059
ST - BIOCHAM
UR - https://academic.oup.com/bioinformatics/article-lookup/doi/10.1093/bioinformatics/btl172
Y2 - 2019/11/23/07:28:51
KW - Abstract machines
KW - Biology
KW - Implementation
KW - Rewriting theory
KW - Symbolic logic
KW - Systems biology
ER -
TY - JOUR
TI - Category Theory for Genetics
AU - Tuyéras, Rémy
T2 - arXiv:1708.05255 [math]
AB - We introduce a categorical language in which it is possible to talk about DNA sequencing, alignment methods, CRISPR, homologous recombination, haplotypes, and genetic linkage. This language takes the form of a class of limit-sketches whose categories of models can model different concepts of Biology depending on what their categories of values are. We discuss examples of models in the category of sets and in the category of modules over the Boolean semi-ring $\{0,1\}$. We identify a subclass of models in sets that models the genetic material of living beings and another subclass of models in modules that models haplotypes. We show how the two classes are related via a universal property.
DA - 2018/05/17/
PY - 2018
DP - arXiv.org
UR - http://arxiv.org/abs/1708.05255
Y2 - 2019/11/28/23:35:38
KW - Biology
ER -
TY - JOUR
TI - Category theory for genetics I: mutations and sequence alignments
AU - Tuyéras, Rémy
T2 - arXiv:1805.07002 [math]
AB - The present article is the first of a series whose goal is to define a logical formalism in which it is possible to reason about genetics. In this paper, we introduce the main concepts of our language whose domain of discourse consists of a class of limit-sketches and their associated models. While our program will aim to show that different phenomena of genetics can be modeled by changing the category in which the models take their values, in this paper, we study models in the category of sets to capture mutation mechanisms such as insertions, deletions, substitutions, duplications and inversions. We show how the proposed formalism can be used for constructing multiple sequence alignments with an emphasis on mutation mechanisms.
DA - 2018/12/13/
PY - 2018
DP - arXiv.org
ST - Category theory for genetics I
UR - http://arxiv.org/abs/1805.07002
Y2 - 2019/11/28/23:36:03
KW - Biology
ER -
TY - JOUR
TI - Category theory for genetics II: genotype, phenotype and haplotype
AU - Tuyéras, Rémy
T2 - arXiv:1805.07004 [math]
AB - In this paper, we use the language of pedigrads, introduced in previous work, to formalize the relationship between genotypes, phenotypes and haplotypes. We show how this formalism can help us localize the variations in the genotype that cause a given phenotype. We then use the concept of haplotype to formalize the process of predicting a certain phenotype for a given set of genotypes.
DA - 2018/08/01/
PY - 2018
DP - arXiv.org
ST - Category theory for genetics II
UR - http://arxiv.org/abs/1805.07004
Y2 - 2019/11/28/23:36:18
KW - Biology
ER -
TY - CONF
TI - Cells as Machines: Towards Deciphering Biochemical Programs in the Cell
AU - Fages, François
A2 - Natarajan, Raja
T3 - Lecture Notes in Computer Science
AB - Systems biology aims at understanding complex biological processes in terms of their basic mechanisms at the molecular level in cells. The bet of applying theoretical computer science concepts and software engineering methods to the analysis of distributed biochemical reaction systems in the cell, designed by natural evolution, has led to interesting challenges in computer science, and new model-based insights in biology. In this paper, we review the development over the last decade of the biochemical abstract machine (Biocham) software environment for modeling cell biology molecular reaction systems, reasoning about them at different levels of abstraction, formalizing biological behaviors in temporal logic with numerical constraints, and using them to infer non-measurable kinetic parameter values, evaluate robustness, decipher natural biochemical processes and implement new programs in synthetic biology.
C1 - Cham
C3 - Distributed Computing and Internet Technology
DA - 2014///
PY - 2014
DO - 10/ggdf96
DP - Springer Link
SP - 50
EP - 67
LA - en
PB - Springer International Publishing
SN - 978-3-319-04483-5
ST - Cells as Machines
KW - Biology
KW - Rewriting theory
KW - Symbolic logic
KW - Systems biology
ER -
TY - JOUR
TI - Conciliating neuroscience and phenomenology via category theory
AU - Ehresmann, Andrée C.
AU - Gomez-Ramirez, Jaime
T2 - Progress in Biophysics and Molecular Biology
T3 - Integral Biomathics: Life Sciences, Mathematics, and Phenomenological Philosophy
AB - The paper discusses how neural and mental processes correlate for developing cognitive abilities like memory or spatial representation and allowing the emergence of higher cognitive processes up to embodied cognition, consciousness and creativity. It is done via the presentation of MENS (for Memory Evolutive Neural System), a mathematical methodology, based on category theory, which encompasses the neural and mental systems and analyzes their dynamics in the process of ‘becoming’. Using the categorical notion of a colimit, it describes the generation of mental objects through the iterative binding of distributed synchronous assemblies of neurons, and presents a new rationale of spatial representation in the hippocampus (Gómez-Ramirez and Sanz, 2011). An important result is that the degeneracy of the neural code (Edelman, 1989) is the property allowing for the formation of mental objects and cognitive processes of increasing complexity order, with multiple neuronal realizabilities; it is essential “to explain certain empirical phenomena like productivity and systematicity of thought and thinking (Aydede 2010)”. Rather than restricting the discourse to linguistics or philosophy of mind, the formal methods used in MENS lead to precise notions of Compositionality, Productivity and Systematicity, which overcome the dichotomic debate of classicism vs. connectionism and their multiple facets. It also allows developing the naturalized phenomenology approach asked for by Varela (1996) which “seeks articulations by mutual constraints between phenomena present in experience and the correlative field of phenomena established by the cognitive sciences”, while avoiding their pitfalls.
DA - 2015/12/01/
PY - 2015
DO - 10/f75jzr
DP - ScienceDirect
VL - 119
IS - 3
SP - 347
EP - 359
J2 - Progress in Biophysics and Molecular Biology
LA - en
SN - 0079-6107
UR - http://www.sciencedirect.com/science/article/pii/S0079610715001005
Y2 - 2019/11/28/23:48:27
KW - Biology
KW - Emergence
KW - Neuroscience
KW - Psychology
KW - Sketchy
ER -
TY - JOUR
TI - Influence Networks Compared with Reaction Networks: Semantics, Expressivity and Attractors
AU - Fages, Francois
AU - Martinez, Thierry
AU - Rosenblueth, David A.
AU - Soliman, Sylvain
T2 - IEEE/ACM Trans. Comput. Biol. Bioinformatics
AB - Biochemical reaction networks are one of the most widely used formalisms in systems biology to describe the molecular mechanisms of high-level cell processes. However, modellers also reason with influence diagrams to represent the positive and negative influences between molecular species and may find an influence network useful in the process of building a reaction network. In this paper, we introduce a formalism of influence networks with forces, and equip it with a hierarchy of Boolean, Petri net, stochastic and differential semantics, similarly to reaction networks with rates. We show that the expressive power of influence networks is the same as that of reaction networks under the differential semantics, but weaker under the discrete semantics. Furthermore, the hierarchy of semantics leads us to consider a positive Boolean semantics that cannot test the absence of a species, that we compare with the negative Boolean semantics with test for absence of a species in gene regulatory networks à la Thomas. We study the monotonicity properties of the positive semantics and derive from them an algorithm to compute attractors in both the positive and negative Boolean semantics. We illustrate our results on models of the literature about the p53/Mdm2 DNA damage repair system, the circadian clock, and the influence of MAPK signaling on cell-fate decision in urinary bladder cancer.
DA - 2018/07//
PY - 2018
DO - 10/ggdf94
DP - ACM Digital Library
VL - 15
IS - 4
SP - 1138
EP - 1151
SN - 1545-5963
ST - Influence Networks Compared with Reaction Networks
UR - https://doi.org/10.1109/TCBB.2018.2805686
Y2 - 2019/11/23/07:40:24
KW - Biology
KW - Rewriting theory
KW - Symbolic logic
KW - Systems biology
ER -
TY - CONF
TI - Machine Learning Biochemical Networks from Temporal Logic Properties
AU - Fages, François
AU - Calzone, Laurence
AU - Chabrier-Rivier, Nathalie
AU - Soliman, Sylvain
A2 - Priami, Corrado
A2 - Plotkin, Gordon
T3 - Lecture Notes in Computer Science
AB - One central issue in systems biology is the definition of formal languages for describing complex biochemical systems and their behavior at different levels. The biochemical abstract machine BIOCHAM is based on two formal languages, one rule-based language used for modeling biochemical networks, at three abstraction levels corresponding to three semantics: boolean, concentration and population; and one temporal logic language used for formalizing the biological properties of the system. In this paper, we show how the temporal logic language can be turned into a specification language. We describe two algorithms for inferring reaction rules and kinetic parameter values from a temporal specification formalizing the biological data. Then, with an example of the cell cycle control, we illustrate how these machine learning techniques may be useful to the modeler.
C1 - Berlin, Heidelberg
C3 - Transactions on Computational Systems Biology VI
DA - 2006///
PY - 2006
DO - 10/dd8
DP - Springer Link
SP - 68
EP - 94
LA - en
PB - Springer
SN - 978-3-540-46236-1
KW - Abstract machines
KW - Biology
KW - Classical ML
KW - Machine learning
KW - Symbolic logic
KW - Systems biology
ER -
TY - JOUR
TI - On Emergence and Explanation
AU - Baas, Nils Andreas
AU - Emmeche, Claus
T2 - Intellectica. Revue de l'Association pour la Recherche Cognitive
AB - Emergence is a universal phenomenon that can be defined mathematically in a very general way. This is useful for the study of scientifically legitimate explanations of complex systems, here defined as hyperstructures. A requirement is that observation mechanisms are considered within the general framework. Two notions of emergence are defined, and specific examples of these are discussed.
DA - 1997///
PY - 1997
DO - 10/ggdf9z
DP - Crossref
VL - 25
IS - 2
SP - 67
EP - 83
LA - en
SN - 0769-4113
UR - https://www.persee.fr/doc/intel_0769-4113_1997_num_25_2_1558
Y2 - 2019/11/22/17:59:11
KW - Biology
KW - Emergence
ER -
TY - CONF
TI - Operads and Phylogenetic Trees
AU - Baez, John C.
AU - Otter, Nina
AB - We construct an operad $\mathrm{Phyl}$ whose operations are the edge-labelled trees used in phylogenetics. This operad is the coproduct of $\mathrm{Com}$, the operad for commutative semigroups, and $[0,\infty)$, the operad with unary operations corresponding to nonnegative real numbers, where composition is addition. We show that there is a homeomorphism between the space of $n$-ary operations of $\mathrm{Phyl}$ and $\mathcal{T}_n\times [0,\infty)^{n+1}$, where $\mathcal{T}_n$ is the space of metric $n$-trees introduced by Billera, Holmes and Vogtmann. Furthermore, we show that the Markov models used to reconstruct phylogenetic trees from genome data give coalgebras of $\mathrm{Phyl}$. These always extend to coalgebras of the larger operad $\mathrm{Com} + [0,\infty]$, since Markov processes on finite sets converge to an equilibrium as time approaches infinity. We show that for any operad $O$, its coproduct with $[0,\infty]$ contains the operad $W(O)$ constucted by Boardman and Vogt. To prove these results, we explicitly describe the coproduct of operads in terms of labelled trees.
DA - 2015///
PY - 2015
DP - Semantic Scholar
KW - Biology
KW - Coalgebras
ER -
TY - CONF
TI - Rule-Based Modelling, Symmetries, Refinements
AU - Danos, Vincent
AU - Feret, Jérôme
AU - Fontana, Walter
AU - Harmer, Russell
AU - Krivine, Jean
A2 - Fisher, Jasmin
T3 - Lecture Notes in Computer Science
AB - Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between partial complexes, and the ability to write rules with such partial complexes -i.e., not to have to specify all the traits of the entitities partaking in a reaction but just those that matter- is the key to obtaining compact descriptions of what otherwise could be nearly infinite dimensional dynamical systems. This also makes these descriptions easier to read, write and modify.In the course of modelling a particular signalling system it will often happen that more traits matter in a given interaction than previously thought, and one will need to strengthen the conditions under which that interaction may happen. This is a process that we call rule refinement and which we set out in this paper to study. Specifically we present a method to refine rule sets in a way that preserves the implied stochastic semantics.This stochastic semantics is dictated by the number of different ways in which a given rule can be applied to a system (obeying the mass action principle). The refinement formula we obtain explains how to refine rules and which choice of refined rates will lead to a neutral refinement, i.e., one that has the same global activity as the original rule had (and therefore leaves the dynamics unchanged). It has a pleasing mathematical simplicity, and is reusable with little modification across many variants of stochastic graph rewriting. A particular case of the above is the derivation of a maximal refinement which is equivalent to a (possibly infinite) Petri net and can be useful to get a quick approximation of the dynamics and to calibrate models. As we show with examples, refinement is also useful to understand how different subpopulations contribute to the activity of a rule, and to modulate differentially their impact on that activity.
C1 - Berlin, Heidelberg
C3 - Formal Methods in Systems Biology
DA - 2008///
PY - 2008
DO - 10/dc5k68
DP - Springer Link
SP - 103
EP - 122
LA - en
PB - Springer
SN - 978-3-540-68413-8
KW - Biology
KW - Rewriting theory
KW - Systems biology
ER -
TY - BOOK
TI - Stochastic Modelling for Systems Biology
AU - Wilkinson, Darren J.
AB - Although stochastic kinetic models are increasingly accepted as the best way to represent and simulate genetic and biochemical networks, most researchers in the field have limited knowledge of stochastic process theory. The stochastic processes formalism provides a beautiful, elegant, and coherent foundation for chemical kinetics and there is a wealth of associated theory every bit as powerful and elegant as that for conventional continuous deterministic models. The time is right for an introductory text written from this perspective. Stochastic Modelling for Systems Biology presents an accessible introduction to stochastic modelling using examples that are familiar to systems biology researchers. Focusing on computer simulation, the author examines the use of stochastic processes for modelling biological systems. He provides a comprehensive understanding of stochastic kinetic modelling of biological networks in the systems biology context. The text covers the latest simulation techniques and research material, such as parameter inference, and includes many examples and figures as well as software code in R for various applications.While emphasizing the necessary probabilistic and stochastic methods, the author takes a practical approach, rooting his theoretical development in discussions of the intended application. Written with self-study in mind, the book includes technical chapters that deal with the difficult problems of inference for stochastic kinetic models from experimental data. Providing enough background information to make the subject accessible to the non-specialist, the book integrates a fairly diverse literature into a single convenient and notationally consistent source.
DA - 2006/04/18/
PY - 2006
DP - Google Books
SP - 296
LA - en
PB - CRC Press
SN - 978-1-58488-540-5
KW - Bayesian inference
KW - Biology
KW - Implementation
KW - Probabilistic programming
KW - Rewriting theory
KW - Systems biology
KW - Transition systems
ER -
TY - JOUR
TI - Structures, Learning and Ergosystems: Chapters
AU - Gromov, Misha
AB - We introduce a concept of an ergosystem which functions by building its ”internal structure“ out of the ”raw structures“ in the incoming ﬂows of signals.
DP - Zotero
SP - 159
LA - en
KW - Biology
KW - Compendium
KW - Emergence
KW - Neuroscience
KW - Sketchy
ER -
TY - CONF
TI - Symetries and asymetries of the immune system response: A categorification approach
AU - Mascari, Jean-François
AU - Giacchero, Damien
AU - Sfakianakis, Nikolaos
T2 - 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
AB - A new modeling approach and conceptual framework to the immune system response and its dual role with respect to cancer is proposed based on Applied Category Theory. States of cells and pathogenes are structured as mathematical structures (categories), the interactions, at a given phase, between cells of the immune system and pathogenes, correspond to a pair of adjunctions (adjoint functors), the interaction process consisting of the sequential composition of an identification phase, a preparation phase and an activation phase is modeled by the composition of maps of adjunctions: the approach is illustrated by considering the Cancer-Immunity Cycle. A third dimension is needed to model Cancer Immunoediting. The categorical foundations of our approach is based on Marco Grandis and Rober Paré theory of Intercategories.
C3 - 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
DA - 2017/11//
PY - 2017
DO - 10/ggdnd3
DP - IEEE Xplore
SP - 1451
EP - 1454
ST - Symetries and asymetries of the immune system response
KW - Biology
KW - Sketchy
ER -
TY - JOUR
TI - The Kappa Language and Kappa Tools
AU - Boutillier, Pierre
AU - Feret, Jérôme
AU - Krivine, Jean
AU - Fontana, Walter
DP - Zotero
SP - 52
LA - en
KW - Biology
KW - Implementation
KW - Systems biology
ER -
TY - JOUR
TI - The Kappa platform for rule-based modeling
AU - Boutillier, Pierre
AU - Maasha, Mutaamba
AU - Li, Xing
AU - Medina-Abarca, Héctor F.
AU - Krivine, Jean
AU - Feret, Jérôme
AU - Cristescu, Ioana
AU - Forbes, Angus G.
AU - Fontana, Walter
T2 - Bioinformatics
AB - AbstractMotivation. We present an overview of the Kappa platform, an integrated suite of analysis and visualization techniques for building and interactively e
DA - 2018/07/01/
PY - 2018
DO - 10/gdrhw6
DP - academic.oup.com
VL - 34
IS - 13
SP - i583
EP - i592
J2 - Bioinformatics
LA - en
SN - 1367-4803
UR - https://academic.oup.com/bioinformatics/article/34/13/i583/5045802
Y2 - 2019/11/23/07:43:12
KW - Biology
KW - Implementation
KW - Rewriting theory
KW - Systems biology
ER -
TY - JOUR
TI - The representation of biological systems from the standpoint of the theory of categories
AU - Rosen, Robert
T2 - The Bulletin of Mathematical Biophysics
DA - 1958/12//
PY - 1958
DO - 10/fdgzxz
DP - Crossref
VL - 20
IS - 4
SP - 317
EP - 341
LA - en
SN - 0007-4985, 1522-9602
UR - http://link.springer.com/10.1007/BF02477890
Y2 - 2019/11/22/18:55:09
KW - Biology
KW - Sketchy
ER -