Titlebook: Combinatorial Pattern Matching; 24th Annual Symposiu Johannes Fischer,Peter Sanders Conference proceedings 2013 Springer-Verlag Berlin Heid

HERTZ

玷污

Martina Hedvicakova,Libuse Svobodovant an algorithm that runs in .(. − .) expected time and uses .(. + .. ) space, where . − . ≤ . is the exact number of characters decompressed by the algorithm and .. ≤ . − . is the number of distinct q-grams in . . This simultaneously matches the current best known time bound and improves the best k

极小

Corral

CRACY

Conflict

支柱

Johannes Fischer,Peter SandersUp-to-date results.Fast track conference proceedings.State-of-the-art report

机构

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229990.jpg

Resection

Jerzy J. Korczak,Ilona PawełoszekLCP, the Longest Common Prefix, is ubiquitous in the realm of data structures for indexing. This surprisingly simple minute definition – magically – plays a big role in Pattern Matching. We will try to understand this ”magic” by examining a couple of interesting applications.

Affluence