The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

1.1.3 Suffix Trees and Arrays 1.1.3 Suffix Trees and Arrays INPUT OUTPUT Implementations ● Stony Brook Project Implementations (C++) (rating 6) ● Handbook of Algorithms and Data Structures (Pascal) (rating 2) Related Problems ● Longest Common Substring ● Shortest Common Superstring ● String Matching Go to the corresponding chapter in the book About the Book file:///E|/WEBSITE/FILES/SUFFREES.HTM (1 of 2) [19/1/2003 1:35:39]

1.1.3 Suffix Trees and Arrays Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES/SUFFREES.HTM (2 of 2) [19/1/2003 1:35:39]

1.1.3 Suffix Trees and Arrays<br />

1.1.3 Suffix Trees and Arrays<br />

INPUT OUTPUT<br />

Implementations<br />

● Stony Brook Project Implementations (C++) (rating 6)<br />

● Handbook of <strong>Algorithm</strong>s and Data Structures (Pascal) (rating 2)<br />

Related Problems<br />

● Longest Common Substring<br />

● Shortest Common Superstring<br />

● String Matching<br />

Go to the corresponding chapter in the book<br />

About the Book<br />

file:///E|/WEBSITE/FILES/SUFFREES.HTM (1 of 2) [19/1/2003 1:35:39]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!