Pattern matching

Author	dc.contributor.author	Navarro, Gonzalo
Admission date	dc.date.accessioned	2007-04-18T21:50:45Z
Available date	dc.date.available	2007-04-18T21:50:45Z
Publication date	dc.date.issued	2004-10
Cita de ítem	dc.identifier.citation	JOURNAL OF APPLIED STATISTICS 31 (8): 925-949 OCT 2004	en
Identifier	dc.identifier.issn	0266-4763
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/124529
Abstract	dc.description.abstract	An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques, and how simpler patterns can be dealt with more simply and efficiently. We consider exact as well as approximate pattern matching. Also we cover both sequential searching, where the sequence cannot be preprocessed, and indexed searching, where we have a data structure built over the sequence to speed up the search.	en
Lenguage	dc.language.iso	en	en
Publisher	dc.publisher	CARFAX PUBLISHING	en
Keywords	dc.subject	ALGORITHM	en
Título	dc.title	Pattern matching	en
Document type	dc.type	Artículo de revista