Everything is an abstraction

Open Source | Comp Sci

Main menu

Skip to content
  • Home
  • About Me
  • My Code
  • Feedback

Category Archives: String Algorithms

Post navigation

Jan 31 2012

Suffix Trees

A start to my series on string algorithms.

Suffix Trees Part I : Intro, Tries

http://varrunr.tumblr.com/post/16110623428/suffix-trees-part-i-intro-tries

Suffix Trees Part II: Substring search

http://varrunr.tumblr.com/post/16128034284/stree-part-2

Coming Soon….. Space Efficient Suffix Trees , Z Algorithm

By Varrun • Posted in Algorithms, String Algorithms • Tagged algorithms, data structure, string algorithms, suffix tree, trie
0

Post navigation

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 223 other followers

Categories

  • Academics
    • TOC
  • Algorithms
    • String Algorithms
  • Events
    • FOSSTER '09
  • General
    • India
    • Mindscape
  • GNU/Linux
    • Cool Linux stuff
    • Fedora
    • Open Solaris
    • Unix Commands
    • Virtualization
  • gsoc
  • Security
  • Technology
  • Web Dev
    • J2EE
      • Struts

My tweets

  • @pprahul Congrats!! See you here in SFO! 3 days ago
  • RT @nikcub: Yahoo included their cert private key inside the Axis Chrome extension.. (means anybody can sign extension as yahoo).. http: ... 3 days ago
  • UEFA. Bayern had the upper hand. Chelsea had the spirit. Respect to Drogba. 1 week ago
  • "We humans are not very good at identifying the heuristics we ourselves use" - John McCarthy 1 week ago
  • Gosh! This apartment is totally rad! Its more like a hotel! 1 week ago
Follow @varrunr

My latest rantings :-)

  • Indenting lines in vim
  • Suffix Trees
  • My new tumblr
  • A Hack of the IT Act – Sections 65 and 66
  • Editing multiple files in Vim

Blog Stats

  • 17,552 visits
Blog at WordPress.com. | Theme: iTheme2 by Themify.