๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The exact online string matching problem

โœ Scribed by Faro, Simone; Lecroq, Thierry

Book ID
121232295
Publisher
Association for Computing Machinery
Year
2013
Tongue
English
Weight
418 KB
Volume
45
Category
Article
ISSN
0360-0300

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The exact online string matching problem
The exact online string matching problem
โœ Faro, Simone; Lecroq, Thierry ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 418 KB

This article addresses the __online exact string matching problem__ which consists in finding __all__ occurrences of a given pattern __p__ in a text __t__ . It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal

Handbook of Exact String Matching Algori
Handbook of Exact String Matching Algorithms
โœ Christian Charras, Thierry Lecroq ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› College Publications ๐ŸŒ English โš– 713 KB

String matching is a very important subject in the wider domain of text processing. It consists of finding one,or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this prob

Handbook of Exact String Matching Algori
Handbook of Exact String Matching Algorithms
โœ Christian Charras, Thierry Lecroq ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› College Publications ๐ŸŒ English โš– 153 KB

String matching is a very important subject in the wider domain of text processing. It consists of finding one,or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem