Approximate Text Searching

@misc{citeulike:128166, abstract = {This thesis focuses on the problem of text retrieval allowing errors, also called \"approximate\" string matching. The problem is to find a pattern in a text, where the pattern and the text may have \"errors\". This problem has received a lot of attention in recent years because of its applications in many areas, such as information retrieval, computational biology and signal processing, to name a few. The aim of this work is the development and analysis of novel algorithms to deal with the ...}, author = {Navarro, G. }, citeulike-article-id = {128166}, keywords = {matching, string}, posted-at = {2005-03-15 22:45:53}, priority = {2}, title = {Approximate Text Searching}, url = {http://citeseer.ist.psu.edu/badino98approximate.html}, year = {1998} }

TY - GEN ID - citeulike:128166 L3 - citeulike-article-id:128166 TI - Approximate Text Searching N2 - This thesis focuses on the problem of text retrieval allowing errors, also called "approximate" string matching. The problem is to find a pattern in a text, where the pattern and the text may have "errors". This problem has received a lot of attention in recent years because of its applications in many areas, such as information retrieval, computational biology and signal processing, to name a few. The aim of this work is the development and analysis of novel algorithms to deal with the ... KW - matching KW - string AU - Navarro, G PY - 1998/// UR - http://citeseer.ist.psu.edu/badino98approximate.html ER -