28 June 2019 in Genome Biology
Phylogenetically informed distances are commonly used in the analysis of microbiome data, and analysts have many options to choose from. Although all phylogenetic distances share the goal of incorporating the phylogenetic relationships among the bacteria, they do so in different ways and give different pictures of the relationships between the bacterial communities. We investigate the properties of two classes of phylogenetically informed distances: the Unifrac family, including weighted, unweighted, and generalized Unifrac, and the DPCoA family, which we introduce here. Through several lines of evidence, including a combination of mathematical, data analytic, and computational methods, we show that a major and heretofore unrecognized cleavage in the phylogenetically informed distances is the relative weights placed on the deep and shallow parts of the phylogeny. Specifically, weighted Unifrac and DPCoA place more emphasis on the deep parts of the phylogeny, while unweighted Unifrac places more emphasis on the shallow parts of the phylogeny. Both the Unifrac and the DPCoA families have tunable parameters that can be shown to control how much emphasis the distances place on the deep or shallow parts of the phylogeny. Our results allow for a more informed choice of distance and give practitioners more insight into the potential differences resulting from different choices of distance.
2 June 2022 in Biostatistics
Topic modeling is a popular method used to describe biological count data. With topic models, the user must specify the number of topics |$K$|. Since there is no definitive way to choose |$K$| and since a true value might not exist, we develop a method, which we call topic alignment, to study the relationships across models with different |$K$|. In addition, we present three diagnostics based on the alignment. These techniques can show how many topics are consistently present across different models, if a topic is only transiently present, or if a topic splits into more topics when |$K$| increases. This strategy gives more insight into the process of generating the data than choosing a single value of |$K$| would. We design a visual representation of these cross-model relationships, show the effectiveness of these tools for interpreting the topics on simulated and real data, and release an accompanying R package, alto
6 January 2023 in PLOS Computational Biology
k-mer-based distances are often used to describe the differences between communities in metagenome sequencing studies because of their computational convenience and history of effectiveness. Althoughk-mer-based distances do not use information about taxon abundances, we show that one class ofk-mer distances between metagenomes (the Euclidean distance betweenk-mer spectra, or EKS distances) are very closely related to a class of phylogenetically-informedβ-diversity measures that do explicitly use both the taxon abundances and information about the phylogenetic relationships among the taxa. Furthermore, we show that both of these distances can be interpreted as using certain features of the taxon abundances that are related to the phylogenetic tree. Our results allow practitioners to perform phylogenetically-informed analyses when they only havek-mer data available and provide a theoretical basis for usingk-mer spectra with relatively small values ofk(on the order of 4-5). They are also useful for analysts who wish to know more of the properties of any method based onk-mer spectra and provide insight into one class of phylogenetically-informedβ-diversity measures.
30 July 2025 in Molecular Biology and Evolution
During affinity maturation, antibodies are selected for their ability to fold and to bind a target antigen between rounds of somatic hypermutation. Previous studies have identified patterns of selection in antibodies using B cell repertoire sequencing data. However, these studies are constrained by needing to group many sequences or sites to make aggregate predictions. In this paper, we develop a transformer–encoder selection model of maximum resolution: given a single antibody sequence, it predicts the strength of selection on each amino acid site. Specifically, the model predicts for each site whether evolution will be slower than expected relative to a model of the neutral mutation process (purifying selection) or faster than expected (diversifying selection). We show that the model does an excellent job of modeling the process of natural selection on held out data, and does not need to be enormous or trained on vast amounts of data to perform well. The patterns of purifying vs diversifying natural selection do not neatly partition into the complementarity-determining vs framework regions: for example, there are many sites in framework that experience strong diversifying selection. There is a weak correlation between selection factors and solvent accessibility. When considering evolutionary shifts down a tree of antibody evolution, affinity maturation generally shifts sites towards purifying natural selection, however this effect depends on the region, with the biggest shifts toward purifying selection happening in the third complementarity-determining region. We observe distinct evolution between gene families but a limited relationship between germline diversity and selection strength.
1 March 2025 in The Annals of Applied Statistics
Somatic hypermutation (SHM) is a critical enzyme-mediated process of the adaptive immune response in which antibodies acquire mutations to enhance antigen binding. Despite abundant research elucidating the biochemical basis of SHM, and substantial sequence data available for parameterization, previous computational models of SHM have not been explicitly mechanistic. In this paper we bridge this gap by developing a probabilistic latent variable model encapsulating a sequence of interacting steps, thus formulating the biochemical underpinnings of SHM in a mathematical framework. However, fitting this latent variable model is challenging. To navigate this complexity, we employ an approximate Bayesian computation strategy integrated with neural networks. We are able to estimate almost all of the parameters of the model to good accuracy but find that the parameters involving the boundaries of the nucleotide stripping process are slightly more challenging, given the type of data available.