"Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem."

Anders Dessmark et al. (2007)

> Home

Details and statistics

DOI: 10.1007/S00453-007-0080-9

access: closed

type: Journal Article

metadata version: 2022-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DessmarkJLL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DessmarkJLL07
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007)

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.