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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
212
click to vote
VLDB
2005
ACM
132
views
Database
»
more
VLDB 2005
»
Practical methods for constructing suffix trees
16 years 3 months ago
Download
www.eecs.umich.edu
Yuanyuan Tian, Sandeep Tata, Richard A. Hankins, J
Real-time Traffic
Database
|
Suffix Trees
|
VLDB 2005
|
claim paper
Related Content
»
Suffix Arrays A New Method for OnLine String Searches
»
Suffix trees for very large genomic sequences
»
Online construction of compact suffix vectors and maximal repeats
»
Linear work suffix array construction
»
Practical Suffix Tree Construction
»
Database indexing for large DNA and protein sequence collections
»
Genomescale diskbased suffix tree indexing
»
Geometric Suffix Tree A New Index Structure for Protein 3D Structures
»
Efficient sparse selfsimilarity matrix construction for repeating sequence detection
more »
Post Info
More Details (n/a)
Added
05 Dec 2009
Updated
05 Dec 2009
Type
Conference
Year
2005
Where
VLDB
Authors
Yuanyuan Tian, Sandeep Tata, Richard A. Hankins, Jignesh M. Patel
Comments
(0)
Researcher Info
Database Study Group
Computer Vision