Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

This article is part of the supplement: Selected articles from the Eleventh Asia Pacific Bioinformatics Conference (APBC 2013): Bioinformatics

Open Access Open Badges Proceedings

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees

Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian NS Pedersen and Thomas Mailund*

BMC Bioinformatics 2013, 14(Suppl 2):S18  doi:10.1186/1471-2105-14-S2-S18

Article Metrics

Total accesses

Article metric FAQ


  • Last 30 days: 50 accesses
  • Last 365 days: 569 accesses
  • All time: 1381 accesses

These numbers are accesses on BioMed Central websites only, and an underestimate of total usage. More information

Open Badges