10 citations · 11 across the 5 of their papers we have counts for
5 papers
Bounds on the sequence length sufficient to reconstruct binary level- phylogenetic networks under the CFN model
Martin Frohn, Niels Holtgrefe, Leo van Iersel +2
Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which…
A branch-&-price approach to the unrooted maximum agreement forest problem
Martin Frohn, Steven Kelk, Simona Vychytilova
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 i…
A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
Martin Frohn, Steven Kelk
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…
Reconstructing semi-directed level-1 networks using few quarnets
Martin Frohn, Niels Holtgrefe, Leo van Iersel +2
Semi-directed networks are partially directed graphs that model evolution where the directed edges represent reticulate evolutionary events. We present an algorithm that reconstruc…
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
Steven Chaplick, Martin Frohn, Steven Kelk +2
In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a -approximation for the Maximum Independent Set problem on interval gra…