Quartet cleaning: Improved algorithms and simulations

DOI10.1007/3-540-48481-7_28MaRDI QIDQ4938781zbMATH OpenFDO

Authors Vincent Berry, Tao Jiang, Todd Wareham, Paul Kearney, Ming Li

Publication date 10 September 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48481-7_28

zbMATH Keywords

evolutionary treesmaximum quartet consistencyquartet errorssimulations

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Recommendations

• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• Fast error-tolerant quartet phylogeny algorithms
• Fast error-tolerant quartet phylogeny algorithms
• From quartets to phylogenetic trees
• A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method

Cited in

(22)

• Consistency of the QNet algorithm for generating planar split networks from weighted quartets
• A structured family of clustering and tree construction methods
• On the weighted quartet consensus problem
• A fixed-parameter algorithm for minimum quartet inconsistency
• New fixed-parameter algorithms for the minimum quartet inconsistency problem
• Improved metaheuristics for the quartet method of hierarchical clustering
• Reconstructing phylogenetic trees from multipartite quartet systems
• A high quartet distance construction
• Testing consistency of quartet topologies: a parameterized approach
• Minimum tree cost quartet puzzling
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• On the maximum quartet distance between phylogenetic trees
• Fast error-tolerant quartet phylogeny algorithms
• New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
• Fast error-tolerant quartet phylogeny algorithms
• Reconstructing phylogenetic tree from multipartite quartet system
• Comparing and Aggregating Partially Resolved Trees
• A fast quartet tree heuristic for hierarchical clustering
• A property tester for tree-likeness of quartet topologies
• Comparing and aggregating partially resolved trees
• A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
• Encoding phylogenetic trees in terms of weighted quartets

This page was built for publication: Quartet cleaning: Improved algorithms and simulations

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