A family of fast constant-space substring search algorithms

This paper describes a new strategy for searching a substring in a given text. The method is based on the well-known Boyer-Moore algorithm complementing it with a technique called q-slicing, a form of probabilistic 5-gram matching. As a result, we get a family of highly parametric algorithms apt for...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Hakonen Harri
Raita Timo
Testületi szerző: Conference for PhD Students in Computer Science (1.) (1998) (Szeged)
Dokumentumtípus: Cikk
Megjelent: 1999
Sorozat:Acta cybernetica 14 No. 2
Kulcsszavak:Számítástechnika, Kibernetika, Algoritmus
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12624
LEADER 01499nab a2200241 i 4500
001 acta12624
005 20220614084332.0
008 161015s1999 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Hakonen Harri 
245 1 2 |a A family of fast constant-space substring search algorithms  |h [elektronikus dokumentum] /  |c  Hakonen Harri 
260 |c 1999 
300 |a 239-250 
490 0 |a Acta cybernetica  |v 14 No. 2 
520 3 |a This paper describes a new strategy for searching a substring in a given text. The method is based on the well-known Boyer-Moore algorithm complementing it with a technique called q-slicing, a form of probabilistic 5-gram matching. As a result, we get a family of highly parametric algorithms apt for adaptation to the special properties inherent to the source which generates the input strings. The search procedure is independent of the alphabet size and appropriate for efficient and practical on-line implementations. Simulation results show that they are comparable to the fastest currently known Boyer-Moore variants. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika, Algoritmus 
700 0 1 |a Raita Timo  |e aut 
710 |a Conference for PhD Students in Computer Science (1.) (1998) (Szeged) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12624/1/cybernetica_014_numb_002_239-250.pdf  |z Dokumentum-elérés