SEARCHING FOR FLEXIBLE REPEATED PATTERNS USING A NON-TRANSITIVE SIMILARITY RELATION

被引：13

作者：

SOLDANO, H

VIARI, A

CHAMPESME, M

机构：

[1] UNIV PARIS 13,INST GALILEE,PHYS & CHIM BIOMOLEC LAB,CNRS,URA 198,F-93430 VILLETANEUSE,FRANCE

[2] INST CURIE,PHYS CHIM SECT,ATELIER BIOINFORMAT,F-75005 PARIS,FRANCE

来源：

PATTERN RECOGNITION LETTERS | 1995年 / 16卷 / 03期

关键词：

D O I：

10.1016/0167-8655(94)00095-K

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 Rosenberg algorithms for the identification of repeated patterns.

引用

页码：233 / 246

页数：14