Sciweavers

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

13

CPM
2009
Springer

favoriteEmaildiscussreport

128views Combinatorics» more CPM 2009»

Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure

13 years 8 months ago

Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure

Download www.cs.colostate.edu

Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan

Real-time Traffic

Combinatorics | CPM 2009 |

claim paper

Related Content

» Database indexing for large DNA and protein sequence collections

» Indexing GappedFactors Using a Tree

» Better external memory suffix array construction

» Efficient Computation of Substring Equivalence Classes with Suffix Arrays

» Suffix tree construction algorithms on modern hardware

» Simple LinearTime OffLine Text Compression by LongestFirst Substitution

» SpaceEfficient Framework for Topk String Retrieval Problems

» Fast InMemory XPath Search using Compressed Indexes

» A compressed selfindex using a ZivLempel dictionary

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2009
Where	CPM
Authors	Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo

Comments (0)