Finding Repeated Flexible Relational Words in Sequences
Finding regularities in sequences is an important problem in various areas. Regularities are often words (in a strict or somewhat flexible meaning) "repeated" in the sequence, i.e. satisfying some constraints about their occurrence. In this paper we deal with relational values that express...
Main Authors: | Nahla EL ZANT EL KADHI, Henry SOLDANO |
---|---|
Format: | Article |
Language: | English |
Published: |
International Institute of Informatics and Cybernetics
2004-08-01
|
Series: | Journal of Systemics, Cybernetics and Informatics |
Subjects: | |
Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/P371970.pdf
|
Similar Items
-
Grasping frequent subgraph mining for bioinformatics applications
by: Aida Mrzic, et al.
Published: (2018-09-01) -
A Framework for Discovery and Diagnosis of Behavioral Transitions in Event-streams
by: Akhlaghi, Arash
Published: (2013) -
Les motifs séquentiels pour les données issues des puces ADN
by: Salle, Paola
Published: (2010) -
A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences
by: Caiyan Jia, et al.
Published: (2011-10-01) -
A new approach to filtering spam SMS: Motif Patterns
by: Yılmaz Kaya, et al.
Published: (2018-06-01)