"Efficient algorithms for computing the triplet and quartet distance ..."

Gerth Stølting Brodal et al. (2013)

> Home

Details and statistics

DOI: 10.1137/1.9781611973105.130

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/soda/BrodalFMPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BrodalFMPS13
Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand:
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. SODA 2013: 1814-1832

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.