Ricardo Baeza-Yates  Home/Search
Context Related
| sunsite.dcc.uchile.cl/p...unified.ps.gz www2.is.titech.ac.jp/~watanab...9.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dichato.dcc.uchile.cl/~rb...confs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a unified view to sequential algorithms for many pattern matching problems, using a finite automaton built from the pattern which uses the text as input. We show the limitations of deterministic finite automata (DFA) and the advantages of using a bitwise simulation of non-deterministic finite automata (NFA). This approach gives very fast practical algorithms which have good complexity for small patterns on a RAM machine with word length O(logn), where n is the size of the text. For... (Update)
Cited by: More
Dealing with Hardware Space Limits When Removing.. - Giraud, Lavenier (2005) (Correct)
Active bibliography (related documents): More All
0.5: On the Size of Minimal Automata for Approximate String Matching - El-Mabrouk (Correct)
0.5: About the Size of Boyer-Moore Automata - Bruyère, Baeza-Yates.. (Correct)
0.4: Approximate Text Searching - Badino (1998) (Correct)
Similar documents based on text: More All
0.5: Fast Regular Expression Matching using FPGAs - Sidhu, Prasanna (2001) (Correct)
0.5: Compact Thompson's NFA - Canfield, Xing (2000) (Correct)
0.4: Efficient Ambiguity Detection in C-NFA: A Step Towards the.. - Coste, Fredouille (Correct)
BibTeX entry: (Update)
Ricardo A. Baeza-Yates. A unified view to string matching algorithms. In Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics, LNCS, pages 1--15, 1996. http://citeseer.ist.psu.edu/baeza-yates96unified.html More
@inproceedings{ baezayates96unified,
author = "Ricardo A. Baeza-Yates",
title = "A Unified View to String Matching Algorithms",
booktitle = "Conference on Current Trends in Theory and Practice of Informatics",
pages = "1-15",
year = "1996",
url = "citeseer.ist.psu.edu/baeza-yates96unified.html" }
Citations (may not include all citations):347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
214 A fast string searching algorithm (context) - Boyer, Moore - 1977
196 Fast text searching allowing errors (context) - Wu, Manber - 1992
114 Finding approximate patterns in strings (context) - Ukkonen - 1985
92 Algorithms for approximate string matching (context) - Ukkonen - 1985
81 A new approach to text searching (context) - Baeza-Yates, Gonnet - 1992
71 An improved algorithm for approximate string matching (context) - Galil, Park - 1990
69 Surpassing the information theoretic bound with fusion trees (context) - Fredman, Willard - 1993
57 Regular expression search algorithm (context) - Thompson - 1968
53 Generalized string matching (context) - Abrahamson - 1987
51 A sublinear algorithm for approximate keyword searching (context) - Myers - 1994
45 Approximate matching of regular expressions (context) - Myers, Miller - 1989
43 Handbook of Algorithms and Data Structures - In Pascal and C (context) - Gonnet, Baeza-Yates - 1991
35 Fast string matching with k differences (context) - Landau, Vishkin - 1988
35 String matching and other products (context) - Fischer, Paterson - 1974
29 An algorithm for string matching with a sequence of don't ca.. (context) - Manber, Baeza-Yates - 1991
27 Fast and practical approximate pattern matching (context) - Baeza-Yates, Perleberg - 1992
24 Text retrieval: Theory and practice (context) - Baeza-Yates - 1992
22 A four-russians algorithm for regular expression pattern mat.. (context) - Myers - 1992
21 A faster algorithm for approximate string matching (context) - Baeza-Yates, Navarro - 1996
18 Approximate string matching using within-word parallelism - Wright - 1994
11 A subquadratic algorithm for approximate regular expression .. (context) - Wu, Manber et al. - 1995
10 Fast algorithms for approximately counting mismatches (context) - Karloff - 1993
10 Efficient string matching with don't-care patterns (context) - Pinter - 1985
9 Theoretical Computer Science (context) - Baeza-Yates, note - 1991
9 A fast heuristic for approximate string matching (context) - Baeza-Yates, Navarro - 1996
7 Efficient string matching (context) - Kosaraju - 1987
7 String matching algorithms and automata (context) - Simon - 1993
5 Analyse Exacte et en Moyenne d'Algorithmes de Recherche d'un.. (context) - Hancart - 1993
2 Approximate string matching by finite automata (context) - Melichar - 1995
2 On Boyer-Moore automata (context) - Baeza-Yates, Choffrut et al. - 1994
1 A unified view of pattern matching problems (context) - Baeza-Yates - 1995
1 Sorting in linear time (context) - Anderson, Hagerup et al. - 1995
1 the size of BoyerMoore automata (context) - Bruyere, Baeza-Yates et al. - 1996
1 A fast algorithm for string matching with mismatches (context) - Dermouche - 1995
Documents on the same site (http://dichato.dcc.uchile.cl/~rbaeza/cv/confs.html): More
Fast Searching on Compressed Text Allowing Errors - de Moura, Navarro, al. (1998) (Correct)
A Faster Algorithm for Approximate String Matching (Extended .. - Baeza-Yates, al. (1996) (Correct)
A Framework to Animate String Algorithms - Baeza-Yates, Fuentes (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC