Skip Navigation


Bioinformatics Advance Access originally published online on April 8, 2004
Bioinformatics 2004 20(15):2355-2360; doi:10.1093/bioinformatics/bth246
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/15/2355    most recent
bth246v1
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 Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Semple, C.
Right arrow Articles by Steel, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Semple, C.
Right arrow Articles by Steel, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(15) © Oxford University Press 2004; all rights reserved.

Supertree algorithms for ancestral divergence dates and nested taxa

Charles Semple 1,*, Philip Daniel 1, Wim Hordijk 1, Roderic D.M. Page 2 and Mike Steel 1

1 Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand and 2 DEEB, IBLS, Graham Kerr Building, University of Glasgow, Glasgow G12 8QP, UK

Received on November 3, 2003; revised on January 15, 2004; accepted on January 16, 2004
Advance Access Publication April 8, 2004

Motivation: Supertree methods have been often identified as a possible approach to the reconstruction of the ‘Tree of Life’. However, a limitation of such methods is that, typically, they use just leaf-labelled phylogenetic trees to infer the resulting supertree.

Results: In this paper, we describe several new supertree algorithms that extend the allowable information that can be used for phylogenetic inference. These algorithms have been recently implemented and we describe here two illustrative applications.

Availability: These new algorithms are freely available for application at http://darwin.zoology.gla.ac.uk/cgi-bin/build.pl

Contact: c.semple{at}math.canterbury.ac.nz

* To whom correspondence should be addressed.


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.