\textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time

DOI10.1007/s00453-012-9698-3zbMath1311.92133MaRDI QIDQ378228

Sebastian Böcker, Malte Brinkmeyer, Thasso Griebel

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9698-3

zbMATH Keywords

algorithms; minimum cut; phylogenetics; minimum flip supertree problem; perfect phylogeny; supertrees

Mathematics Subject Classification ID

92D15: Problems related to evolution

68W05: Nonnumerical algorithms

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Uses Software

• RAxML
• PAUP*
• FlipCut
• EPoS
• PhySIC
• SuperTriplets
• Rec-I-DCM3