algorithm - Lowest Internal Node - Suffix Trees -


finding lowest internal node in case of suffix trees used in many applications. example, lowest common internal node of strings in generalized suffix tree give longest common substring.

but not think of way lowest internal node in method better o(n*k) n = number of keys , k= average length of keys. there easier way keep track of node ?

http://en.wikipedia.org/wiki/longest_common_substring_problem#suffix_tree says o(n*k) indeed best can normal suffix tree. can preprocessed in way makes answering question easier. leads http://en.wikipedia.org/wiki/lowest_common_ancestor has multiple links external algorithms.

i suggest starting there.


Comments

Popular posts from this blog

linux - Using a Cron Job to check if my mod_wsgi / apache server is running and restart -

actionscript 3 - TweenLite does not work with object -

jQuery Ajax Render Fragments OR Whole Page -