"Tighter Bounds and Optimal Algorithms for All Maximal α-gapped ..."

Pawel Gawrychowski et al. (2018)

> Home

Details and statistics

DOI: 10.1007/S00224-017-9794-5

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/GawrychowskiIIK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/GawrychowskiIIK18
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018)

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.