Modified mincut supertrees

DOI10.1007/3-540-45784-4_41MaRDI QIDQ4410170zbMATH OpenFDO

Authors Roderic D. M. Page

Publication date 2 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2452/24520537.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Recommendations

• A supertree method for rooted trees
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
• FlipCut supertrees: towards matrix representation accuracy in polynomial time
• scientific article; zbMATH DE number 1974600
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves

Cited in

(14)

• Encoding and constructing 1-nested phylogenetic networks with trinets
• On the ancestral compatibility of two phylogenetic trees with nested taxa
• Maximum agreement and compatible supertrees
• Extending the limits of supertree methods
• FlipCut supertrees: towards matrix representation accuracy in polynomial time
• From Gene Trees to Species Trees through a Supertree Approach
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
• scientific article; zbMATH DE number 1974600 (Why is no real title available?)
• Building species trees from larger parts of phylogenomic databases
• The asymmetric cluster affinity cost
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
• The topology diameters of the asymmetric cluster affinity cost
• New results on optimizing rooted triplets consistency
• Polynomial-time completion of phylogenetic tree sets

This page was built for publication: Modified mincut supertrees

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