Reconstructing a level-1-network from quartets
WM Willem Sonke · TU/e Research Portal · 2013
This paper deals with the problem of reconstructing a phylogenetic network from quartets. Specifically a polynomial-time algorithm was implemented to reconstruct trees and level1-networks from quartet data that satisfies certain conditions. This algorithm uses linear algebra methods to construct the set of orders the taxa can have along the boundary when drawing a planar embedding of the network. Then, the network can be reconstructed. Several experiments are performed to validate the implementation and measure the accuracy and performance of the algorithm.