User Index Page for "suffix trees"

(Articles 1-2 of 2)
Bookmark and Share
My Articles  |  Articles I Maybe Interested In  |  My Clusters  |  New User? Sign Up  |  Sign In
Custom Search

Suffix tree

... In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations. ... [full article] (23 views)
This bookmark is tagged as: suffix trees | tree data structures | data structures | string search
Thank you mf for bookmarking this article!

Suffix Trees

... A Suffix Tree is a data-structure that allows many problems on strings (sequences of characters) to be solved quickly. If txt=t1t2...ti...tn is a string, then Ti=titi+1...tn is the suffix of txt that starts at position i, e.g. ... [full article] (12 views)
This bookmark is tagged as: suffix trees | trie | proximity searching | regular expression searching
Thank you mf for bookmarking this article!

New to WEBYAM...

  • With WEBYAM you can carry your bookmarks wherever you go
  • With WEBYAM bookmark something that you want the world to know
  • In WEBYAM search for any information and get relevant links posted by real people

What to add?

Any article (it can be news, opinions, reviews ...) on the web that you find good or useful and want to share with everyone. Add the title of the article, few lines (snippet) from the article, and the article's URL.  add now  more help...

Follow webyam on...

What is Cluster?

Cluster is the best way to organize your web. Give a title, a short description and select the tags you want to track in that cluster and your own cluster will be ready to use.  create now  more help...