Old and New in Stringology
Twenty five years ago in a paper titled “Open Problems in Stringology” I listed thirteen open problems in a field I called Stringology. The first part of the talk will revisit the list. Some problems were solved, others were partially solved and some resisted any progress. The second part of the tal...
Saved in:
| Published in | Combinatorial Pattern Matching p. 26 |
|---|---|
| Main Author | |
| Format | Book Chapter |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
|
| Series | Lecture Notes in Computer Science |
| Online Access | Get full text |
Cover
Loading…
| Summary: | Twenty five years ago in a paper titled “Open Problems in Stringology” I listed thirteen open problems in a field I called Stringology. The first part of the talk will revisit the list. Some problems were solved, others were partially solved and some resisted any progress.
The second part of the talk will review some recent results in Stringology, namely algorithms in the streaming model. In this model, the algorithms cannot store the entire input string(s) and can use only very limited space. Surprisingly, efficient algorithms were discovered for a number of string problems.
The talk will conclude with new open problems that are raised by these new results. |
|---|---|
| ISBN: | 9783642135088 3642135080 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-642-13509-5_3 |