Comparing and Aggregating Partially Resolved Trees

DOI10.1007/978-3-540-78773-0_7zbMath1136.92329OpenAlexW2161161368MaRDI QIDQ5458518

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

Publication date: 15 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_7

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Related Items (3)

Constructing the R* consensus tree of two trees in subcubic time ⋮ Comparing and aggregating partially resolved trees ⋮ On the weighted quartet consensus problem

Cites Work

• Unnamed Item
• Unnamed Item
• 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)\)
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Comparing Partial Rankings
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: Comparing and Aggregating Partially Resolved Trees