Skip Navigation

Systematic Biology 2008 57(6):825-834; doi:10.1080/10635150802552831
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bordewich, M.
Right arrow Articles by Semple, C.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Bordewich, M.
Right arrow Articles by Semple, C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 Society of Systematic Biologists

Selecting Taxa to Save or Sequence: Desirable Criteria and a Greedy Solution

Magnus Bordewich1, Allen G. Rodrigo2 and Charles Semple3

1 Department of Computer Science, Durham University Durham DH1 3LE, United Kingdom; E-mail: m.j.r.bordewich{at}durham.ac.uk
2 Bioinformatics Institute and the Allan Wilson Centre for Molecular Ecology and Evolution, University of Auckland Auckland, New Zealand; E-mail: a.rodrigo{at}auckland.ac.nz
3 Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury Christchurch, New Zealand; E-mail: c.semple{at}math.canterbury.ac.nz

Edited by Tim Collins


  Abstract

Three desirable properties for any method of selecting a subset of evolutionary units (EUs) for conservation or for genomic sequencing are discussed. These properties are spread, stability, and applicability. We are motivated by a practical case in which the maximization of phylogenetic diversity (PD), which has been suggested as a suitable method, appears to lead to counterintuitive collections of EUs and does not meet these three criteria. We define a simple greedy algorithm (GreedyMMD) as a close approximation to choosing the subset that maximizes the minimum pairwise distance (MMD) between EUs. GreedyMMD satisfies our three criteria and may be a useful alternative to PD in real-world situations. In particular, we show that this method of selection is suitable under a model of biodiversity in which features arise and/or disappear during evolution. We also show that if distances between EUs satisfy the ultrametric condition, then GreedyMMD delivers an optimal subset of EUs that maximizes both the minimum pairwise distance and the PD. Finally, because GreedyMMD works with distances and does not require a tree, it is readily applicable to many data sets.

Keywords: Biodiversity conservation; greedy algorithm; phylogenetic diversity

Received November 5, 2007; Revised December 22, 2007; Accepted August 17, 2008
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.