A note on the longest common compatible prefix problem for partial words - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

Longest Common Prefixes with k-Errors and ApplicationsLorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis. spire 2018: 27-41 [doi]

Longest Common Prefixes with k-Mismatches and ApplicationsHayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis. sofsem 2018: 636-649 [doi]

runs on WebDSL