| | |
Summary: Recuperació de la informació
·Modern Information Retrieval (1999)
Ricardo-Baeza Yates and Berthier Ribeiro-Neto
·Flexible Pattern Matching in Strings (2002)
Gonzalo Navarro and Mathieu Raffinot
·Algorithms on strings (2001)
M. Crochemore, C. Hancart and T. Lecroq
·http://www-igm.univ-mlv.fr/~lecroq/string/index.html
String Matching
String matching: definition of the problem (text,pattern)
depends on what we have: text or patterns· Exact matching:
· Approximate matching:
· 1 pattern ---> The algorithm depends on |p| and | |
· k patterns ---> The algorithm depends on k, |p| and | |
· The text ----> Data structure for the text (suffix tree, ...)
· The patterns ---> Data structures for the patterns
· Dynamic programming
· Sequence alignment (pairwise and multiple)
· Extensions
· Regular Expressions
|
