The geometry of partial fitness orders and an efficient method for detecting genetic interactions

被引:4
|
作者
Lienkaemper, Caitlin [1 ]
Lamberti, Lisa [2 ,3 ]
Drain, James [4 ]
Beerenwinkel, Niko [2 ,3 ]
Gavryushkin, Alex [5 ]
机构
[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA
[2] Swiss Fed Inst Technol, Dept Biosyst Sci & Engn, Basel, Switzerland
[3] SIB, Basel, Switzerland
[4] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90024 USA
[5] Univ Otago, Dept Comp Sci, Dunedin, New Zealand
关键词
PHYLOGENETIC TREES; EPISTASIS; SPACE;
D O I
10.1007/s00285-018-1237-7
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
We present an efficient computational approach for detecting genetic interactions from fitness comparison data together with a geometric interpretation using polyhedral cones associated to partial orderings. Genetic interactions are defined by linear forms with integer coefficients in the fitness variables assigned to genotypes. These forms generalize several popular approaches to study interactions, including Fourier-Walsh coefficients, interaction coordinates, and circuits. We assume that fitness measurements come with high uncertainty or are even unavailable, as is the case for many empirical studies, and derive interactions only from comparisons of genotypes with respect to their fitness, i.e. from partial fitness orders. We present a characterization of the class of partial fitness orders that imply interactions, using a graph-theoretic approach. Our characterization then yields an efficient algorithm for testing the condition when certain genetic interactions, such as sign epistasis, are implied. This provides an exponential improvement of the best previously known method. We also present a geometric interpretation of our characterization, which provides the basis for statistical analysis of partial fitness orders and genetic interactions.
引用
收藏
页码:951 / 970
页数:20
相关论文
共 50 条
  • [1] The geometry of partial fitness orders and an efficient method for detecting genetic interactions
    Caitlin Lienkaemper
    Lisa Lamberti
    James Drain
    Niko Beerenwinkel
    Alex Gavryushkin
    Journal of Mathematical Biology, 2018, 77 : 951 - 970
  • [2] Efficient computational geometry method for detecting dotted lines in noisy images
    Dehne, F.
    Ficocelli, L.
    Computer Journal, 1990, 33 (05): : 424 - 428
  • [3] AN EFFICIENT COMPUTATIONAL GEOMETRY METHOD FOR DETECTING DOTTED LINES IN NOISY IMAGES
    DEHNE, F
    FICOCELLI, L
    COMPUTER JOURNAL, 1990, 33 (05): : 424 - 428
  • [4] MODAL-THEORY, PARTIAL ORDERS, AND DIGITAL GEOMETRY
    SMITH, JDH
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 239 : 308 - 323
  • [5] Optimal partial discretization orders for discretizable distance geometry
    Goncalves, Douglas S.
    Mucherino, Antonio
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (05) : 947 - 967
  • [6] Using partial-orders for detecting faults in concurrent systems
    Petrenko, A
    Ulrich, A
    Chapenko, V
    TESTING OF COMMUNICATING SYSTEMS, 1998, : 175 - 190
  • [7] Detecting Concurrency Vulnerabilities Based on Partial Orders of Memory and Thread Events
    Yu, Kunpeng
    Wang, Chenxu
    Cai, Yan
    Luo, Xiapu
    Yang, Zijiang
    PROCEEDINGS OF THE 29TH ACM JOINT MEETING ON EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING (ESEC/FSE '21), 2021, : 280 - 291
  • [8] Discretization orders and efficient computation of cartesian coordinates for distance geometry
    Douglas S. Gonçalves
    Antonio Mucherino
    Optimization Letters, 2014, 8 : 2111 - 2125
  • [9] Discretization orders and efficient computation of cartesian coordinates for distance geometry
    Goncalves, Douglas S.
    Mucherino, Antonio
    OPTIMIZATION LETTERS, 2014, 8 (07) : 2111 - 2125
  • [10] A METHOD FOR DETECTING SERVICE INTERACTIONS
    WAKAHARA, Y
    FUJIOKA, M
    KIKUTA, H
    YAGI, H
    SAKAI, S
    IEEE COMMUNICATIONS MAGAZINE, 1993, 31 (08) : 32 - 37