Computing the local consensus of trees

Authors:
Sampath Kannan;Tandy Warnow;Shibu Yooseph
Affiliations:
Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Venue:
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Year:
1995

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Decremental dynamic connectivity

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Supertrees by Flipping

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

The Journal of Machine Learning Research
Minimum-Flip Supertrees: Complexity and Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An improved fixed-parameter algorithm for minimum-flip consensus trees

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees

ACM Transactions on Algorithms (TALG)

Hi-index	0.00