Identifying Microbial Interaction Networks Based on Irregularly Spaced Longitudinal 16S rRNA sequence data

Jie Zhou, Jiang Gui, Weston D. Viles, Haobin Chen, Juliette C. Madan, Modupe O. Coker, Anne G. HoenbioRxiv 2021 · DOI

TL;DR

This paper introduces a novel statistical framework for inferring microbial interaction networks from longitudinal microbiome data, even when samples are collected at irregular intervals. Their method, a stationary Gaussian graphical model (SGGM), effectively accounts for temporal correlations within subjects, outperforming existing methods when these correlations are strong.

What Problem Does This Paper Address?

Understanding the complex web of interactions between microbes in a community (like the human gut) is crucial for deciphering their roles in health and disease. Traditional methods for studying these interactions often rely on static snapshots of microbial communities or methods that struggle with the high dimensionality and temporal dynamics of microbiome data. Specifically, existing methods for inferring microbial interaction networks (MINs) often assume data independence or require equally spaced longitudinal samples, which are rarely met in real-world studies of human microbiomes. This leaves a gap in our ability to model the dynamic, interconnected nature of these microbial ecosystems over time.

Methods

The core contribution of this paper is the development of a Stationary Gaussian Graphical Model (SGGM) tailored for irregularly spaced longitudinal microbiome data. Here's a breakdown of their approach:

  • Modeling Temporal Correlations: The SGGM explicitly models the correlation between microbial community snapshots from the same individual over time. This is achieved by assuming a specific structure for the covariance matrix that accounts for the time elapsed between samples.
  • L1-Penalized Maximum Likelihood Estimation: To infer sparse interaction networks (meaning most microbes don't directly interact), they employ L1-penalized maximum likelihood estimation. This technique encourages many interaction coefficients to be exactly zero.
  • EM-Type Algorithm: For the more complex "heterogeneous" SGGM (where each individual can have their own temporal correlation pattern), they devise an Expectation-Maximization (EM) algorithm. This algorithm iteratively estimates the network structure and individual-specific correlation parameters.
  • Leveraging Graphical LASSO: A key aspect of their algorithm is its reliance on the well-established Graphical LASSO algorithm as a building block. This allows them to efficiently compute the penalized maximum likelihood estimates for the precision matrix (which represents the network structure).
  • Module-Preserving Permutation Test: To investigate the relationship between the inferred microbial interaction network and the evolutionary relatedness of microbes, they propose a novel module-preserving permutation test. This test assesses whether genetically related microbes tend to interact more strongly.

Datasets

The authors utilize a real-world dataset for their application:

  • Cystic Fibrosis Cohort Data: A longitudinal gut microbiome dataset from children with cystic fibrosis, collected over a period of 6 to 51 months. This dataset consists of 16S rRNA gene sequencing data, which was processed to yield abundance data for 83 taxa. This dataset is used to demonstrate the practical application of their proposed methods and to investigate the link between microbial interactions and phylogenetic relatedness.

Key Insights and Ideas

  • Temporal Correlations Matter: The paper strongly suggests that ignoring temporal correlations in longitudinal microbiome data can lead to inaccurate network inference, especially when these correlations are significant.
  • Phylogenetic Relatedness and Interaction: A significant finding is the strong evidence for an association between the microbial interaction network and the phylogenetic tree. This supports the hypothesis that evolutionarily closer microbes tend to have more or stronger interactions.
  • Algorithm Efficiency: By building upon the Graphical LASSO, their proposed algorithms are efficient and implementable, making them practical for analyzing complex microbiome datasets.
  • Heterogeneity is Key: The heterogeneous SGGM, which allows for individual-specific temporal correlation patterns, shows promise in capturing more nuanced biological relationships.

Key Results

  • Simulation Performance: In simulations, their proposed longitudinal graphical LASSO algorithms significantly outperformed conventional methods (Graphical LASSO and neighborhood method) when correlations between measurements within the same subject were large.
  • Real Data Application: When applied to the cystic fibrosis cohort data, their method successfully inferred a microbial interaction network.
  • Phylogenetic Association: The module-preserving permutation test revealed a statistically significant positive correlation between the inferred microbial interaction network and the phylogenetic tree, with a bootstrapped 95% confidence interval for the correlation of [0.213, 0.275]. This indicates that genetically related taxa tend to have more/stronger interactions.
  • Software Availability: The algorithms are implemented in an R package called lglasso, available on CRAN.

Limitations and Future Work

  • Homogeneous Dampening Rate Assumption: The paper acknowledges that while their current model assumes microbes within a subject share the same time dampening rate, in reality, different taxa might have different rates.
  • Future Work: The authors suggest that expanding their algorithms to accommodate varying time dampening rates for different taxa would be a valuable direction for future research. This would allow for even more refined modeling of complex temporal dynamics in microbial communities.

Summary updated

Abstract

Abstract The microbial interactions within the human microbiome are complex and temporally dynamic, but few methods are available to model this system within a longitudinal network framework. Based on general longitudinal 16S rRNA sequence data, we propose a stationary Gaussian graphical model (SGGM) for microbial interaction networks (MIN) which can accommodate the possible correlations between the high-dimensional observations. For SGGM, an EM-type algorithm is devised to compute the L 1 -penalized maximum likelihood estimate of MIN which employs the classic graphical LASSO algorithm as the building block and can therefore be implemented easily. Simulation studies show that the proposed algorithms can significantly outperform the conventional algorithms when the correlations between measurements grow large. The algorithms are then applied to a real 16S rRNA gene sequence data set for gut microbiome. With the estimated MIN in hand, module-preserving permutation test is proposed to test the independence of the MIN and the corresponding phylogenetic tree. The results demonstrate strong evidence of an association between the MIN and the phylogenetic tree which indicates that the genetically related taxa tend to have more/stronger interactions. The proposed algorithms are implemented in R package lglasso at https://CRAN.R-project.org/package=lglasso .
BibTeX
@misc{zhou2021identifying,
  author = {Jie Zhou and Jiang Gui and Weston D. Viles and Haobin Chen and Juliette C. Madan and Modupe O. Coker and Anne G. Hoen},
  title = {{Identifying Microbial Interaction Networks Based on Irregularly Spaced Longitudinal 16S rRNA sequence data}},
  year = {2021},
  doi = {10.1101/2021.11.26.470159},
  howpublished = {bioRxiv},
}
Figure