Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
15
click to vote
CPM
2008
Springer
favorite
Email
discuss
report
117
views
Combinatorics
»
more
CPM 2008
»
Dynamic Fully-Compressed Suffix Trees
13 years 10 months ago
Download
www.cs.ucr.edu
Luís M. S. Russo, Gonzalo Navarro, Arlindo
Real-time Traffic
Combinatorics
|
CPM 2008
|
claim paper
Related Content
»
Faster suffix tree construction with missing suffix links
»
Database indexing for large DNA and protein sequence collections
»
Contracted Suffix Trees A Simple and Dynamic Text Indexing Data Structure
more »
Post Info
More Details (n/a)
Added
19 Oct 2010
Updated
19 Oct 2010
Type
Conference
Year
2008
Where
CPM
Authors
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision