中文
相关论文

相关论文: Level-k Phylogenetic Network can be Constructed fr…

200 篇论文

Recently much attention has been devoted to the construction of phylogenetic networks which generalize phylogenetic trees in order to accommodate complex evolutionary processes. Here we present an efficient, practical algorithm for…

种群与进化 · 定量生物学 2009-10-22 Katharina T. Huber , Leo van Iersel , Steven Kelk , Radoslaw Suchecki

We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm…

离散数学 · 计算机科学 2019-07-22 Leo van Iersel , Remie Janssen , Mark Jones , Yukihiro Murakami , Norbert Zeh

Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set $X$ of sampled species. In contrast to phylogenetic trees which show only speciation events, networks can also accommodate reticulate…

组合数学 · 数学 2021-01-01 Peter L. Erdos , Charles Semple , Mike Steel

Phylogenetic trees canonically arise as embeddings of phylogenetic networks. We recently showed that the problem of deciding if two phylogenetic networks embed the same sets of phylogenetic trees is computationally hard, \blue{in…

组合数学 · 数学 2021-04-13 Janosch Doecker , Simone Linz , Charles Semple

In phylogenetics, tree-based networks are used to model and visualize the evolutionary history of species where reticulate events such as horizontal gene transfer have occurred. Formally, a tree-based network $N$ consists of a phylogenetic…

离散数学 · 计算机科学 2020-08-21 Jonathan Klawitter , Peter Stumpf

A normal (phylogenetic) network with $k$ reticulations displays $2^k$ phylogenetic trees. In this paper, we establish an analogous result for tree-child (phylogenetic) networks with no underlying $3$-cycles. In particular, we show that a…

组合数学 · 数学 2025-08-20 Charles Semple , Kristina Wicke

It has remained an open question for some time whether, given a set of not necessarily binary (i.e. "nonbinary") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that…

种群与进化 · 定量生物学 2012-08-03 Steven Kelk , Celine Scornavacca

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…

Reticulate evolution gives rise to complex phylogenetic networks, making their interpretation challenging. A typical approach is to extract trees within such networks. Since Francis and Steel's seminal paper, "Which Phylogenetic Networks…

组合数学 · 数学 2025-05-20 Takatora Suzuki , Momoko Hayamizu

In phylogenetics, phylogenetic trees are rooted binary trees, whereas phylogenetic networks are rooted arbitrary acyclic digraphs. Edges are directed away from the root and leaves are uniquely labeled with taxa in phylogenetic networks. For…

种群与进化 · 定量生物学 2016-03-30 Andreas DM Gunawan , Bhaskar DasGupta , Louxin Zhang

In evolutionary biology, phylogenetic networks are constructed to represent the evolution of species in which reticulate events are thought to have occurred, such as recombination and hybridization. It is therefore useful to have…

种群与进化 · 定量生物学 2017-03-16 Vincent Moulton , James Oldman , Taoyang Wu

We study the problem of finding a temporal hybridization network for a set of phylogenetic trees that minimizes the number of reticulations. First, we introduce an FPT algorithm for this problem on an arbitrary set of $m$ binary trees with…

数据结构与算法 · 计算机科学 2022-11-09 Sander Borst , Leo van Iersel , Mark Jones , Steven Kelk

A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree based networks. Reticulation-visible networks and child-sibling networks are all…

种群与进化 · 定量生物学 2015-09-09 Louxin Zhang

An important problem in evolutionary biology is to reconstruct the evolutionary history of a set $X$ of species. This history is often represented as a phylogenetic network, that is, a connected graph with leaves labelled by elements in $X$…

组合数学 · 数学 2017-02-01 Leo van Iersel , Vincent Moulton

We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is…

A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there…

种群与进化 · 定量生物学 2022-06-28 Vincent Moulton , Taoyang Wu

Phylogenetic networks are a generalization of evolutionary trees that are used by biologists to represent the evolution of organisms which have undergone reticulate evolution. Essentially, a phylogenetic network is a directed acyclic graph…

种群与进化 · 定量生物学 2017-02-01 Leo van Iersel , Vincent Moulton , Eveline de Swart , Taoyang Wu

'Tree-based' phylogenetic networks proposed by Francis and Steel have attracted much attention of theoretical biologists in the last few years. At the heart of the definitions of tree-based phylogenetic networks is the notion of 'support…

组合数学 · 数学 2019-04-30 Momoko Hayamizu , Kazuhisa Makino

Phylogenetic networks allow modeling reticulate evolution, capturing events such as hybridization and horizontal gene transfer. A fundamental computational problem in this context is the Tree Containment problem, which asks whether a given…

数据结构与算法 · 计算机科学 2026-03-13 Sebastian Bruchhold , Mathias Weller

Phylogenetic networks generalize phylogenetic trees, and have been introduced in order to describe evolution in the case of transfer of genetic material between coexisting species. There are many classes of phylogenetic networks, which can…

组合数学 · 数学 2020-03-13 Mathilde Bouvel , Philippe Gambette , Marefatollah Mansouri