research
∙
11/01/2022
A Near-Linear Kernel for Two-Parsimony Distance
The maximum parsimony distance d_MP(T_1,T_2) and the bounded-state maxim...
share
research
∙
01/10/2020
The Burning Number of Directed Graphs: Bounds and Computational Complexity
The burning number of a graph was recently introduced by Bonato et al. A...
research
∙
12/09/2019
Combining Networks using Cherry Picking Sequences
Phylogenetic networks are important for the study of evolution. The numb...
research
∙
10/24/2019
Cutting an alignment with Ockham's razor
In this article, we investigate different parsimony-based approaches tow...
research
∙
07/19/2019
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
We present the first fixed-parameter algorithm for constructing a tree-c...
research
∙
06/18/2019
Rooting for phylogenetic networks
This paper studies the relationship between undirected (unrooted) and di...
research
∙
06/11/2019
Rearrangement operations on unrooted phylogenetic networks
Rearrangement operations transform a phylogenetic tree into another one ...
research
∙
09/04/2018
Treewidth of display graphs: bounds, brambles and applications
Phylogenetic trees and networks are leaf-labelled graphs used to model e...
research
∙
08/25/2017
