"A note on the longest common compatible prefix problem for partial words."

Maxime Crochemore et al. (2015)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2015.05.003

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/CrochemoreIKKLR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CrochemoreIKKLR15
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015)

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.