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

DOI10.1016/j.jda.2015.05.003zbMath1336.68312arXiv1312.2381OpenAlexW1643513060WikidataQ61677838 ScholiaQ61677838MaRDI QIDQ491152

B. Szreder, Tomasz Kociumaka, Tomasz Walen, Wojciech Rytter, Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Costas S. Iliopoulos, Alessio Langiu

Publication date: 24 August 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.2381

zbMATH Keywords

dynamic programminglongest common prefixpartial wordlongest common compatible prefix

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

Computing longest common extensions in partial words ⋮ Longest common extension

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Algorithms for Finding Nearest Common Ancestors
• Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
• Algorithmic Combinatorics on Partial Words
• Algorithms on Strings

This page was built for publication: A note on the longest common compatible prefix problem for partial words