Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Recuperaci de la informaci Modern Information Retrieval (1999)

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
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


Source: Arias, Marta - Departament of Llenguatges i Sistemes Informátics, Universitat Politècnica de Catalunya


Collections: Computer Technologies and Information Sciences