A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A prefix array for parameterized strings
2017
Journal of Discrete Algorithms
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 there exists a bijection between the parameter symbols. Historically, p-strings have been employed for source code cloning, plagiarism detection, and biological sequence structural similarity. In this work, we identify the connection between the p-match and
doi:10.1016/j.jda.2016.11.002
fatcat:qptzx7ukmvhsdksohqk57tdqd4