Journal article
A prefix array for parameterized strings
Abstract
A parameterized string (p-string) is a generalization of the traditional string over two alphabets: a constant alphabet and a parameter alphabet. A parameterized match (p-match) exists between two p-strings if the constants match exactly and if there exists a bijection between the parameter symbols. Historically, p-strings have been leveraged for source code cloning, plagiarism detection, and biological sequence structural similarity. In this …
Authors
Beal R; Adjeroh DA; Smyth WF
Journal
Journal of Discrete Algorithms, Vol. 42, , pp. 23–34
Publisher
Elsevier
Publication Date
January 2017
DOI
10.1016/j.jda.2016.11.002
ISSN
1570-8667