Comparing and aggregating partially resolved trees

DOI10.1016/J.TCS.2011.08.027MaRDI QIDQ650896zbMATH OpenOpenAlexFDO

Authors Mukul S. Bansal, Jianrong Dong, David Fernández-Baca

Publication date 7 December 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.08.027

zbMATH Keywords

aggregationHausdorff distancecomputational biologyconsensusphylogenetic treesquartet distancetriplet distance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Probabilistic models, generic numerical methods in probability and statistics (65C20)

Recommendations

• Comparing and Aggregating Partially Resolved Trees
• On a matching distance between rooted phylogenetic trees
• scientific article; zbMATH DE number 5186265
• An algebraic metric for phylogenetic trees
• Nodal distances for rooted phylogenetic trees

Cites work

• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• scientific article; zbMATH DE number 2079318 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• scientific article; zbMATH DE number 1405796 (Why is no real title available?)
• Aggregating inconsistent information
• Algorithms on Strings, Trees and Sequences
• An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
• An improved algorithm for the maximum agreement subtree problem
• Comparing Partial Rankings
• Comparing and Aggregating Partially Resolved Trees
• Comparison of phylogenetic trees
• Computing the Local Consensus of Trees
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• Distributions on bicoloured evolutionary trees
• Metric methods for analyzing partially ranked data
• N-trees as nestings: Complexity, similarity, and consensus
• New results on optimizing rooted triplets consistency
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Subtree transfer operations and their induced metrics on evolutionary trees
• The median procedure for n-trees
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(16)

• Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
• Distributions of topological tree metrics between a species tree and a gene tree
• On a matching distance between rooted phylogenetic trees
• Cache oblivious algorithms for computing the triplet distance between trees
• An efficient algorithm for the rooted triplet distance between galled trees
• The Bourque distances for mutation trees of cancers
• A note on the path interval distance
• The asymmetric cluster affinity cost
• Computing the rooted triplet distance between galled trees by counting triangles
• Comparing and Aggregating Partially Resolved Trees
• Faster algorithms for computing the R* consensus tree
• An algebraic metric for phylogenetic trees
• Computing the rooted triplet distance between phylogenetic networks
• Fast algorithms for the rooted triplet distance between caterpillars
• Nodal distances for rooted phylogenetic trees
• On the weighted quartet consensus problem

Describes a project that uses

Uses Software

• PhySIC
• SuperTriplets
• Quartets MaxCut

This page was built for publication: Comparing and aggregating partially resolved trees

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