Geodesic
Complexity of search of a substring entering in a set of strings
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2018), pp. 16-21

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper considers the problem of listing all occurrences of an arbitrary pattern in the strings from given set. We obtain lower bound for amount of time taken by search algorithms. We also obtain the order of memory volumes required by algorithms with the best order search time. 
@article{VMUMM_2018_3_a2,
     author = {E. M. Perper},
     title = {Complexity of search of a substring entering in a set of strings},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {16--21},
     publisher = {mathdoc},
     number = {3},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2018_3_a2/}
}
TY  - JOUR
AU  - E. M. Perper
TI  - Complexity of search of a substring entering in a set of strings
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2018
SP  - 16
EP  - 21
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2018_3_a2/
LA  - ru
ID  - VMUMM_2018_3_a2
ER  - 
%0 Journal Article
%A E. M. Perper
%T Complexity of search of a substring entering in a set of strings
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2018
%P 16-21
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2018_3_a2/
%G ru
%F VMUMM_2018_3_a2
E. M. Perper. Complexity of search of a substring entering in a set of strings. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2018), pp. 16-21. http://geodesic.mathdoc.fr/item/VMUMM_2018_3_a2/