Designing weights for quartet-based methods when data is heterogeneous across lineages
Homogeneity across lineages is a common assumption in phylogenetics according to which nucleotide substitution rates remain constant in time and do not depend on lineages. This is a simplifying hypothesis which is often adopted to make the process of sequence evolution more tractable. However, its validity has been explored and put into question in several papers. On the other hand, dealing successfully with the general case (heterogeneity across lineages) is one of the key features of phylogenetic reconstruction methods based on algebraic tools. The goal of this paper is twofold. First, we present a new weighting system for quartets (ASAQ) based on algebraic and semi-algebraic tools, thus specially indicated to deal with data evolving under heterogeneus rates. This method combines the weights two previous methods by means of a test based on the positivity of the branch length estimated with the paralinear distance. ASAQ is statistically consistent when applied to GM data, considers rate and base composition heterogeneity among lineages and does not assume stationarity nor time-reversibility. Second, we test and compare the performance of several quartet-based methods for phylogenetic tree reconstruction (namely, Quartet Puzzling, Weight Optimization and Wilson's method) in combination with ASAQ weights and other weights based on algebraic and semi-algebraic methods or on the paralinear distance. These tests are applied to both simulated and real data and support Weight Optimization with ASAQ weights as a reliable and successful reconstruction method.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Topological metrizations of trees, and new quartet methods of tree inference
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate no…
Inferring metric trees from weighted quartets via an intertaxon distance
A metric phylogenetic tree relating a collection of taxa induces weighted rooted triples and weighted quartets for all subsets of three and four taxa, respectively. New intertaxon distances are defined that can be calcul…
A Fast Quartet Tree Heuristic for Hierarchical Clustering
The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the $3{n \choose 4}$ weighted quartet topologies on $n$ objects, where optimality means that the summed weight of the embedded quartet top…
Clusteringglobal-optimizationOn the quartet distance given partial information
Let $T$ be an arbitrary phylogenetic tree with $n$ leaves. It is well-known that the average quartet distance between two assignments of taxa to the leaves of $T$ is $\frac 23 \binom{n}{4}$. However, a longstanding conje…
Combinatorics of Linked Systems of Quartet Trees
We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value $k$ such that all collections of at least $k$ quartets are decisive. Moreover, we prove that this bound is optimal and gi…