216 results on '"ROCH, SEBASTIEN"'
Search Results
2. Maximum Likelihood Estimation for Unrooted 3-Leaf Trees: An Analytic Solution for the CFN Model
- Author
-
Hill, Max, Roch, Sebastien, and Rodriguez, Jose Israel
- Published
- 2024
- Full Text
- View/download PDF
3. Expanding the class of global objective functions for dissimilarity-based hierarchical clustering
- Author
-
Roch, Sebastien
- Subjects
Computer Science - Machine Learning ,Mathematics - Probability ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Recent work on dissimilarity-based hierarchical clustering has led to the introduction of global objective functions for this classical problem. Several standard approaches, such as average linkage, as well as some new heuristics have been shown to provide approximation guarantees. Here we introduce a broad new class of objective functions which satisfy desirable properties studied in prior work. Many common agglomerative and divisive clustering methods are shown to be greedy algorithms for these objectives, which are inspired by related concepts in phylogenetics.
- Published
- 2022
4. Pairwise sequence alignment at arbitrarily large evolutionary distance
- Author
-
Legried, Brandon and Roch, Sebastien
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
Ancestral sequence reconstruction is a key task in computational biology. It consists in inferring a molecular sequence at an ancestral species of a known phylogeny, given descendant sequences at the tip of the tree. In addition to its many biological applications, it has played a key role in elucidating the statistical performance of phylogeny estimation methods. Here we establish a formal connection to another important bioinformatics problem, multiple sequence alignment, where one attempts to best align a collection of molecular sequences under some mismatch penalty score by inserting gaps. Our result is counter-intuitive: we show that perfect pairwise sequence alignment with high probability is possible in principle at arbitrary large evolutionary distances - provided the phylogeny is known and dense enough. We use techniques from ancestral sequence reconstruction in the taxon-rich setting together with the probabilistic analysis of sequence evolution models involving insertions and deletions.
- Published
- 2022
5. Expanding the Class of Global Objective Functions for Dissimilarity-Based Hierarchical Clustering
- Author
-
Roch, Sebastien
- Published
- 2023
- Full Text
- View/download PDF
6. Estimating Graph Dimension with Cross-validated Eigenvalues
- Author
-
Chen, Fan, Roch, Sebastien, Rohe, Karl, and Yu, Shuqi
- Subjects
Statistics - Methodology ,Computer Science - Machine Learning ,Computer Science - Social and Information Networks ,Mathematics - Statistics Theory - Abstract
In applied multivariate statistics, estimating the number of latent dimensions or the number of clusters is a fundamental and recurring problem. One common diagnostic is the scree plot, which shows the largest eigenvalues of the data matrix; the user searches for a "gap" or "elbow" in the decreasing eigenvalues; unfortunately, these patterns can hide beneath the bias of the sample eigenvalues. This methodological problem is conceptually difficult because, in many situations, there is only enough signal to detect a subset of the $k$ population dimensions/eigenvectors. In this situation, one could argue that the correct choice of $k$ is the number of detectable dimensions. We alleviate these problems with cross-validated eigenvalues. Under a large class of random graph models, without any parametric assumptions, we provide a p-value for each sample eigenvector. It tests the null hypothesis that this sample eigenvector is orthogonal to (i.e., uncorrelated with) the true latent dimensions. This approach naturally adapts to problems where some dimensions are not statistically detectable. In scenarios where all $k$ dimensions can be estimated, we prove that our procedure consistently estimates $k$. In simulations and a data example, the proposed estimator compares favorably to alternative approaches in both computational and statistical performance., Comment: 53 pages, 12 figures
- Published
- 2021
7. Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model
- Author
-
Tabatabaee, Yasamin, Roch, Sébastien, Warnow, Tandy, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Tang, Haixu, editor
- Published
- 2023
- Full Text
- View/download PDF
8. Impossibility of phylogeny reconstruction from $k$-mer counts
- Author
-
Fan, Wai-Tong Louis, Legried, Brandon, and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
We consider phylogeny estimation under a two-state model of sequence evolution by site substitution on a tree. In the asymptotic regime where the sequence lengths tend to infinity, we show that for any fixed $k$ no statistically consistent phylogeny estimation is possible from $k$-mer counts over the full leaf sequences alone. Formally, we establish that the joint distribution of $k$-mer counts over the entire leaf sequences on two distinct trees have total variation distance bounded away from $1$ as the sequence length tends to infinity. Our impossibility result implies that statistical consistency requires more sophisticated use of $k$-mer count information, such as block techniques developed in previous theoretical work., Comment: 35 pages, 4 figures
- Published
- 2020
9. Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods
- Author
-
Hill, Max, Legried, Brandon, and Roch, Sebastien
- Subjects
Mathematics - Probability ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
We consider species tree estimation under a standard stochastic model of gene tree evolution that incorporates incomplete lineage sorting (as modeled by a coalescent process) and gene duplication and loss (as modeled by a branching process). Through a probabilistic analysis of the model, we derive sample complexity bounds for widely used quartet-based inference methods that highlight the effect of the duplication and loss rates in both subcritical and supercritical regimes., Comment: 35 pages, 1 figure
- Published
- 2020
10. Impossibility of consistent distance estimation from sequence lengths under the TKF91 model
- Author
-
Fan, Wai-Tong Louis, Legried, Brandon, and Roch, Sebastien
- Subjects
Mathematics - Probability ,Quantitative Biology - Populations and Evolution - Abstract
We consider the problem of distance estimation under the TKF91 model of sequence evolution by insertions, deletions and substitutions on a phylogeny. In an asymptotic regime where the expected sequence lengths tend to infinity, we show that no consistent distance estimation is possible from sequence lengths alone. More formally, we establish that the distributions of pairs of sequence lengths at different distances cannot be distinguished with probability going to one., Comment: 11 pages, 1 figure
- Published
- 2020
11. On the variance of internode distance under the multispecies coalescent
- Author
-
Roch, Sebastien
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
We consider the problem of estimating species trees from unrooted gene tree topologies in the presence of incomplete lineage sorting, a common phenomenon that creates gene tree heterogeneity in multilocus datasets. One popular class of reconstruction methods in this setting is based on internode distances, i.e. the average graph distance between pairs of species across gene trees. While statistical consistency in the limit of large numbers of loci has been established in some cases, little is known about the sample complexity of such methods. Here we make progress on this question by deriving a lower bound on the worst-case variance of internode distance which depends linearly on the corresponding graph distance in the species tree. We also discuss some algorithmic implications.
- Published
- 2018
12. Reducing Seed Bias in Respondent-Driven Sampling by Estimating Block Transition Probabilities
- Author
-
Zhang, Yilin, Rohe, Karl, and Roch, Sebastien
- Subjects
Mathematics - Statistics Theory ,Computer Science - Social and Information Networks ,Mathematics - Probability ,Statistics - Methodology - Abstract
Respondent-driven sampling (RDS) is a popular approach to study marginalized or hard-to-reach populations. It collects samples from a networked population by incentivizing participants to refer their friends into the study. One major challenge in analyzing RDS samples is seed bias. Seed bias refers to the fact that when the social network is divided into multiple communities (or blocks), the RDS sample might not provide a balanced representation of the different communities in the population, and such unbalance is correlated with the initial participant (or the seed). In this case, the distributions of estimators are typically non-trivial mixtures, which are determined (1) by the seed and (2) by how the referrals transition from one block to another. This paper shows that (1) block-transition probabilities are easy to estimate with high accuracy, and (2) we can use these estimated block-transition probabilities to estimate the stationary distribution over blocks and thus, an estimate of the block proportions. This stationary distribution on blocks has previously been used in the RDS literature to evaluate whether the sampling process has appeared to `mix'. We use these estimated block proportions in a simple post-stratified (PS) estimator that greatly diminishes seed bias. By aggregating over the blocks/strata in this way, we prove that the PS estimator is $\sqrt{n}$-consistent under a Markov model, even when other estimators are not. Simulations show that the PS estimator has smaller Root Mean Square Error (RMSE) compared to the state-of-the-art estimators., Comment: 38 pages, 9 figures
- Published
- 2018
13. On the Effect of Intralocus Recombination on Triplet-Based Species Tree Estimation
- Author
-
Hill, Max, Roch, Sebastien, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Pe'er, Itsik, editor
- Published
- 2022
- Full Text
- View/download PDF
14. Pairwise sequence alignment at arbitrarily large evolutionary distance
- Author
-
Legried, Brandon, primary and Roch, Sebastien, additional
- Published
- 2024
- Full Text
- View/download PDF
15. Asymptotic Seed Bias in Respondent-driven Sampling
- Author
-
Yan, Yuling, Hanlon, Bret, Roch, Sebastien, and Rohe, Karl
- Subjects
Mathematics - Statistics Theory ,Computer Science - Social and Information Networks ,Mathematics - Probability ,Statistics - Methodology - Abstract
Respondent-driven sampling (RDS) collects a sample of individuals in a networked population by incentivizing the sampled individuals to refer their contacts into the sample. This iterative process is initialized from some seed node(s). Sometimes, this selection creates a large amount of seed bias. Other times, the seed bias is small. This paper gains a deeper understanding of this bias by characterizing its effect on the limiting distribution of various RDS estimators. Using classical tools and results from multi-type branching processes (Kesten and Stigum, 1966), we show that the seed bias is negligible for the Generalized Least Squares (GLS) estimator and non-negligible for both the inverse probability weighted and Volz-Heckathorn (VH) estimators. In particular, we show that (i) above a critical threshold, VH converge to a non-trivial mixture distribution, where the mixture component depends on the seed node, and the mixture distribution is possibly multi-modal. Moreover, (ii) GLS converges to a Gaussian distribution independent of the seed node, under a certain condition on the Markov process. Numerical experiments with both simulated data and empirical social networks suggest that these results appear to hold beyond the Markov conditions of the theorems., Comment: 37 pages, 7 figures; typos corrected, proof outlines added
- Published
- 2018
16. Long-branch attraction in species tree estimation: inconsistency of partitioned likelihood and topology-based summary methods
- Author
-
Roch, Sebastien, Nute, Michael, and Warnow, Tandy
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
With advances in sequencing technologies, there are now massive amounts of genomic data from across all life, leading to the possibility that a robust Tree of Life can be constructed. However, "gene tree heterogeneity", which is when different genomic regions can evolve differently, is a common phenomenon in multi-locus datasets, and reduces the accuracy of standard methods for species tree estimation that do not take this heterogeneity into account. New methods have been developed for species tree estimation that specifically address gene tree heterogeneity, and that have been proven to converge to the true species tree when the number of loci and number of sites per locus both increase (i.e., the methods are said to be "statistically consistent"). Yet, little is known about the biologically realistic condition where the number of sites per locus is bounded. We show that when the sequence length of each locus is bounded (by any arbitrarily chosen value), the most common approaches to species tree estimation that take heterogeneity into account (i.e., traditional fully partitioned concatenated maximum likelihood and newer approaches, called summary methods, that estimate the species tree by combining gene trees) are not statistically consistent, even when the heterogeneity is extremely constrained. The main challenge is the presence of conditions such as long branch attraction that create biased tree estimation when the number of sites is restricted. Hence, our study uncovers a fundamental challenge to species tree estimation using both traditional and new methods., Comment: Submitted
- Published
- 2018
17. Geometry of the sample frequency spectrum and the perils of demographic inference
- Author
-
Rosen, Zvi, Bhaskar, Anand, Roch, Sebastien, and Song, Yun S.
- Subjects
Quantitative Biology - Populations and Evolution ,Mathematics - Algebraic Geometry ,Mathematics - Statistics Theory ,92D10, 14P10, 52A20, 62P10 - Abstract
The sample frequency spectrum (SFS), which describes the distribution of mutant alleles in a sample of DNA sequences, is a widely used summary statistic in population genetics. The expected SFS has a strong dependence on the historical population demography and this property is exploited by popular statistical methods to infer complex demographic histories from DNA sequence data. Most, if not all, of these inference methods exhibit pathological behavior, however. Specifically, they often display runaway behavior in optimization, where the inferred population sizes and epoch durations can degenerate to 0 or diverge to infinity, and show undesirable sensitivity of the inferred demography to perturbations in the data. The goal of this paper is to provide theoretical insights into why such problems arise. To this end, we characterize the geometry of the expected SFS for piecewise-constant demographic histories and use our results to show that the aforementioned pathological behavior of popular inference methods is intrinsic to the geometry of the expected SFS. We provide explicit descriptions and visualizations for a toy model with sample size 4, and generalize our intuition to arbitrary sample sizes n using tools from convex and algebraic geometry. We also develop a universal characterization result which shows that the expected SFS of a sample of size n under an arbitrary population history can be recapitulated by a piecewise-constant demography with only k(n) epochs, where k(n) is between n/2 and 2n-1. The set of expected SFS for piecewise-constant demographies with fewer than k(n) epochs is open and non-convex, which causes the above phenomena for inference from data., Comment: 21 pages, 5 figures
- Published
- 2017
18. Geometry of the Sample Frequency Spectrum and the Perils of Demographic Inference
- Author
-
Rosen, Zvi, Bhaskar, Anand, Roch, Sebastien, and Song, Yun S
- Subjects
Biological Sciences ,Genetics ,Biotechnology ,Gene Frequency ,Humans ,Models ,Genetic ,Population ,population size ,expected sample frequency spectrum ,coalescent theory ,algebraic methods ,Developmental Biology ,Biochemistry and cell biology - Abstract
The sample frequency spectrum (SFS), which describes the distribution of mutant alleles in a sample of DNA sequences, is a widely used summary statistic in population genetics. The expected SFS has a strong dependence on the historical population demography and this property is exploited by popular statistical methods to infer complex demographic histories from DNA sequence data. Most, if not all, of these inference methods exhibit pathological behavior, however. Specifically, they often display runaway behavior in optimization, where the inferred population sizes and epoch durations can degenerate to zero or diverge to infinity, and show undesirable sensitivity to perturbations in the data. The goal of this article is to provide theoretical insights into why such problems arise. To this end, we characterize the geometry of the expected SFS for piecewise-constant demographies and use our results to show that the aforementioned pathological behavior of popular inference methods is intrinsic to the geometry of the expected SFS. We provide explicit descriptions and visualizations for a toy model, and generalize our intuition to arbitrary sample sizes using tools from convex and algebraic geometry. We also develop a universal characterization result which shows that the expected SFS of a sample of size n under an arbitrary population history can be recapitulated by a piecewise-constant demography with only [Formula: see text] epochs, where [Formula: see text] is between [Formula: see text] and [Formula: see text] The set of expected SFS for piecewise-constant demographies with fewer than [Formula: see text] epochs is open and nonconvex, which causes the above phenomena for inference from data.
- Published
- 2018
19. Generalized least squares can overcome the critical threshold in respondent-driven sampling
- Author
-
Roch, Sebastien and Rohe, Karl
- Subjects
Mathematics - Statistics Theory ,Computer Science - Social and Information Networks ,Mathematics - Probability - Abstract
In order to sample marginalized and/or hard-to-reach populations, respondent-driven sampling (RDS) and similar techniques reach their participants via peer referral. Under a Markov model for RDS, previous research has shown that if the typical participant refers too many contacts, then the variance of common estimators does not decay like $O(n^{-1})$, where $n$ is the sample size. This implies that confidence intervals will be far wider than under a typical sampling design. Here we show that generalized least squares (GLS) can effectively reduce the variance of RDS estimates. In particular, a theoretical analysis indicates that the variance of the GLS estimator is $O(n^{-1})$. We then derive two classes of feasible GLS estimators. The first class is based upon a Degree Corrected Stochastic Blockmodel for the underlying social network. The second class is based upon a rank-two model. It might be of independent interest that in both model classes, the theoretical results show that it is possible to estimate the spectral properties of the population network from the sampled observations. Simulations on empirical social networks show that the feasible GLS (fGLS) estimators can have drastically smaller error and rarely increase the error. A diagnostic plot helps to identify where fGLS will aid estimation. The fGLS estimators continue to outperform standard estimators even when they are built from a misspecified model and when there is preferential recruitment., Comment: Submitted
- Published
- 2017
- Full Text
- View/download PDF
20. Sufficient condition for root reconstruction by parsimony on binary trees with general weights
- Author
-
Roch, Sebastien and Wang, Kun-Chieh
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Quantitative Biology - Populations and Evolution - Abstract
We consider the problem of inferring an ancestral state from observations at the leaves of a tree, assuming the state evolves along the tree according to a two-state symmetric Markov process. We establish a general branching rate condition under which maximum parsimony, a common reconstruction method requiring only the knowledge of the tree, succeeds better than random guessing uniformly in the depth of the tree. We thereby generalize previous results of (Zhang et al., 2010) and (Gascuel and Steel, 2010). Our results apply to both deterministic and i.i.d. edge weights.
- Published
- 2017
21. Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling
- Author
-
Fan, Wai-Tong Louis and Roch, Sebastien
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
In evolutionary biology, the speciation history of living organisms is represented graphically by a phylogeny, that is, a rooted tree whose leaves correspond to current species and branchings indicate past speciation events. Phylogenies are commonly estimated from molecular sequences, such as DNA sequences, collected from the species of interest. At a high level, the idea behind this inference is simple: the further apart in the Tree of Life are two species, the greater is the number of mutations to have accumulated in their genomes since their most recent common ancestor. In order to obtain accurate estimates in phylogenetic analyses, it is standard practice to employ statistical approaches based on stochastic models of sequence evolution on a tree. For tractability, such models necessarily make simplifying assumptions about the evolutionary mechanisms involved. In particular, commonly omitted are insertions and deletions of nucleotides -- also known as indels. Properly accounting for indels in statistical phylogenetic analyses remains a major challenge in computational evolutionary biology. Here we consider the problem of reconstructing ancestral sequences on a known phylogeny in a model of sequence evolution incorporating nucleotide substitutions, insertions and deletions, specifically the classical TKF91 process. We focus on the case of dense phylogenies of bounded height, which we refer to as the taxon-rich setting, where statistical consistency is achievable. We give the first polynomial-time ancestral reconstruction algorithm with provable guarantees under constant rates of mutation. Our algorithm succeeds when the phylogeny satisfies the "big bang" condition, a necessary and sufficient condition for statistical consistency in this context., Comment: Title modified, 31 pages, 2 Figures and 1 table
- Published
- 2017
22. Circular Networks from Distorted Metrics
- Author
-
Roch, Sebastien and Wang, Kun-Chieh
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Discrete Mathematics ,Mathematics - Probability - Abstract
Trees have long been used as a graphical representation of species relationships. However complex evolutionary events, such as genetic reassortments or hybrid speciations which occur commonly in viruses, bacteria and plants, do not fit into this elementary framework. Alternatively, various network representations have been developed. Circular networks are a natural generalization of leaf-labeled trees interpreted as split systems, that is, collections of bipartitions over leaf labels corresponding to current species. Although such networks do not explicitly model specific evolutionary events of interest, their straightforward visualization and fast reconstruction have made them a popular exploratory tool to detect network-like evolution in genetic datasets. Standard reconstruction methods for circular networks, such as Neighbor-Net, rely on an associated metric on the species set. Such a metric is first estimated from DNA sequences, which leads to a key difficulty: distantly related sequences produce statistically unreliable estimates. This is problematic for Neighbor-Net as it is based on the popular tree reconstruction method Neighbor-Joining, whose sensitivity to distance estimation errors is well established theoretically. In the tree case, more robust reconstruction methods have been developed using the notion of a distorted metric, which captures the dependence of the error in the distance through a radius of accuracy. Here we design the first circular network reconstruction method based on distorted metrics. Our method is computationally efficient. Moreover, the analysis of its radius of accuracy highlights the important role played by the maximum incompatibility, a measure of the extent to which the network differs from a tree., Comment: Submitted
- Published
- 2017
23. Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
- Author
-
Fan, Wai-Tong Louis and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Information Theory ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution ,60J25, 60J80, 62B10, 62M05 - Abstract
We establish necessary and sufficient conditions for consistent root reconstruction in continuous-time Markov models with countable state space on bounded-height trees. Here a root state estimator is said to be consistent if the probability that it returns to the true root state converges to 1 as the number of leaves tends to infinity. We also derive quantitative bounds on the error of reconstruction. Our results answer a question of Gascuel and Steel and have implications for ancestral sequence reconstruction in a classical evolutionary model of nucleotide insertion and deletion., Comment: 30 pages, 3 figures, title of reference [FR] is updated
- Published
- 2017
24. Coalescent-based species tree estimation: a stochastic Farris transform
- Author
-
Dasarathy, Gautam, Mossel, Elchanan, Nowak, Robert, and Roch, Sebastien
- Subjects
Computer Science - Learning ,Mathematics - Probability ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
The reconstruction of a species phylogeny from genomic data faces two significant hurdles: 1) the trees describing the evolution of each individual gene--i.e., the gene trees--may differ from the species phylogeny and 2) the molecular sequences corresponding to each gene often provide limited information about the gene trees themselves. In this paper we consider an approach to species tree reconstruction that addresses both these hurdles. Specifically, we propose an algorithm for phylogeny reconstruction under the multispecies coalescent model with a standard model of site substitution. The multispecies coalescent is commonly used to model gene tree discordance due to incomplete lineage sorting, a well-studied population-genetic effect. In previous work, an information-theoretic trade-off was derived in this context between the number of loci, $m$, needed for an accurate reconstruction and the length of the locus sequences, $k$. It was shown that to reconstruct an internal branch of length $f$, one needs $m$ to be of the order of $1/[f^{2} \sqrt{k}]$. That previous result was obtained under the molecular clock assumption, i.e., under the assumption that mutation rates (as well as population sizes) are constant across the species phylogeny. Here we generalize this result beyond the restrictive molecular clock assumption, and obtain a new reconstruction algorithm that has the same data requirement (up to log factors). Our main contribution is a novel reduction to the molecular clock case under the multispecies coalescent. As a corollary, we also obtain a new identifiability result of independent interest: for any species tree with $n \geq 3$ species, the rooted species tree can be identified from the distribution of its unrooted weighted gene trees even in the absence of a molecular clock., Comment: Submitted. 49 pages
- Published
- 2017
25. Species tree estimation using ASTRAL: how many genes are enough?
- Author
-
Shekhar, Shubhanshu, Roch, Sebastien, and Mirarab, Siavash
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
Species tree reconstruction from genomic data is increasingly performed using methods that account for sources of gene tree discordance such as incomplete lineage sorting. One popular method for reconstructing species trees from unrooted gene tree topologies is ASTRAL. In this paper, we derive theoretical sample complexity results for the number of genes required by ASTRAL to guarantee reconstruction of the correct species tree with high probability. We also validate those theoretical bounds in a simulation study. Our results indicate that ASTRAL requires $\mathcal{O}(f^{-2} \log n)$ gene trees to reconstruct the species tree correctly with high probability where n is the number of species and f is the length of the shortest branch in the species tree. Our simulations, which are the first to test ASTRAL explicitly under the anomaly zone, show trends consistent with the theoretical bounds and also provide some practical insights on the conditions where ASTRAL works well., Comment: 22 pages, 2 figures, Accepted for oral presentation at RECOMB 2017; Under review at IEEE TCBB
- Published
- 2017
- Full Text
- View/download PDF
26. Maximum Likelihood Estimation for Unrooted 3-Leaf Trees: An Analytic Solution for the CFN Model
- Author
-
Hill, Max, primary, Roch, Sebastien, additional, and Rodriguez, Jose Israel, additional
- Published
- 2024
- Full Text
- View/download PDF
27. Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss
- Author
-
Legried, Brandon, Molloy, Erin K., Warnow, Tandy, Roch, Sébastien, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Schwartz, Russell, editor
- Published
- 2020
- Full Text
- View/download PDF
28. A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements
- Author
-
Dasarathy, Gautam, Mossel, Elchanan, Nowak, Robert, and Roch, Sebastien
- Published
- 2022
- Full Text
- View/download PDF
29. Species Trees are Recoverable from Unrooted Gene Tree Topologies Under a Constant Rate of Horizontal Gene Transfer
- Author
-
Daskalakis, Constantinos and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Quantitative Biology - Populations and Evolution - Abstract
Reconstructing the tree of life from molecular sequences is a fundamental problem in computational biology. Modern data sets often contain a large number of genes, which can complicate the reconstruction problem due to the fact that different genes may undergo different evolutionary histories. This is the case in particular in the presence of horizontal genetic transfer (HGT), where a gene is inherited from a distant species rather than an immediate ancestor. Such an event produces a gene tree which is distinct from, but related to, the species phylogeny. In previous work, a natural stochastic models of HGT was introduced and studied. It was shown, both in simulation and theoretical studies, that a species phylogeny can be reconstructed from gene trees despite surprisingly high rates of HGT under this model. Rigorous lower and upper bounds on this achievable rate were also obtained, but a large gap remained. Here we close this gap, up to a constant. Specifically we show that a species phylogeny can be reconstructed correctly from gene trees even when, on each gene, each edge of the species tree has a constant probability of being the location of an HGT event. Our new reconstruction algorithm, which relies only on unrooted gene tree topologies, builds the tree recursively from the leaves and runs in polynomial time. We also provide a matching bound in the negative direction (up to a constant) and extend our results to some cases where gene trees are not perfectly known., Comment: Submitted. Conference version published as: Daskalakis, Constantinos, and Sebastien Roch. "Species trees from gene trees despite a high rate of lateral genetic transfer: A tight bound." Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2016
- Published
- 2015
30. Phase transition in the sample complexity of likelihood-based phylogeny inference
- Author
-
Roch, Sebastien and Sly, Allan
- Subjects
Mathematics - Probability ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Reconstructing evolutionary trees from molecular sequence data is a fundamental problem in computational biology. Stochastic models of sequence evolution are closely related to spin systems that have been extensively studied in statistical physics and that connection has led to important insights on the theoretical properties of phylogenetic reconstruction algorithms as well as the development of new inference methods. Here, we study maximum likelihood, a classical statistical technique which is perhaps the most widely used in phylogenetic practice because of its superior empirical accuracy. At the theoretical level, except for its consistency, that is, the guarantee of eventual correct reconstruction as the size of the input data grows, much remains to be understood about the statistical properties of maximum likelihood in this context. In particular, the best bounds on the sample complexity or sequence-length requirement of maximum likelihood, that is, the amount of data required for correct reconstruction, are exponential in the number, $n$, of tips---far from known lower bounds based on information-theoretic arguments. Here we close the gap by proving a new upper bound on the sequence-length requirement of maximum likelihood that matches up to constants the known lower bound for some standard models of evolution. More specifically, for the $r$-state symmetric model of sequence evolution on a binary phylogeny with bounded edge lengths, we show that the sequence-length requirement behaves logarithmically in $n$ when the expected amount of mutation per edge is below what is known as the Kesten-Stigum threshold. In general, the sequence-length requirement is polynomial in $n$. Our results imply moreover that the maximum likelihood estimator can be computed efficiently on randomly generated data provided sequences are as above., Comment: To appear in Probability Theory and Related Fields
- Published
- 2015
31. Distance-based species tree estimation: information-theoretic trade-off between number of loci and sequence length under the coalescent
- Author
-
Mossel, Elchanan and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Learning ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
We consider the reconstruction of a phylogeny from multiple genes under the multispecies coalescent. We establish a connection with the sparse signal detection problem, where one seeks to distinguish between a distribution and a mixture of the distribution and a sparse signal. Using this connection, we derive an information-theoretic trade-off between the number of genes, $m$, needed for an accurate reconstruction and the sequence length, $k$, of the genes. Specifically, we show that to detect a branch of length $f$, one needs $m = \Theta(1/[f^{2} \sqrt{k}])$., Comment: To appear in The Annals of Applied Probability
- Published
- 2015
32. Hands-on Introduction to Sequence-Length Requirements in Phylogenetics
- Author
-
Roch, Sébastien, Crippen, Gordon, Advisory Editor, Dress, Andreas, Editor-in-Chief, Giegerich, Robert, Editorial Board Member, Kelso, Janet, Editorial Board Member, Linial, Michal, Editor-in-Chief, Felsenstein, Joe, Advisory Editor, Troyanskaya, Olga, Editor-in-Chief, Gusfield, Dan, Advisory Editor, Myers, Gene, Editorial Board Member, Istrail, Sorin, Advisory Editor, Pevzner, Pavel, Editorial Board Member, Vingron, Martin, Editor-in-Chief, Lengauer, Thomas, Advisory Editor, McClure, Marcella, Advisory Editor, Nowak, Martin, Advisory Editor, Sankoff, David, Advisory Editor, Shamir, Ron, Advisory Editor, Steel, Mike, Advisory Editor, Stormo, Gary, Advisory Editor, Tavaré, Simon, Advisory Editor, Warnow, Tandy, Advisory Editor, and Welch, Lonnie, Advisory Editor
- Published
- 2019
- Full Text
- View/download PDF
33. Likelihood-based tree reconstruction on a concatenation of alignments can be positively misleading
- Author
-
Roch, Sebastien and Steel, Mike
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
The reconstruction of a species tree from genomic data faces a double hurdle. First, the (gene) tree describing the evolution of each gene may differ from the species tree, for instance, due to incomplete lineage sorting. Second, the aligned genetic sequences at the leaves of each gene tree provide merely an imperfect estimate of the topology of the gene tree. In this note, we demonstrate formally that a basic statistical problem arises if one tries to avoid accounting for these two processes and analyses the genetic data directly via a concatenation approach. More precisely, we show that, under the multi-species coalescent with a standard site substitution model, maximum likelihood estimation on sequence data that has been concatenated across genes and performed under the incorrect assumption that all sites have evolved independently and identically on a fixed tree is a statistically inconsistent estimator of the species tree. Our results provide a formal justification of simulation results described of Kubatko and Degnan (2007) and others, and complements recent theoretical results by DeGorgio and Degnan (2010) and Chifman and Kubtako (2014)., Comment: 16 pages, 2 figures
- Published
- 2014
- Full Text
- View/download PDF
34. Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree
- Author
-
Ané, Cécile, Ho, Lam Si Tung, and Roch, Sebastien
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
Diffusion processes on trees are commonly used in evolutionary biology to model the joint distribution of continuous traits, such as body mass, across species. Estimating the parameters of such processes from tip values presents challenges because of the intrinsic correlation between the observations produced by the shared evolutionary history, thus violating the standard independence assumption of large-sample theory. For instance Ho and An\'e \cite{HoAne13} recently proved that the mean (also known in this context as selection optimum) of an Ornstein-Uhlenbeck process on a tree cannot be estimated consistently from an increasing number of tip observations if the tree height is bounded. Here, using a fruitful connection to the so-called reconstruction problem in probability theory, we study the convergence rate of parameter estimation in the unbounded height case. For the mean of the process, we provide a necessary and sufficient condition for the consistency of the maximum likelihood estimator (MLE) and establish a phase transition on its convergence rate in terms of the growth of the tree. In particular we show that a loss of $\sqrt{n}$-consistency (i.e., the variance of the MLE becomes $\Omega(n^{-1})$, where $n$ is the number of tips) occurs when the tree growth is larger than a threshold related to the phase transition of the reconstruction problem. For the covariance parameters, we give a novel, efficient estimation method which achieves $\sqrt{n}$-consistency under natural assumptions on the tree.
- Published
- 2014
35. Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method
- Author
-
Dasarathy, Gautam, Nowak, Robert, and Roch, Sebastien
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Probability ,Mathematics - Statistics Theory ,Statistics - Machine Learning - Abstract
We consider the problem of estimating the evolutionary history of a set of species (phylogeny or species tree) from several genes. It is known that the evolutionary history of individual genes (gene trees) might be topologically distinct from each other and from the underlying species tree, possibly confounding phylogenetic analysis. A further complication in practice is that one has to estimate gene trees from molecular sequences of finite length. We provide the first full data-requirement analysis of a species tree reconstruction method that takes into account estimation errors at the gene level. Under that criterion, we also devise a novel reconstruction algorithm that provably improves over all previous methods in a regime of interest., Comment: 19 pages, 2 figures. Preliminary version to appear in IEEE ISIT 2014. Added acknowledgements and made the proof of the "equality" part of Theorem 3 explicit in Appendix C
- Published
- 2014
- Full Text
- View/download PDF
36. Long-Branch Attraction in Species Tree Estimation : Inconsistency of Partitioned Likelihood and Topology-Based Summary Methods
- Author
-
Roch, Sebastien, Nute, Michael, and Warnow, Tandy
- Published
- 2019
37. Generalized least squares can overcome the critical threshold in respondent-driven sampling
- Author
-
Roch, Sebastien and Rohe, Karl
- Published
- 2018
38. Circular Networks from Distorted Metrics
- Author
-
Roch, Sebastien, Wang, Kun-Chieh, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, and Raphael, Benjamin J., editor
- Published
- 2018
- Full Text
- View/download PDF
39. An analytical comparison of coalescent-based multilocus methods: The three-taxon case
- Author
-
Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Incomplete lineage sorting (ILS) is a common source of gene tree incongruence in multilocus analyses. A large number of methods have been developed to infer species trees in the presence of ILS. Here we provide a mathematical analysis of several coalescent-based methods. Our analysis is performed on a three-taxon species tree and assumes that the gene trees are correctly reconstructed along with their branch lengths.
- Published
- 2012
40. Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis
- Author
-
Roch, Sebastien and Snir, Sagi
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Lateral gene transfer (LGT) is a common mechanism of non-vertical evolution where genetic material is transferred between two more or less distantly related organisms. It is particularly common in bacteria where it contributes to adaptive evolution with important medical implications. In evolutionary studies, LGT has been shown to create widespread discordance between gene trees as genomes become mosaics of gene histories. In particular, the Tree of Life has been questioned as an appropriate representation of bacterial evolutionary history. Nevertheless a common hypothesis is that prokaryotic evolution is primarily tree-like, but that the underlying trend is obscured by LGT. Extensive empirical work has sought to extract a common tree-like signal from conflicting gene trees. Here we give a probabilistic perspective on the problem of recovering the tree-like trend despite LGT. Under a model of randomly distributed LGT, we show that the species phylogeny can be reconstructed even in the presence of surprisingly many (almost linear number of) LGT events per gene tree. Our results, which are optimal up to logarithmic factors, are based on the analysis of a robust, computationally efficient reconstruction method and provides insight into the design of such methods. Finally we show that our results have implications for the discovery of highways of gene sharing.
- Published
- 2012
41. Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
- Author
-
Daskalakis, Constantinos and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequence-length requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alignment., Comment: Published in at http://dx.doi.org/10.1214/12-AAP852 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
- Published
- 2011
- Full Text
- View/download PDF
42. Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters
- Author
-
Mossel, Elchanan, Roch, Sebastien, and Sly, Allan
- Subjects
Mathematics - Probability ,Computer Science - Learning ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Latent tree graphical models are widely used in computational biology, signal and image processing, and network tomography. Here we design a new efficient, estimation procedure for latent tree models, including Gaussian and discrete, reversible models, that significantly improves on previous sample requirement bounds. Our techniques are based on a new hidden state estimator which is robust to inaccuracies in estimated parameters. More precisely, we prove that latent tree models can be estimated with high probability in the so-called Kesten-Stigum regime with $O(log^2 n)$ samples where $n$ is the number of nodes.
- Published
- 2011
43. Phase Transition in Distance-Based Phylogeny Reconstruction
- Author
-
Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
We introduce a new distance-based phylogeny reconstruction technique which provably achieves, at sufficiently short branch lengths, a logarithmic sequence-length requirement---improving significantly over previous polynomial bounds for distance-based methods and matching existing results for general methods. The technique is based on an averaging procedure that implicitly reconstructs ancestral sequences. In the same token, we extend previous results on phase transitions in phylogeny reconstruction to general time-reversible models. More precisely, we show that in the so-called Kesten-Stigum zone (roughly, a region of the parameter space where ancestral sequences are well approximated by "linear combinations" of the observed sequences) sequences of length $O(\log n)$ suffice for reconstruction when branch lengths are discretized. Here $n$ is the number of extant species. Our results challenge, to some extent, the conventional wisdom that estimates of evolutionary distances alone carry significantly less information about phylogenies than full sequence datasets.
- Published
- 2011
44. Phylogenetic mixtures: Concentration of measure in the large-tree limit
- Author
-
Mossel, Elchanan and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
The reconstruction of phylogenies from DNA or protein sequences is a major task of computational evolutionary biology. Common phenomena, notably variations in mutation rates across genomes and incongruences between gene lineage histories, often make it necessary to model molecular data as originating from a mixture of phylogenies. Such mixed models play an increasingly important role in practice. Using concentration of measure techniques, we show that mixtures of large trees are typically identifiable. We also derive sequence-length requirements for high-probability reconstruction., Comment: Published in at http://dx.doi.org/10.1214/11-AAP837 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
- Published
- 2011
- Full Text
- View/download PDF
45. Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies
- Author
-
Mossel, Elchanan and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Mutation rate variation across loci is well known to cause difficulties, notably identifiability issues, in the reconstruction of evolutionary trees from molecular sequences. Here we introduce a new approach for estimating general rates-across-sites models. Our results imply, in particular, that large phylogenies are typically identifiable under rate variation. We also derive sequence-length requirements for high-probability reconstruction. Our main contribution is a novel algorithm that clusters sites according to their mutation rate. Following this site clustering step, standard reconstruction techniques can be used to recover the phylogeny. Our results rely on a basic insight: that, for large trees, certain site statistics experience concentration-of-measure phenomena.
- Published
- 2011
46. On the inference of large phylogenies with long branches: How long is too long?
- Author
-
Mossel, Elchanan, Roch, Sebastien, and Sly, Allan
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Recent work has highlighted deep connections between sequence-length requirements for high-probability phylogeny reconstruction and the related problem of the estimation of ancestral sequences. In [Daskalakis et al.'09], building on the work of [Mossel'04], a tight sequence-length requirement was obtained for the CFN model. In particular the required sequence length for high-probability reconstruction was shown to undergo a sharp transition (from $O(\log n)$ to $\hbox{poly}(n)$, where $n$ is the number of leaves) at the "critical" branch length $\critmlq$ (if it exists) of the ancestral reconstruction problem. Here we consider the GTR model. For this model, recent results of [Roch'09] show that the tree can be accurately reconstructed with sequences of length $O(\log(n))$ when the branch lengths are below $\critksq$, known as the Kesten-Stigum (KS) bound. Although for the CFN model $\critmlq = \critksq$, it is known that for the more general GTR models one has $\critmlq \geq \critksq$ with a strict inequality in many cases. Here, we show that this phenomenon also holds for phylogenetic reconstruction by exhibiting a family of symmetric models $Q$ and a phylogenetic reconstruction algorithm which recovers the tree from $O(\log n)$-length sequences for some branch lengths in the range $(\critksq,\critmlq)$. Second we prove that phylogenetic reconstruction under GTR models requires a polynomial sequence-length for branch lengths above $\critmlq$.
- Published
- 2010
47. Global Alignment of Molecular Sequences via Ancestral State Reconstruction
- Author
-
Andoni, Alexandr, Daskalakis, Constantinos, Hassidim, Avinatan, and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution ,Quantitative Biology - Quantitative Methods - Abstract
Molecular phylogenetic techniques do not generally account for such common evolutionary events as site insertions and deletions (known as indels). Instead tree building algorithms and ancestral state inference procedures typically rely on substitution-only models of sequence evolution. In practice these methods are extended beyond this simplified setting with the use of heuristics that produce global alignments of the input sequences--an important problem which has no rigorous model-based solution. In this paper we consider a new version of the multiple sequence alignment in the context of stochastic indel models. More precisely, we introduce the following {\em trace reconstruction problem on a tree} (TRPT): a binary sequence is broadcast through a tree channel where we allow substitutions, deletions, and insertions; we seek to reconstruct the original sequence from the sequences received at the leaves of the tree. We give a recursive procedure for this problem with strong reconstruction guarantees at low mutation rates, providing also an alignment of the sequences at the leaves of the tree. The TRPT problem without indels has been studied in previous work (Mossel 2004, Daskalakis et al. 2006) as a bootstrapping step towards obtaining optimal phylogenetic reconstruction methods. The present work sets up a framework for extending these works to evolutionary models with indels.
- Published
- 2009
48. Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier
- Author
-
Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution ,Quantitative Biology - Quantitative Methods - Abstract
We introduce a new distance-based phylogeny reconstruction technique which provably achieves, at sufficiently short branch lengths, a polylogarithmic sequence-length requirement -- improving significantly over previous polynomial bounds for distance-based methods. The technique is based on an averaging procedure that implicitly reconstructs ancestral sequences. In the same token, we extend previous results on phase transitions in phylogeny reconstruction to general time-reversible models. More precisely, we show that in the so-called Kesten-Stigum zone (roughly, a region of the parameter space where ancestral sequences are well approximated by ``linear combinations'' of the observed sequences) sequences of length $\poly(\log n)$ suffice for reconstruction when branch lengths are discretized. Here $n$ is the number of extant species. Our results challenge, to some extent, the conventional wisdom that estimates of evolutionary distances alone carry significantly less information about phylogenies than full sequence datasets.
- Published
- 2009
49. Reconstruction on Trees: Exponential Moment Bounds for Linear Estimators
- Author
-
Peres, Yuval and Roch, Sebastien
- Subjects
Mathematics - Probability ,Computer Science - Data Structures and Algorithms ,Mathematics - Statistics Theory ,Quantitative Biology - Populations and Evolution - Abstract
Consider a Markov chain $(\xi_v)_{v \in V} \in [k]^V$ on the infinite $b$-ary tree $T = (V,E)$ with irreducible edge transition matrix $M$, where $b \geq 2$, $k \geq 2$ and $[k] = \{1,...,k\}$. We denote by $L_n$ the level-$n$ vertices of $T$. Assume $M$ has a real second-largest (in absolute value) eigenvalue $\lambda$ with corresponding real eigenvector $\nu \neq 0$. Letting $\sigma_v = \nu_{\xi_v}$, we consider the following root-state estimator, which was introduced by Mossel and Peres (2003) in the context of the "recontruction problem" on trees: \begin{equation*} S_n = (b\lambda)^{-n} \sum_{x\in L_n} \sigma_x. \end{equation*} As noted by Mossel and Peres, when $b\lambda^2 > 1$ (the so-called Kesten-Stigum reconstruction phase) the quantity $S_n$ has uniformly bounded variance. Here, we give bounds on the moment-generating functions of $S_n$ and $S_n^2$ when $b\lambda^2 > 1$. Our results have implications for the inference of evolutionary trees.
- Published
- 2009
50. Shrinkage Effect in Ancestral Maximum Likelihood
- Author
-
Mossel, Elchanan, Roch, Sebastien, and Steel, Mike
- Subjects
Quantitative Biology - Populations and Evolution ,Computer Science - Computational Engineering, Finance, and Science ,Mathematics - Probability ,Mathematics - Statistics Theory - Abstract
Ancestral maximum likelihood (AML) is a method that simultaneously reconstructs a phylogenetic tree and ancestral sequences from extant data (sequences at the leaves). The tree and ancestral sequences maximize the probability of observing the given data under a Markov model of sequence evolution, in which branch lengths are also optimized but constrained to take the same value on any edge across all sequence sites. AML differs from the more usual form of maximum likelihood (ML) in phylogenetics because ML averages over all possible ancestral sequences. ML has long been known to be statistically consistent -- that is, it converges on the correct tree with probability approaching 1 as the sequence length grows. However, the statistical consistency of AML has not been formally determined, despite informal remarks in a literature that dates back 20 years. In this short note we prove a general result that implies that AML is statistically inconsistent. In particular we show that AML can `shrink' short edges in a tree, resulting in a tree that has no internal resolution as the sequence length grows. Our results apply to any number of taxa.
- Published
- 2008
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.