Comparing and aggregating partially resolved trees

DOI10.1016/j.tcs.2011.08.027zbMath1227.92040OpenAlexW2144144677MaRDI QIDQ650896

Jianrong Dong, Mukul S. Bansal, 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

aggregationcomputational biologyconsensusHausdorff distancephylogenetic treesquartet distancetriplet distance

Mathematics Subject Classification ID

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

Related Items (10)

An efficient algorithm for the rooted triplet distance between galled trees ⋮ Fast algorithms for the rooted triplet distance between caterpillars ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance between Trees ⋮ Computing the rooted triplet distance between galled trees by counting triangles ⋮ On a matching distance between rooted phylogenetic trees ⋮ On the weighted quartet consensus problem ⋮ Faster algorithms for computing the R* consensus tree ⋮ Computing the rooted triplet distance between phylogenetic networks ⋮ A note on the path interval distance ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees

Uses Software

• PhySIC
• SuperTriplets
• Quartets MaxCut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New results on optimizing rooted triplets consistency
• An improved algorithm for the maximum agreement subtree problem
• Metric methods for analyzing partially ranked data
• N-trees as nestings: Complexity, similarity, and consensus
• Voting schemes for which it can be difficult to tell who won the election
• Comparison of phylogenetic trees
• Phylogenetic supertrees. Combining information to reveal the tree of life
• The median procedure for n-trees
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
• Distributions on bicoloured evolutionary trees
• Computing the Local Consensus of Trees
• Algorithms on Strings, Trees and Sequences
• Comparing and Aggregating Partially Resolved Trees
• Comparing Partial Rankings
• Aggregating inconsistent information
• Subtree transfer operations and their induced metrics on evolutionary trees

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