Phylofactorization: a graph partitioning algorithm to identify phylogenetic scales of ecological data

被引:42
|
作者
Washburne, Alex D. [1 ]
Silverman, Justin D. [2 ,3 ]
Morton, James T. [4 ,5 ]
Becker, Daniel J. [1 ]
Crowley, Daniel [1 ]
Mukherjee, Sayan [3 ,6 ]
David, Lawrence A. [3 ]
Plowright, Raina K. [1 ]
机构
[1] Montana State Univ, Dept Microbiol & Immunol, Bozeman, MT 59717 USA
[2] Duke Univ, Program Computat Biol & Bioinformat, Durham, NC 27708 USA
[3] Duke Univ, Ctr Genom & Computat Biol, Durham, NC 27708 USA
[4] Univ Calif San Diego, Dept Comp Sci, La Jolla, CA 92037 USA
[5] Univ Calif San Diego, Dept Pediat, La Jolla, CA 92037 USA
[6] Duke Univ, Dept Stat Sci Math & Comp Sci, Durham, NC 27708 USA
关键词
community ecology; dimensionality reduction; graph partitioning; microbiome; phylofactorization; phylogeny; R PACKAGE; BODY-SIZE; EVOLUTION; MICROBIOME; DYNAMICS;
D O I
10.1002/ecm.1353
中图分类号
Q14 [生态学(生物生态学)];
学科分类号
071012 ; 0713 ;
摘要
The problem of pattern and scale is a central challenge in ecology. In community ecology, an important scale is that at which we aggregate species to define our units of study, such as aggregation of "nitrogen fixing trees" to understand patterns in carbon sequestration. With the emergence of massive community ecological data sets, there is a need to objectively identify the scales for aggregating species to capture well-defined patterns in community ecological data. The phylogeny is a scaffold for identifying scales of species-aggregation associated with macroscopic patterns. Phylofactorization was developed to identify phylogenetic scales underlying patterns in relative abundance data, but many ecological data, such as presence-absences and counts, are not relative abundances yet may still have phylogenetic scales capturing patterns of interest. Here, we broaden phylofactorization to a graph-partitioning algorithm identifying phylogenetic scales in community ecological data. As a graph-partitioning algorithm, phylofactorization connects many tools from data analysis to phylogenetically informed analyses of community ecological data. Two-sample tests identify five phylogenetic factors of mammalian body mass which arose during the K-Pg extinction event, consistent with other analyses of mammalian body mass evolution. Projection of data onto coordinates connecting the phylogeny and graph-partitioning algorithm yield a phylogenetic principal components analysis which refines our understanding of the major sources of variation in the human gut microbiome. These same coordinates allow generalized additive modeling of microbes in Central Park soils, confirming that a large clade of Acidobacteria thrive in neutral soils. The graph-partitioning algorithm extends to generalized linear and additive modeling of exponential family random variables by phylogenetically constrained reduced-rank regression or stepwise factor contrasts. All of these tools can be implemented with the R package phylofactor.
引用
收藏
页数:27
相关论文
共 50 条
  • [41] IOGP: An Incremental Online Graph Partitioning Algorithm for Distributed Graph Databases
    Dai, Dong
    Zhang, Wei
    Chen, Yong
    HPDC'17: PROCEEDINGS OF THE 26TH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE PARALLEL AND DISTRIBUTED COMPUTING, 2017, : 219 - 229
  • [42] AKIN : A Streaming Graph Partitioning Algorithm for Distributed Graph Storage Systems
    Zhang, Wei
    Chen, Yong
    Dai, Dong
    2018 18TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2018, : 183 - 192
  • [43] PARTITIONING OF BODY WATER IN OSTEICHTHYES - PHYLOGENETIC AND ECOLOGICAL IMPLICATIONS IN AQUATIC VERTEBRATES
    THORSON, TB
    BIOLOGICAL BULLETIN, 1961, 120 (02): : 238 - &
  • [44] An Energy Efficient Virtual Machine Placement Algorithm Based on Graph Partitioning in Cloud Data Center
    Yao, Wenbin
    Guo, Zhen
    Wang, Dongbin
    2017 15TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS AND 2017 16TH IEEE INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING AND COMMUNICATIONS (ISPA/IUCC 2017), 2017, : 412 - 416
  • [45] Near-Data Source Graph Partitioning
    Chang, Furong
    Guo, Hao
    Ullah, Farhan
    Wang, Haochen
    Zhao, Yue
    Zhang, Haitian
    ELECTRONICS, 2024, 13 (22)
  • [46] A polynomial algorithm for balanced clustering via graph partitioning
    Evaristo Caraballo, Luis
    Diaz-Banez, Jose-Miguel
    Kroher, Nadine
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (02) : 456 - 469
  • [47] A binary neural network algorithm for the graph partitioning problem
    Tamaki, Y
    Funabiki, N
    Nishikawa, S
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1999, 82 (12): : 34 - 42
  • [48] A simple message passing algorithm for graph partitioning problems
    Onsjo, Mikael
    Tatanabe, Osamu
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 507 - +
  • [49] Task Graph Reduction Algorithm for Hardware/Software Partitioning
    LI Hui1
    2.State Key Laboratory of Computer Science
    Wuhan University Journal of Natural Sciences, 2012, 17 (02) : 126 - 130
  • [50] Graph Partitioning using a Simulated Bee Colony Algorithm
    McCaffrey, James D.
    2011 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION (IRI), 2011, : 400 - 405