We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in O m + n log m/m , where n is the size of the text and m the size of the searched word, both taken on an alphabet ) and linear in the worst case (in O m + n ). Of all the algorithms tha
β¦ LIBER β¦
Time-space-optimal string matching
β Scribed by Zvi Galil; Joel Seiferas
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 875 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Simple Optimal String Matching Algorithm
β
Cyril Allauzen; Mathieu Raffinot
π
Article
π
2000
π
Elsevier Science
π
English
β 140 KB
O(1)-time parallel string-matching algor
β
Kuo-Liang Chung
π
Article
π
1996
π
Elsevier Science
π
English
β 301 KB
Generalized string functions of N = 1 sp
β
Ralph Blumenhagen; Andreas WiΓkirchen
π
Article
π
1995
π
Elsevier Science
π
English
β 736 KB
Quantum string theory in curved space-ti
β
N. SΓ‘nchez
π
Article
π
1990
π
John Wiley and Sons
π
English
β 364 KB
π 1 views
## Abstract A general method to quantize strings in curved spaceβtimes is exposed. It treats the spaceβtime metric exactly and the string excitations small as compared with the energy scale of the geometry. The method is applied to cosmological (de Sitter) and blackβhole (Schwarzschild) geometries
Space-time symmetries of quantized tensi
β
J. Isberg; U. LindstrΓΆm; B. Sundborg
π
Article
π
1992
π
Elsevier Science
π
English
β 395 KB
String-matching on ordered alphabets
β
Maxime Crochemore
π
Article
π
1992
π
Elsevier Science
π
English
β 975 KB