Searching for flexible repeated patterns using a non-transitive similarity relation

Henri Soldano, Alain Viari, Marc Champesme
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
more » ... berg algorithms for the identification of repeated patterns. * Corresponding author. 0167-8655/95/$09.50 © 1995 Elsevier Science B.V. All rights reserved 00095-6 H. et al. / Pattern Recognition Letters 16 (1995) [233][234][235][236][237][238][239][240][241][242][243][244][245][246]
doi:10.1016/0167-8655(94)00095-k fatcat:5jbnxoxjobcifolxtrulbosh6y