We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant ε > 0, a real-time string matching algorithm claiming O(mε) extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use Ω(m) extra space.
|Original language||English (US)|
|Number of pages||13|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|State||Published - Dec 1 2004|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)