中文
相关论文

相关论文: On the Quirks of Maximum Parsimony and Likelihood …

200 篇论文

Phylogenetic networks are used to display the relationship of different species whose evolution is not treelike, which is the case, for instance, in the presence of hybridization events or horizontal gene transfers. Tree inference methods…

种群与进化 · 定量生物学 2014-05-02 Mareike Fischer , Leo van Iersel , Steven Kelk , Celine Scornavacca

In comparison to phylogenetic trees, phylogenetic networks are more suitable to represent complex evolutionary histories of species whose past includes reticulation such as hybridisation or lateral gene transfer. However, the reconstruction…

种群与进化 · 定量生物学 2024-05-31 Janosch Döcker , Simone Linz , Kristina Wicke

Phylogenetic networks are often constructed by merging multiple conflicting phylogenetic signals into a directed acyclic graph. It is interesting to explore whether a network constructed in this way induces biologically-relevant…

种群与进化 · 定量生物学 2017-07-13 Steven Kelk , Fabio Pardi , Celine Scornavacca , Leo van Iersel

Finding the most parsimonious tree inside a phylogenetic network with respect to a given character is an NP-hard combinatorial optimization problem that for many network topologies is essentially inapproximable. In contrast, if the network…

种群与进化 · 定量生物学 2025-01-14 Martin Frohn , Steven Kelk

Maximum likelihood is one of the most widely used techniques to infer evolutionary histories. Although it is thought to be intractable, a proof of its hardness has been lacking. Here, we give a short proof that computing the maximum…

概率论 · 数学 2011-09-30 S. Roch

In this paper, we investigate a conjecture by von Haeseler concerning the Maximum Parsimony method for phylogenetic estimation, which was published by the Newton Institute in Cambridge on a list of open phylogenetic problems in 2007. This…

种群与进化 · 定量生物学 2010-07-30 Mareike Fischer

Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of…

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…

数据结构与算法 · 计算机科学 2020-04-07 Mark Jones , Steven Kelk , Leen Stougie

Tuffley and Steel (1997) proved that Maximum Likelihood and Maximum Parsimony methods in phylogenetics are equivalent for sequences of characters under a simple symmetric model of substitution with no common mechanism. This result has been…

种群与进化 · 定量生物学 2009-07-06 Mareike Fischer , Bhalchandra D. Thatte

Estimating phylogenetic trees, which depict the relationships between different species, from aligned sequence data (such as DNA, RNA, or proteins) is one of the main aims of evolutionary biology. However, tree reconstruction criteria like…

种群与进化 · 定量生物学 2024-10-02 Mareike Fischer

Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each…

种群与进化 · 定量生物学 2014-06-03 Mareike Fischer , Michelle Galla , Lina Herbst , Mike Steel

Phylogenetic networks are necessary to represent the tree of life expanded by edges to represent events such as horizontal gene transfers, hybridizations or gene flow. Not all species follow the paradigm of vertical inheritance of their…

种群与进化 · 定量生物学 2016-02-15 Claudia Solís-Lemus , Cécile Ané

Construction of phylogenetic trees has traditionally focused on binary trees where all species appear on leaves, a problem for which numerous efficient solutions have been developed. Certain application domains though, such as viral…

数据结构与算法 · 计算机科学 2016-11-01 Dimitris Papamichail , Angela Huang , Andrew Miller , Edward Kennedy , Jan-Lucas Ott , Georgios Papamichail

The evolutionary relationships among organisms have traditionally been represented using rooted phylogenetic trees. However, due to reticulate processes such as hybridization or lateral gene transfer, evolution cannot always be adequately…

种群与进化 · 定量生物学 2022-01-20 Sungsik Kong , Joan Carles Pons , Laura Kubatko , Kristina Wicke

Phylogenetic networks extend phylogenetic trees to allow for modeling reticulate evolutionary processes such as hybridization. They take the shape of a rooted, directed, acyclic graph, and when parameterized with evolutionary parameters,…

种群与进化 · 定量生物学 2018-08-28 R. A. L. Elworth , H. A. Ogilvie , J. Zhu , L. Nakhleh

Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered `tree-like' or…

种群与进化 · 定量生物学 2017-11-21 Michael Hendriksen

Phylogenetic networks are a generalization of phylogenetic trees to leaf-labeled directed acyclic graphs that represent ancestral relationships between species whose past includes non-tree-like events such as hybridization and horizontal…

组合数学 · 数学 2021-04-13 Janosch Döcker , Simone Linz , Charles Semple

Phylogenetic networks are generalizations of phylogenetic trees that allow the representation of reticulation events such as horizontal gene transfer or hybridization, and can also represent uncertainty in inference. A subclass of these,…

种群与进化 · 定量生物学 2019-10-15 Mareike Fischer , Andrew Francis

Mechanistic network models specify the mechanisms by which networks grow and change, allowing researchers to investigate complex systems using both simulation and analytical techniques. Unfortunately, it is difficult to write likelihoods…

统计方法学 · 统计学 2023-07-19 Jonathan Larson , Jukka-Pekka Onnela

We analyse a maximum-likelihood approach for combining phylogenetic trees into a larger `supertree'. This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description…

种群与进化 · 定量生物学 2007-08-17 Mike Steel , Allen Rodrigo
‹ 上一页 1 2 3 10 下一页 ›