Online String Algorithms
Online String Algorithms is a class of string processing algorithms that belong to the broader category of online algorithms, distinguished by their ability to process input strings sequentially in a left-to-right manner without requiring prior knowledge of the entire string, producing output incrementally as each character is read.
11
Publications
292
Citations
35
Authors
18
Institutions
Publications per year
2017–2026
3
Parents
11
Fast approximate string matching in a dictionary
Ricardo Baeza‐Yates, Gonzalo Navarro · 2002 · 65 citations
On the exact complexity of string matching
Livio Colussi, Zvi Galil, Raffaele Giancarlo · 2002 · 33 citations
Real-time algorithms for string-matching and palindrome recognition
Zvi Galil · 1976 · 31 citations
Online algorithm for the self-organizing map of symbol strings
Panu Somervuo · Neural Networks · 2004 · 28 citations
1–5 of 11
35
3
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 35
18
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
2 publications
38 citations
The University of Osaka
Osaka, Japan
1 h-index
2 publications
58 citations

Shahid Beheshti University of Medical Sciences
Tehran, Iran
1 h-index
1 publications
25 citations
University of Science and Culture
Tehran, Iran
1 h-index
1 publications
25 citations
Kyushu University
Fukuoka, Japan
1 h-index
5 publications
75 citations

Ural Federal University
Yekaterinburg, Russia
1 h-index
3 publications
36 citations
University of Chile
Santiago, Chile
1 h-index
2 publications
130 citations
First Affiliated Hospital of Harbin Medical University
Harbin, China
1 h-index
7 publications
91 citations
1–8 of 18
Repository · 2 publications · 27 citations
2
h-index
TPDS · 1 publications · 29 citations
1
h-index
1 publications · 25 citations
1
h-index
1 publications · 28 citations
1
h-index
TALG · 1 publications · 22 citations
1
h-index
1–5