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

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. [doi]

@article{CrochemoreIKKLR15,
  title = {A note on the longest common compatible prefix problem for partial words},
  author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Alessio Langiu and Jakub Radoszewski and Wojciech Rytter and Bartosz Szreder and Tomasz Walen},
  year = {2015},
  doi = {10.1016/j.jda.2015.05.003},
  url = {http://dx.doi.org/10.1016/j.jda.2015.05.003},
  researchr = {https://researchr.org/publication/CrochemoreIKKLR15},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {34},
  pages = {49-53},
}