"A practical O(n log2 n) time algorithm for computing the ..."

Andreas Sand et al. (2013)

> Home

Details and statistics

DOI: 10.1186/1471-2105-14-S2-S18

access: open

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/bmcbi/SandBFPM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bmcbi/SandBFPM13
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund:
A practical O(n log² n) time algorithm for computing the triplet distance on binary trees. BMC Bioinform. 14(S-2): S18 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.