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

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

Thasso Griebel, Malte Brinkmeyer, Sebastian Böcker

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

algorithmsminimum cutphylogeneticsminimum flip supertree problemperfect phylogenysupertrees

Mathematics Subject Classification ID

Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing rooted supertrees using distances
• The computational complexity of inferring rooted phylogenies by parsimony
• The Steiner problem in phylogeny is NP-complete
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• On the complexity of constructing evolutionary trees
• A supertree method for rooted trees
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Extension operations on sets of leaf-labelled trees
• A simple and fast min-cut algorithm
• On the structure of all minimum cuts in a network and applications
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Algorithms on Strings, Trees and Sequences
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Incomplete Directed Perfect Phylogeny
• Minimum cuts in near-linear time
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time