APA (7th ed.) Citation

Sand, A., Brodal, G. S., Fagerberg, R., Pedersen, C. N., & Mailund, T. (2013). A practical O(n log2n) time algorithm for computing the triplet distance on binary trees. BMC bioinformatics, 14(Suppl 2), S18. https://doi.org/10.1186/1471-2105-14-S2-S18

Chicago Style (17th ed.) Citation

Sand, Andreas, Gerth Stølting Brodal, Rolf Fagerberg, Christian NS Pedersen, and Thomas Mailund. "A Practical O(n Log2n) Time Algorithm for Computing the Triplet Distance on Binary Trees." BMC Bioinformatics 14, no. Suppl 2 (2013): S18. https://doi.org/10.1186/1471-2105-14-S2-S18.

MLA (9th ed.) Citation

Sand, Andreas, et al. "A Practical O(n Log2n) Time Algorithm for Computing the Triplet Distance on Binary Trees." BMC Bioinformatics, vol. 14, no. Suppl 2, 2013, p. S18, https://doi.org/10.1186/1471-2105-14-S2-S18.