Open Access Research article

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

Accesses  

  • Last 30 days: 57 accesses
  • Last 365 days: 1397 accesses
  • All time: 1397 accesses

Cited by

Google Scholar: View citations

ISI Web of Science: View citations

PubMed Central: View citations