<--- Back to Details
First PageDocument Content
Information / Compressed pattern matching / String matching algorithms / Aho–Corasick string matching algorithm / LZ77 and LZ78
Date: 2010-09-27 17:35:50
Information
Compressed pattern matching
String matching algorithms
Aho–Corasick string matching algorithm
LZ77 and LZ78

Small-Space 2D Compressed Dictionary Matching

Add to Reading List

Source URL: www.cs.ucr.edu

Download Document from Source Website

File Size: 573,73 KB

Share Document on Facebook

Similar Documents

Information / Compressed pattern matching / String matching algorithms / Aho–Corasick string matching algorithm / LZ77 and LZ78

Small-Space 2D Compressed Dictionary Matching

DocID: 15Ltp - View Document

Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda Department of Informatics, Kyushu University, JAPAN

DocID: 15Hhh - View Document

Pattern matching / Data compression / Compressed pattern matching / Computer data

Processing Compressed Texts: A Tractability Border Yury Lifshits Steklov Institute of Mathematics at St.Petersburg http://logic.pdmi.ras.ru/~yura

DocID: 14oQZ - View Document

String searching algorithm / Computer programming / Mathematical analysis / Mathematics / Pattern matching / Approximate string matching / Regular expression

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts Philip Bille IT University of Copenhagen Rolf Fagerberg

DocID: 124GO - View Document

Pattern matching / Formal languages / Lempel–Ziv–Welch / Archive formats / Substring / Compressed pattern matching / Compress / LZ77 and LZ78 / Diff / Computing / Data compression / System software

Window subsequence problems for compressed texts? Patrick C´egielski1, Ir`ene Guessarian2 , Yury Lifshits3 , Yuri Matiyasevich3 1 LACL, UMR-FRE 2673, Universit´e Paris 12, Route foresti`ere Hurtault, F-77300

DocID: 119jI - View Document