default search action

combined dblp search
author search
venue search
publication search

ask others

"Approximating Longest Common Substring with k mismatches: Theory and Practice."

Garance Gourdel et al. (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CPM.2020.16

access: open

type: Conference or Workshop Paper

metadata version: 2020-06-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cpm/GourdelKRS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/GourdelKRS20
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM 2020: 16:1-16:15

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.