"Algorithms for Three Versions of the Shortest Common Superstring Problem."

Maxime Crochemore et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-13509-5_27

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpm/CrochemoreCIKRRW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/CrochemoreCIKRRW10
Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309

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.