Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  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
·http://www-igm.univ-mlv.fr/~lecroq/string/index.html
Algorismes de:
Cerca de patrons (exacta i aproximada)
(String matching i Pattern matching)
Indexació de textos:
Suffix trees, Suffix arrays
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

  

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

 

Collections: Computer Technologies and Information Sciences