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

DOI10.1007/S00453-012-9698-3MaRDI QIDQ378228zbMATH OpenOpenAlexFDO

Authors Malte Brinkmeyer, Thasso Griebel, 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 cutminimum flip supertree problemperfect phylogenyphylogeneticssupertrees

Mathematics Subject Classification ID

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

Recommendations

• FlipCut supertrees: towards matrix representation accuracy in polynomial time
• scientific article; zbMATH DE number 1974598
• scientific article; zbMATH DE number 2089994
• scientific article; zbMATH DE number 1945190
• A supertree method for rooted trees

Cites work

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

Cited in

(5)

• FlipCut supertrees: towards matrix representation accuracy in polynomial time
• scientific article; zbMATH DE number 1945190 (Why is no real title available?)
• scientific article; zbMATH DE number 1974598 (Why is no real title available?)
• scientific article; zbMATH DE number 2089994 (Why is no real title available?)
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378228)