In the context of reconstructing phylogenetic networks from a collection...
We describe a kernel of size 9k-8 for the NP-hard problem of computing t...
Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs t...
The rooted subtree prune and regraft (rSPR) distance between two rooted
...
We propose a general framework based on quasi-isometries to study graph
...
Phylogenetic trees are leaf-labelled trees used to model the evolution o...
Recently there has been considerable interest in the problem of finding ...
While every rooted binary phylogenetic tree is determined by its set of
...
The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well stud...
Recently it was shown that, if the subtree and chain reduction rules hav...
In 2001 Allen and Steel showed that, if subtree and chain reduction rule...
Phylogenetic networks are rooted directed acyclic graphs that represent
...
Throughout the last decade, we have seen much progress towards character...
Recently, the minimum number of reticulation events that is required to
...
Here we show that deciding whether two rooted binary phylogenetic trees ...