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

Who among the following algorithm is used in external memory and compression of the suffix tree? Correct Answer Farach’s algorithm

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

Related Questions

Which of the following algorithm of data compression uses a suffix tree?
Suffix array can be created by performing __________ traversal of a suffix tree.
A tree is cut partially and made to fall on ground. The tree however does not fall completely and is still attached to its cut part. The tree top touches the ground at a point 10m from foot of the tree making an angle of 30°. What is the length of the tree?