Which of the following algorithm of data compression uses a suffix tree?

Category: QuestionsWhich of the following algorithm of data compression uses a suffix tree?
Editor">Editor Staff asked 5 months ago

Which of the following algorithm of data compression uses a suffix tree?

(a) Weiner’s algorithm

(b) Farach’s algorithm

(c) Lempel – Ziv – Welch’s algorithm

(d) Alexander Morse’s algorithm

The question is from Suffix tree topic in chapter Trie of Data Structures & Algorithms I

The question was asked during an interview.

Editor">Editor Staff answered 5 months ago

The correct option is (c) Lempel – Ziv – Welch’s algorithm

The best explanation: 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. Lempel – Ziv – Welch’s algorithm of data compression uses a suffix tree.

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: 40702