Supertrees by flipping

DOI10.1007/3-540-45655-4_42MaRDI QIDQ4808660zbMATH OpenFDO

Authors Duhong Chen, Oliver Eulenstein, Michael J. Sanderson, David Fernández-Baca

Publication date 12 August 2004

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/2387/23870391.htm

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Problems related to evolution (92D15)

Recommendations

• scientific article; zbMATH DE number 1974598
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
• FlipCut supertrees: towards matrix representation accuracy in polynomial time
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• A supertree method for rooted trees

Cited in

(10)

• Reconstructing minimal rooted trees.
• The edit distance function of some graphs
• A cubic-vertex kernel for flip consensus tree
• FlipCut supertrees: towards matrix representation accuracy in polynomial time
• A cubic-vertex kernel for flip consensus tree
• Improved fixed-parameter algorithms for minimum-flip consensus trees
• Edit distance measure for graphs.
• An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
• scientific article; zbMATH DE number 1974598 (Why is no real title available?)

This page was built for publication: Supertrees by flipping

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