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.
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.