Zobrazeno 1 - 10
of 338
pro vyhledávání: '"Kelk P"'
We propose the first branch-&-price algorithm for the maximum agreement forest problem on unrooted binary trees: given two unrooted X-labelled binary trees we seek to partition X into a minimum number of blocks such that the induced subtrees are disj
Externí odkaz:
http://arxiv.org/abs/2410.04122
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of species, and this motivates the use of distance measures to quantify diss
Externí odkaz:
http://arxiv.org/abs/2409.18634
Autor:
Frohn, Martin, Kelk, Steven
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 is a roote
Externí odkaz:
http://arxiv.org/abs/2409.18077
Semi-directed networks are partially directed graphs that model evolution where the directed edges represent reticulate evolutionary events. We present an algorithm that reconstructs binary $n$-leaf semi-directed level-1 networks in $O( n^2)$ time fr
Externí odkaz:
http://arxiv.org/abs/2409.06034
Phylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees, such as hybridization, introgression, and lateral gene transfer. Studying phylogenetic networks under a statistical model of DNA sequence evolutio
Externí odkaz:
http://arxiv.org/abs/2407.11720
In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a $(2/3)$-approximation for the Maximum Independent Set problem on interval graphs. We show that this is tight, even on unit interval graphs of maxim
Externí odkaz:
http://arxiv.org/abs/2403.10868
Autor:
Martinez, Virginia Aardevol, Chaplick, Steven, Kelk, Steven, Meuwese, Ruben, Mihalak, Matus, Stamoulis, Georgios
There are multiple factors which can cause the phylogenetic inference process to produce two or more conflicting hypotheses of the evolutionary history of a set X of biological entities. That is: phylogenetic trees with the same set of leaf labels X
Externí odkaz:
http://arxiv.org/abs/2309.01110
Autor:
Kelk, Steven, Meuwese, Ruben
Given a set $X$ of species, a phylogenetic tree is an unrooted binary tree whose leaves are bijectively labelled by $X$. Such trees can be used to show the way species evolve over time. One way of understanding how topologically different two phyloge
Externí odkaz:
http://arxiv.org/abs/2307.12176
Let $G$ be an undirected graph. We say that $G$ contains a ladder of length $k$ if the $2 \times (k+1)$ grid graph is an induced subgraph of $G$ that is only connected to the rest of $G$ via its four cornerpoints. We prove that if all the ladders con
Externí odkaz:
http://arxiv.org/abs/2302.10662
We describe a kernel of size 9k-8 for the NP-hard problem of computing the Tree Bisection and Reconnect (TBR) distance k between two unrooted binary phylogenetic trees. We achieve this by extending the existing portfolio of reduction rules with three
Externí odkaz:
http://arxiv.org/abs/2206.04451