Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 10 de 10
Filtrar
1.
J Theor Biol ; 423: 31-40, 2017 06 21.
Artículo en Inglés | MEDLINE | ID: mdl-28435014

RESUMEN

Accurate estimation of evolutionary distances between taxa is important for many phylogenetic reconstruction methods. Distances can be estimated using a range of different evolutionary models, from single nucleotide polymorphisms to large-scale genome rearrangements. Corresponding corrections for genome rearrangement distances fall into 3 categories: Empirical computational studies, Bayesian/MCMC approaches, and combinatorial approaches. Here, we introduce a maximum likelihood estimator for the inversion distance between a pair of genomes, using a group-theoretic approach to modelling inversions introduced recently. This MLE functions as a corrected distance: in particular, we show that because of the way sequences of inversions interact with each other, it is quite possible for minimal distance and MLE distance to differently order the distances of two genomes from a third. The second aspect tackles the problem of accounting for the symmetries of circular arrangements. While, generally, a frame of reference is locked, and all computation made accordingly, this work incorporates the action of the dihedral group so that distance estimates are free from any a priori frame of reference. The philosophy of accounting for symmetries can be applied to any existing correction method, for which examples are offered.


Asunto(s)
Evolución Molecular , Genoma/genética , Filogenia , Funciones de Verosimilitud , Análisis Espacial
2.
J Math Biol ; 71(5): 1149-78, 2015 Nov.
Artículo en Inglés | MEDLINE | ID: mdl-25502846

RESUMEN

Establishing a distance between genomes is a significant problem in computational genomics, because its solution can be used to establish evolutionary relationships including phylogeny. The "double cut and join" (DCJ) model of chromosomal rearrangement proposed by Yancopoulos et al. (Bioinformatics 21:3340-3346, 2005) has received attention as it can model inversions, translocations, fusion and fission on a multichromosomal genome that may contain both linear and circular chromosomes. In this paper, we realize the DCJ operator as a group action on the space of multichromosomal genomes. We study this group action, deriving some properties of the group and finding group-theoretic analogues for the key results in the DCJ theory.


Asunto(s)
Reordenamiento Génico , Genoma , Modelos Genéticos , Cromosomas/genética , Evolución Molecular , Genómica , Conceptos Matemáticos , Filogenia
3.
J Math Biol ; 69(1): 243-65, 2014 Jul.
Artículo en Inglés | MEDLINE | ID: mdl-23793228

RESUMEN

The variation in genome arrangements among bacterial taxa is largely due to the process of inversion. Recent studies indicate that not all inversions are equally probable, suggesting, for instance, that shorter inversions are more frequent than longer, and those that move the terminus of replication are less probable than those that do not. Current methods for establishing the inversion distance between two bacterial genomes are unable to incorporate such information. In this paper we suggest a group-theoretic framework that in principle can take these constraints into account. In particular, we show that by lifting the problem from circular permutations to the affine symmetric group, the inversion distance can be found in polynomial time for a model in which inversions are restricted to acting on two regions. This requires the proof of new results in group theory, and suggests a vein of new combinatorial problems concerning permutation groups on which group theorists will be needed to collaborate with biologists. We apply the new method to inferring distances and phylogenies for published Yersinia pestis data.


Asunto(s)
Inversión Cromosómica/genética , Evolución Molecular , Variación Genética , Genoma Bacteriano/genética , Modelos Genéticos , Filogenia , Yersinia pestis/genética
4.
Front Genet ; 11: 1035, 2020.
Artículo en Inglés | MEDLINE | ID: mdl-33193592

RESUMEN

Measuring the distance between two bacterial genomes under the inversion process is usually done by assuming all inversions to occur with equal probability. Recently, an approach to calculating inversion distance using group theory was introduced, and is effective for the model in which only very short inversions occur. In this paper, we show how to use the group-theoretic framework to establish minimal distance for any weighting on the set of inversions, generalizing previous approaches. To do this we use the theory of rewriting systems for groups, and exploit the Knuth-Bendix algorithm, the first time this theory has been introduced into genome rearrangement problems. The central idea of the approach is to use existing group theoretic methods to find an initial path between two genomes in genome space (for instance using only short inversions), and then to deform this path to optimality using a confluent system of rewriting rules generated by the Knuth-Bendix algorithm.

5.
Philos Trans A Math Phys Eng Sci ; 373(2046)2015 Jul 28.
Artículo en Inglés | MEDLINE | ID: mdl-26078349

RESUMEN

Interaction computing is inspired by the observation that cell metabolic/regulatory systems construct order dynamically, through constrained interactions between their components and based on a wide range of possible inputs and environmental conditions. The goals of this work are to (i) identify and understand mathematically the natural subsystems and hierarchical relations in natural systems enabling this and (ii) use the resulting insights to define a new model of computation based on interactions that is useful for both biology and computation. The dynamical characteristics of the cellular pathways studied in systems biology relate, mathematically, to the computational characteristics of automata derived from them, and their internal symmetry structures to computational power. Finite discrete automata models of biological systems such as the lac operon, the Krebs cycle and p53-mdm2 genetic regulation constructed from systems biology models have canonically associated algebraic structures (their transformation semigroups). These contain permutation groups (local substructures exhibiting symmetry) that correspond to 'pools of reversibility'. These natural subsystems are related to one another in a hierarchical manner by the notion of 'weak control'. We present natural subsystems arising from several biological examples and their weak control hierarchies in detail. Finite simple non-Abelian groups are found in biological examples and can be harnessed to realize finitary universal computation. This allows ensembles of cells to achieve any desired finitary computational transformation, depending on external inputs, via suitably constrained interactions. Based on this, interaction machines that grow and change their structure recursively are introduced and applied, providing a natural model of computation driven by interactions.


Asunto(s)
Neuronas/fisiología , Animales , Apoptosis , División Celular , Ciclo del Ácido Cítrico , Simulación por Computador , Escherichia coli/metabolismo , Regulación de la Expresión Génica , Redes Reguladoras de Genes , Humanos , Operón Lac , Cómputos Matemáticos , Modelos Biológicos , Proteínas Proto-Oncogénicas c-mdm2/metabolismo , Proteína p53 Supresora de Tumor/metabolismo
6.
Biosystems ; 112(2): 145-62, 2013 May.
Artículo en Inglés | MEDLINE | ID: mdl-23499885

RESUMEN

Interaction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn.


Asunto(s)
Algoritmos , Fenómenos Químicos , Modelos Químicos , Dinámicas no Lineales , Simulación por Computador , Cinética , Temperatura
7.
Artif Life ; 14(3): 299-312, 2008.
Artículo en Inglés | MEDLINE | ID: mdl-18489252

RESUMEN

Beyond complexity measures, sometimes it is worthwhile in addition to investigate how complexity changes structurally, especially in artificial systems where we have complete knowledge about the evolutionary process. Hierarchical decomposition is a useful way of assessing structural complexity changes of organisms modeled as automata, and we show how recently developed computational tools can be used for this purpose, by computing holonomy decompositions and holonomy complexity. To gain insight into the evolution of complexity, we investigate the smoothness of the landscape structure of complexity under minimal transitions. As a proof of concept, we illustrate how the hierarchical complexity analysis reveals symmetries and irreversible structure in biological networks by applying the methods to the lac operon mechanism in the genetic regulatory network of Escherichia coli.


Asunto(s)
Redes Reguladoras de Genes , Modelos Genéticos , Algoritmos , Inteligencia Artificial , Evolución Biológica , Biología Computacional , Simulación por Computador , Escherichia coli/metabolismo , Proteínas de Escherichia coli/química , Evolución Molecular , Genes , Operón Lac , Modelos Biológicos , Modelos Teóricos , Biología de Sistemas
8.
Biosystems ; 94(1-2): 135-44, 2008.
Artículo en Inglés | MEDLINE | ID: mdl-18611428

RESUMEN

Biochemical and genetic regulatory networks are often modeled by Petri nets. We study the algebraic structure of the computations carried out by Petri nets from the viewpoint of algebraic automata theory. Petri nets comprise a formalized graphical modeling language, often used to describe computation occurring within biochemical and genetic regulatory networks, but the semantics may be interpreted in different ways in the realm of automata. Therefore, there are several different ways to turn a Petri net into a state-transition automaton. Here, we systematically investigate different conversion methods and describe cases where they may yield radically different algebraic structures. We focus on the existence of group components of the corresponding transformation semigroups, as these reflect symmetries of the computation occurring within the biological system under study. Results are illustrated by applications to the Petri net modelling of intermediary metabolism. Petri nets with inhibition are shown to be computationally rich, regardless of the particular interpretation method. Along these lines we provide a mathematical argument suggesting a reason for the apparent all-pervasiveness of inhibitory connections in living systems.


Asunto(s)
Algoritmos , Ciclo del Ácido Cítrico , Biología Computacional/métodos , Redes Reguladoras de Genes , Redes y Vías Metabólicas , Modelos Biológicos , Simulación por Computador
9.
Biosystems ; 94(1-2): 126-34, 2008.
Artículo en Inglés | MEDLINE | ID: mdl-18606208

RESUMEN

We propose a modeling and analysis method for biochemical reactions based on finite state automata. This is a completely different approach compared to traditional modeling of reactions by differential equations. Our method aims to explore the algebraic structure behind chemical reactions using automatically generated coordinate systems. In this paper we briefly summarize the underlying mathematical theory (the algebraic hierarchical decomposition theory of finite state automata) and describe how such automata can be derived from the description of chemical reaction networks. We also outline techniques for the flexible manipulation of existing models. As a real-world example we use the Krebs citric acid cycle.


Asunto(s)
Fenómenos Bioquímicos , Ciclo del Ácido Cítrico , Biología Computacional/métodos , Modelos Químicos
SELECCIÓN DE REFERENCIAS
DETALLE DE LA BÚSQUEDA