I. Simon, String Matching Algorithms and Automata, First South-American Workshop on String Processing 93, Belo Horizonte, Brazil, R. Baeza-Yates and N. Ziviani,ed, 151--157, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity Of Sequential Pattern Matching Algorithms - May Mireille Egnier Self-citation (Algorithms) (Correct)
No context found.
I. Simon, String Matching Algorithms and Automata, First South-American Workshop on String Processing 93, Belo Horizonte, Brazil, R. Baeza-Yates and N. Ziviani,ed, 151--157, 1993.
Complexity of Sequential Pattern Matching Algorithms - Regnier, Szpankowski (1999) Self-citation (Algorithms) (Correct)
....is repeated. This algorithm is sequential (hence semi sequential) but not strongly sequential. Condition in (ii) is violated after any mismatch on a alignment position l with parameter k 3 , as comparison (l 1; 1) occurs after (l 1; 2) and (l 2; 3) Example 2: Morris Pratt like algorithms [15, 18]. It was already noted [15] that after a mismatch occurs when comparing t[l] with p[k] some alignment positions in [l 1; l k Gamma 1] can be disregarded without further text pattern comparisons. Namely, the ones that satisfy t l k Gamma1 l i 6= p k Gammai 1 . Or, equivalently, p ....
I. Simon, String Matching Algorithms and Automata, First South-American Workshop on String Processing 93, Belo Horizonte, Brazil, R. Baeza-Yates and N. Ziviani,ed, 151--157, 1993.
Complexity of Sequential Pattern Matching Algorithms - Regnier, Szpankowski Self-citation (Algorithms) (Correct)
....repeated. This algorithm is sequential (hence semi sequential) but not strongly sequential. Condition in (ii) is violated after any mismatch on an alignment position l with parameter k 3 , as comparison (l 1; 1) occurs after (l 1; 2) and (l 2; 3) Example 2: Morris Pratt like algorithms [16, 19]. It was already noted in [16] that after a mismatch occurs when comparing t[l] with p[k] some alignment positions in [l 1; l k Gamma 1] can be disregarded without further text pattern comparisons. Namely, the ones that satisfy t l k Gamma1 l i 6= p k Gammai 1 . Or, equivalently, ....
I. Simon, String Matching Algorithms and Automata, First South-American Workshop on String Processing 93, Belo Horizonte, Brazil, R. Baeza-Yates and N. Ziviani, ed, 151--157, 1993.
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