Comparing and aggregating partially resolved trees
Authors:
- Mukul S. BansalMBMukul S. Bansal
- Jianrong DongJDJianrong Dong
- David Fernández-BacaDFDavid Fernández-Baca
- 1 November 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (48) , 6634-6652
Abstract
No abstract availableKeywords
All Related Versions
This publication has 30 references indexed in Scilit:
- New results on optimizing rooted triplets consistencyDiscrete Applied Mathematics, 2010
- Multipolar Consensus for Phylogenetic TreesSystematic Biology, 2006
- Discriminating Supported and Unsupported Relationships in Supertrees Using TripletsSystematic Biology, 2006
- Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)Algorithmica, 2003
- Subtree Transfer Operations and Their Induced Metrics on Evolutionary TreesAnnals of Combinatorics, 2001
- The Triples Distance for Rooted Bifurcating Phylogenetic TreesSystematic Biology, 1996
- Voting schemes for which it can be difficult to tell who won the electionSocial Choice and Welfare, 1989
- The median procedure for n-treesJournal of Classification, 1986
- N-trees as nestings: Complexity, similarity, and consensusJournal of Classification, 1986
- Analysis of Quartet Dissimilarity Measures Between Undirected Phylogenetic TreesSystematic Zoology, 1986