"Fast Algorithms for the Shortest Unique Palindromic Substring Problem on ..."

Kiichi Watanabe et al. (2020)

> Home

Details and statistics

DOI: 10.1007/S00224-020-09980-X

access: closed

type: Journal Article

metadata version: 2024-06-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/WatanabeNIBT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/WatanabeNIBT20
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. Theory Comput. Syst. 64(7): 1273-1291 (2020)

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.