Search Sciweavers | Sciweavers

4 search results - page 1 / 1

» Dynamic Fully-Compressed Suffix Trees

click to vote

CPM
2008
Springer

117views Combinatorics» more CPM 2008»

Dynamic Fully-Compressed Suffix Trees

13 years 6 months ago

Download www.cs.ucr.edu

Luís M. S. Russo, Gonzalo Navarro, Arlindo ...

claim paper

Read More »

click to vote

STOC
2000
ACM

117views Algorithms» more STOC 2000»

Faster suffix tree construction with missing suffix links

13 years 8 months ago

Download eprints.iisc.ernet.in

Abstract. We consider suﬃx tree construction for situations with missing suﬃx links. Two examples of such situations are suﬃx trees for parameterized strings and suﬃx trees...

Richard Cole, Ramesh Hariharan

claim paper

Read More »

click to vote

VLDB
2002
ACM

184views Database» more VLDB 2002»

Database indexing for large DNA and protein sequence collections

14 years 4 months ago

Download cs-people.bu.edu

Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...

Ela Hunt, Malcolm P. Atkinson, Robert W. Irving

claim paper

Read More »

click to vote

CPM
2009
Springer

128views Combinatorics» more CPM 2009»

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

13 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers