Mathematical Sciences

Permanent URI for this communityhttps://scholarworks.montana.edu/handle/1/48

Mathematical research at MSU is focused primarily on related topics in pure and applied mathematics. Research programs complement each other and are often applied to problems in science and engineering. Research in statistics encompasses a broad range of theoretical and applied topics. Because the statisticians are actively engaged in interdisciplinary work, much of the statistical research is directed toward practical problems. Mathematics education faculty are active in both qualitative and quantitative experimental research areas. These include teacher preparation, coaching and mentoring for in-service teachers, online learning and curriculum development.

Browse

Filters

20221

Settings

Author: search.filters.author.Crawford-Kahrl, PeterSubject: search.filters.subject.genetic networks

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Genetic networks encode secrets of their past
    (Elsevier BV, 2022-03) Crawford-Kahrl, Peter; Nerem, Robert R.; Cummins, Bree; Gedeon, Tomas
    Research shows that gene duplication followed by either repurposing or removal of duplicated genes is an important contributor to evolution of gene and protein interaction networks. We aim to identify which characteristics of a network can arise through this process, and which must have been produced in a different way. To model the network evolution, we postulate vertex duplication and edge deletion as evolutionary operations on graphs. Using the novel concept of an ancestrally distinguished subgraph, we show how features of present-day networks require certain features of their ancestors. In particular, ancestrally distinguished subgraphs cannot be introduced by vertex duplication. Additionally, if vertex duplication and edge deletion are the only evolutionary mechanisms, then a graph’s ancestrally distinguished subgraphs must be contained in all of the graph’s ancestors. We analyze two experimentally derived genetic networks and show that our results accurately predict lack of large ancestrally distinguished subgraphs, despite this feature being statistically improbable in associated random networks. This observation is consistent with the hypothesis that these networks evolved primarily via vertex duplication. The tools we provide open the door for analyzing ancestral networks using current networks. Our results apply to edge-labeled (e.g. signed) graphs which are either undirected or directed.
Copyright (c) 2002-2022, LYRASIS. All rights reserved.