research-article

Free Access

Forest for the trees

Author:
George V. Neville-Neil

View Profile

Authors Info & Claims

Communications of the ACM Volume 54 Issue 2February 2011pp 35–36https://doi.org/10.1145/1897816.1897833

Published:01 February 2011Publication History

Check for updates on crossmark

Communications of the ACM

Abstract

Keeping your source trees in order.

Index Terms

Recommendations

Approximating Maximum Agreement Forest on Multiple Binary Trees

Given a collection of phylogenetic trees on the same leaf label-set, the Maximum Agreement Forest problem (Maf) asks for a largest common subforest of these trees. The Maf problem on two binary phylogenetic trees has been studied extensively. In this ...
Read More
Algorithms for parameterized maximum agreement forest problem on multiple trees

The Maximum Agreement Forest problem (MAF) asks for a largest common subforest of a collection of phylogenetic trees. The MAF problem on two binary phylogenetic trees has been studied extensively in the literature. In this paper, we present a group of ...
Read More
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

Given two rooted binary phylogenetic trees with identical leaf label-set, the maximum agreement forest (MAF) problem asks for a largest common subforest of the two trees. This problem has been studied extensively in the literature, and has been known to ...
Read More

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in

Communications of the ACM Volume 54, Issue 2
February 2011
115 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/1897816
Issue’s Table of Contents

Copyright © 2011 Copyright is held by the owner/author(s)
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
- Published: 1 February 2011
Permissions
Request permissions about this article.
Request Permissions

Check for updates
Qualifiers
- research-article
- Popular
- Un-reviewed
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 0
  Total Citations
  View Citations
- 659
  Total Downloads
- Downloads (Last 12 months)37
- Downloads (Last 6 weeks)19
Other Metrics
View Author Metrics
Cited By
This publication has not been cited yet

PDF Format

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format .

View HTML Format

View Issue’s Table of Contents