Sciweavers

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

104

Voted

ALGORITHMICA
2008

71views more ALGORITHMICA 2008»

Improved Approximate String Matching Using Compressed Suffix Data Structures

15 years 2 months ago

Improved Approximate String Matching Using Compressed Suffix Data Structures

Download www.springerlink.com

Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong

Real-time Traffic

ALGORITHMICA 2007 | ALGORITHMICA 2008 |

claim paper

Related Content

» OnLine LinearTime Construction of Word Suffix Trees

» Database indexing for large DNA and protein sequence collections

» SpaceEfficient Framework for Topk String Retrieval Problems

» Reconstructing a Suffix Array

» String Matching in Hardware Using the FMIndex

» Approximate String Matching with LempelZiv Compressed Indexes

» Better external memory suffix array construction

» Suffix tree construction algorithms on modern hardware

» Speeding Up Two StringMatching Algorithms

Post Info
More Details (n/a)

Added	24 Dec 2010
Updated	24 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong

Comments (0)