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

Open Access Email this article to a friend

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

Fields marked * are required

Multiple email addresses should be separated with commas or semicolons.
How can I ensure that I receive BMC Bioinformatics's emails?