Comparing and Aggregating Partially Resolved Trees

DOI10.1007/978-3-540-78773-0_7zbMATH Open1136.92329OpenAlexW2161161368MaRDI QIDQ5458518FDOQ5458518

Authors: 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

Recommendations

• Comparing and aggregating partially resolved trees
• Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
• On a matching distance between rooted phylogenetic trees
• An algebraic metric for phylogenetic trees
• scientific article

Mathematics Subject Classification ID

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

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
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• 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
• The median procedure for n-trees
• N-trees as nestings: Complexity, similarity, and consensus

Cited In (4)

• On the weighted quartet consensus problem
• Constructing the R* consensus tree of two trees in subcubic time
• Comparing and aggregating partially resolved trees
• An algebraic metric for phylogenetic trees

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 Q5458518)