Titlebook: Combinatorial Pattern Matching; 22nd Annual Symposiu Raffaele Giancarlo,Giovanni Manzini Conference proceedings 2011 Springer Berlin Heidel

敘述

的’

時間等

CUB

Jessica Blakeborough,Triin RoosaluThis paper presents a real-time randomized streaming string matching algorithm that uses .(log.) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never misses an actual occurrence.

TOXIC

Smart Cities and Smart Regions RoadmapWe use a simple observation about the locations of . to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.

Arbitrary

Algorithms on Grammar-Compressed StringsGrammar based compression, where one replaces a long string by a small contextfree grammar that generates the string, is a simple and powerful paradigm that captures many of the popular compression schemes, including the Lempel-Ziv family, Run-Length Encoding, Byte-Pair Encoding, Sequitur and Re-Pair.

uveitis

String Comparison and Lyndon-Like Factorization Using V-Order in Linear TimeIn this paper we extend previous work on Unique Maximal Factorization Families (UMFFs) and a total (but non-lexicographic) ordering of strings called V-order. We describe linear-time algorithms for string comparison and Lyndon factorization based on V-order. We propose extensions of these algorithms to other forms of order.

POWER

強制性

Retrieval

Simple Real-Time Constant-Space String MatchingWe use a simple observation about the locations of . to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.