Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

SPIRE
2000
Springer

favoriteEmaildiscussreport

137views Information Technology» more SPIRE 2000»

Bit-Parallel Approach to Approximate String Matching in Compressed Texts

14 years 2 months ago

Bit-Parallel Approach to Approximate String Matching in Compressed Texts

Download www.shino.ecei.tohoku.ac.jp

Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, A

Real-time Traffic

Information Management | SPIRE 2000 |

claim paper

Related Content

» BitParallel Witnesses and Their Applications to Approximate String Matching

» Increased BitParallelism for Approximate String Matching

» On BitParallel Processing of Multibyte Text

» Approximate String Matching over ZivLempel Compressed Text

» Fast BitParallel Matching for Network and Regular Expressions

» Improved Approximate String Matching and Regular Expression Matching on ZivLempel Compress...

» A General Practical Approach to Pattern Matching over ZivLempel Compressed Text

» BoyerMoore String Matching over ZivLempel Compressed Text

» Approximate String Matching with LempelZiv Compressed Indexes

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	SPIRE
Authors	Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa

Comments (0)