"Closest Substring Problems for Regular Languages."

Yo-Sub Han et al. (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-98654-8_32

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dlt/HanK0S18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/HanK0S18
Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest Substring Problems for Regular Languages. DLT 2018: 392-403

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.