"An approximation algorithm for the shortest common supersequence problem: ..."

Paolo Barone et al. (2001)

> Home

Details and statistics

DOI: 10.1145/372202.372275

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sac/BaroneBVM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sac/BaroneBVM01
Paolo Barone, Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
An approximation algorithm for the shortest common supersequence problem: an experimental analysis. SAC 2001: 56-60

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.