ACM

Communications of the ACM

Home/Magazine Archive/April 2016 (Vol. 59, No. 4)/40 Years of Suffix Trees/Abstract

Review articles

40 Years of Suffix Trees

By Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
Communications of the ACM, April 2016, Vol. 59 No. 4, Pages 66-73
10.1145/2810036
Comments

View as: Print Mobile App ACM Digital Library In the Digital Edition Share:

40 Years of Suffix Trees, illustration — Credit: Papuchalka

When William Legrand finally decrypted the string, it did not seem to make much more sense than it did before.

Key Insights

53‡‡‡305))6*,48264‡.)4z);806",48†8P60))85;1‡ (;:‡*8†83(88)5*†,46(;88*96*?;8)* ‡ (;485);5*†2:* ‡ (;4956*2(5*Ñ4)8P8*;4069285);)6‡8)4‡‡;1(‡9;48081;8: 8‡1;4885;4)485†528806*81(‡9;48;(88;4(‡?34; 48)4‡;161;:188; ‡?;

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.