A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Searching for flexible repeated patterns using a non-transitive similarity relation
1995
Pattern Recognition Letters
Given a reflexive and symmetric, but not necessarily transitive, similarity relation defined on an alphabet of symbols, two objects of size k are related if, at each position, their symbols are related. Then, given a set of objects, we are interested in maximal subsets of related objects. We give some general properties of these subsets and we propose algorithms for identifying them in the particular case of k-length substrings in a string. These algorithms derive from the Karp, Miller and
doi:10.1016/0167-8655(94)00095-k
fatcat:5jbnxoxjobcifolxtrulbosh6y