# Who among the following algorithm is used in external memory and compression of the suffix tree?

Category: QuestionsWho among the following algorithm is used in external memory and compression of the suffix tree?
Editor">Editor Staff asked 5 months ago

Who among the following algorithm is used in external memory and compression of the suffix tree?

(a) Weiner’s algorithm

(b) Farach’s algorithm

(c) Ukkonen’s algorithm

(d) Alexander Morse

Origin of the question is Suffix Tree topic in section Trie of Data Structures & Algorithms I

This question was addressed to me by my college professor while I was bunking the class.

Editor">Editor Staff answered 5 months ago

Right choice is (b) Farach’s algorithm

To explain: The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of the Suffix tree. Farach gave the first suffix tree contribution for all alphabets in 1997. Farach’s algorithm is used in external memory and compression.

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701