Sciweavers

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

62

Voted

FOCS
1997
IEEE

favoriteEmaildiscussreport

84views Theoretical Computer Science» more FOCS 1997»

Optimal Suffix Tree Construction with Large Alphabets

15 years 1 months ago

Optimal Suffix Tree Construction with Large Alphabets

Download www.cs.rutgers.edu

Martin Farach

Real-time Traffic

FOCS 1997 | Theoretical Computer Science |

claim paper

Related Content

» Suffix Arrays A New Method for OnLine String Searches

» InPlace Suffix Sorting

» Reconstructing a Suffix Array

» Suffix Trees on Words

» Suffix trees for very large genomic sequences

» Engineering a Fast Online Persistent Suffix Tree Construction

» Faster suffix tree construction with missing suffix links

» Linear work suffix array construction

» Optimal Integer Alphabetic Trees in Linear Time

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	FOCS
Authors	Martin Farach

Comments (0)