"Exponential and Polynomial Time Algorithms for the Minimum Common String ..."

Bin Fu et al. (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22616-8_24

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/FuJYZ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/FuJYZ11
Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu:
Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. COCOA 2011: 299-310

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.