10 citations · 11 across the 5 of their papers we have counts for
Showing q-bio.PEShow all
3 papers · 1 filter
q-bio.PE2025
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…
q-bio.PE2024★ 1 cited
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…
q-bio.PE2024★ 10 cited
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…