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

First Author: Crochemore M

Attributed to: Approximate Matching of Sequences. funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.jda.2015.05.003

Publication URI: http://dx.doi.org/10.1016/j.jda.2015.05.003

Type: Journal Article/Review

Parent Publication: Journal of Discrete Algorithms