Result: Longest motifs with a functionally equivalent central block

Title:
Longest motifs with a functionally equivalent central block
Authors:
CROCHEMORE, Maxime, GIANCARLO, Raffaele, SAGOT, Marie-France
Source:
SPIRE 2004 : string processing and information retrieval (Padova, 5-8 October 2004)Lecture notes in computer science. :298-309
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 22 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Traitement des données. Listes et chaînes de caractères, Data processing. List processing. Character string processing, Algorithmique, Algorithmics, Algorítmica, Chaîne caractère, Character string, Cadena carácter, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Expression régulière, Regular expression, Expresión regular, Fermeture, Closure, Cerradura, Recherche information, Information retrieval, Búsqueda información, Algèbre Kleene, Kleene algebra, Algebra Kleene
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institut Gaspard-Monge, University of Marne-la-Vallée, 77454 Marne-la-Vallée, France
Department of Computer Science, King's College London, London WC2R 2LS, United Kingdom
Dipartimento di Matematica ed Applicazioni, University di Palermo, Via Archirafi 34, 90123 Palermo, Italy
Inria Rhône-Alpes, Laboratoire de Biométrie et Biologie Evolutive, University Claude Bernard, 69622 Villeurbanne, France
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16177859
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16177859
Database:
PASCAL Archive

Further Information

This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [8] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [8] and extend to the case of regular expressions with no Kleene closure or complement operation. We show that a single general algorithmic tool that is a non-trivial extension of the ideas introduced in [8] can handle all the various kinds of longest block motifs defined in this paper. The algorithm complexity is, in all cases, in O(n log n).