38 citations · 173 across the 47 of their papers we have counts for
25 papers · 1 filter
A Near-Linear Kernel for Two-Parsimony Distance
Elise Deen, Leo van Iersel, Remie Janssen +3
The maximum parsimony distance and the bounded-state maximum parsimony distance measure the difference between two phylogene…
Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm
Mark Jones, Steven Kelk, Leen Stougie
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 a…
Orienting undirected phylogenetic networks
Katharina T. Huber, Leo van Iersel, Remie Janssen +4
This paper studies the relationship between undirected (unrooted) and directed (rooted) phylogenetic networks. We describe a polynomial-time algorithm for deciding whether an undir…
Treewidth of display graphs: bounds, brambles and applications
Remie Janssen, Mark Jones, Steven Kelk +2
Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or…
Constructing a Consensus Phylogeny from a Leaf-Removal Distance
Cedric Chauve, Mark Jones, Manuel Lafond +2
Understanding the evolution of a set of genes or species is a fundamental problem in evolutionary biology. The problem we study here takes as input a set of trees describing {possi…
Chinese Postman Problem on Edge-Colored Multigraphs
Gregory Gutin, Mark Jones, Bin Sheng +2
It is well-known that the Chinese postman problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in…