scientific article; zbMATH DE number 6851886

DOI10.4230/LIPICS.MFCS.2016.53MaRDI QIDQ4608616zbMATH OpenFDO

Authors Jesper Jansson, Wing-Kin Sung

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2016.53

zbMATH Keywords

bioinformaticscomputational complexitylocal consensusminimal supertreephylogenetic treerooted triplet

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of inferring a minimally resolved phylogenetic supertree
• Building a small and informative phylogenetic supertree
• scientific article; zbMATH DE number 7564377
• Minimal Triangulation Algorithms for Perfect Phylogeny Problems
• Computing phylogenetic trees using topologically related minimum spanning trees
• On the consistency of the minimum evolution principle of phylogenetic inference
• The minimum evolution distance-based approach to phylogenetic inference
• Robustness of phylogenetic inference based on minimum evolution

Cited in

(8)

• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Reconstructing minimal rooted trees.
• The complexity of inferring a minimally resolved phylogenetic supertree
• Computing a smallest multi-labeled phylogenetic tree from rooted triplets
• Molecular trees with the sixth, seventh and eighth minimal irregularity values
• scientific article; zbMATH DE number 7564377 (Why is no real title available?)
• Consensus clusters in Robinson-Foulds reticulation networks
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees

This page was built for publication:

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