Biological networks: Comparison, conservation, and evolutionary trees (Extended abstract)

被引:0
|
作者
Chor, Benny [1 ]
Tuller, Tamir [1 ]
机构
[1] Tel Aviv Univ, Sch Comp Sci, IL-69978 Tel Aviv, Israel
关键词
biological networks; tree reconstruction; relative description length; compression; metabolic networks; Conserved regions; networks' comparison; network evolution;
D O I
暂无
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
We describe a new approach for comparing cellular-biological networks, and finding conserved regions in two or more such networks. We use the length of describing one network, given the description of the other one, as a distance measure. We employ these distances as inputs for generating phylogenetic trees. Our algorithms are fast enough for generating phylogenetic tree of more than two hundreds metabolic networks that appear in KEGG. Using KEGG's metabolic networks as our starting point, we got trees that are not perfect, but are surprisingly good. We also found conserved regions among more than a dozen metabolic networks, and among two protein interaction networks. These conserved regions seem biologically relevant, proving the viability of our approach.
引用
收藏
页码:30 / 44
页数:15
相关论文
共 50 条
  • [21] The dimensions of evolutionary potential in biological conservation
    Milot, Emmanuel
    Bechet, Arnaud
    Maris, Virginie
    EVOLUTIONARY APPLICATIONS, 2020, 13 (06): : 1363 - 1379
  • [22] From abstract networks to biological realities
    Luppi, Andrea I.
    Liu, Zhen-Qi
    Milisav, Filip
    Bazinet, Vincent
    Hansen, Justine
    Misic, Bratislav
    PHYSICS OF LIFE REVIEWS, 2024, 49 : 12 - 14
  • [23] From abstract networks to biological realities
    Luppi, Andrea I.
    Liu, Zhen-Qi
    Milisav, Filip
    Bazinet, Vincent
    Hansen, Justine
    Misic, Bratislav
    Physics of Life Reviews, 2024, 49 : 12 - 14
  • [24] PRIORITY SEARCH-TREES IN SECONDARY MEMORY - (EXTENDED ABSTRACT)
    ICKING, C
    KLEIN, R
    OTTMANN, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 84 - 93
  • [25] The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)
    Golin, Mordecai J.
    Yong, Xuerong
    Zhang, Yuanping
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 242 - +
  • [26] How to Use Spanning Trees to Navigate in Graphs (Extended Abstract)
    Dragan, Feodor F.
    Xiang, Yang
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 282 - 294
  • [27] The k-median problem for directed trees -: Extended abstract
    Chrobak, M
    Larmore, LL
    Rytter, W
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 260 - 271
  • [28] Biological networks: Comparison, conservation, and evolution via relative description length
    Chor, Benny
    Tuller, Tamir
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2007, 14 (06) : 817 - 838
  • [29] Selfish service installation in networks (Extended abstract)
    Cardinal, Jean
    Hoefer, Martin
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2006, 4286 : 174 - +
  • [30] Network Design for Information Networks (Extended Abstract)
    Hayrapetyan, Ara
    Swamy, Chaitanya
    Tardos, Eva
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 933 - 942