Order reprints

Open Access

A scalable method for identifying frequent subtrees in sets of large phylogenetic trees

Avinash Ramu, Tamer Kahveci* and J Gordon Burleigh

BMC Bioinformatics 2012, 13:256  doi:10.1186/1471-2105-13-256

This article is currently available as a provisional PDF. Reprints are produced from the final PDF, which is normally produced within 3 weeks.

Please complete the following form to register your interest in ordering reprints of this article. BioMed Central will contact you by email when the final PDF is available with details of how to obtain a quotation and place an order.

Fields marked * are required

http://www.biomedcentral.com/1471-2105/13/256
1471-2105-13-256