Comparing and aggregating partially resolved trees
DOI10.1016/J.TCS.2011.08.027zbMATH Open1227.92040OpenAlexW2144144677MaRDI QIDQ650896FDOQ650896
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
Recommendations
aggregationHausdorff distancecomputational biologyconsensusphylogenetic treesquartet distancetriplet distance
Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Probabilistic models, generic numerical methods in probability and statistics (65C20)
Cites Work
- Metric methods for analyzing partially ranked data
- Comparison of phylogenetic trees
- Title not available (Why is that?)
- Subtree transfer operations and their induced metrics on evolutionary trees
- Voting schemes for which it can be difficult to tell who won the election
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Comparing Partial Rankings
- Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Aggregating inconsistent information
- Title not available (Why is that?)
- New results on optimizing rooted triplets consistency
- The median procedure for n-trees
- Title not available (Why is that?)
- An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
- An improved algorithm for the maximum agreement subtree problem
- N-trees as nestings: Complexity, similarity, and consensus
- Distributions on bicoloured evolutionary trees
- Computing the Local Consensus of Trees
- Title not available (Why is that?)
- Comparing and Aggregating Partially Resolved Trees
Cited In (14)
- On the weighted quartet consensus problem
- The Bourque distances for mutation trees of cancers
- Computing the rooted triplet distance between galled trees by counting triangles
- Fast algorithms for the rooted triplet distance between caterpillars
- Faster algorithms for computing the R* consensus tree
- On a matching distance between rooted phylogenetic trees
- An efficient algorithm for the rooted triplet distance between galled trees
- A note on the path interval distance
- Nodal distances for rooted phylogenetic trees
- Computing the rooted triplet distance between phylogenetic networks
- Comparing and Aggregating Partially Resolved Trees
- An algebraic metric for phylogenetic trees
- Cache Oblivious Algorithms for Computing the Triplet Distance between Trees
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
Uses Software
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)
