Which of the following data clustering algorithm uses suffix tree in search engines?

Category: QuestionsWhich of the following data clustering algorithm uses suffix tree in search engines?
Editor">Editor Staff asked 5 months ago

Which of the following data clustering algorithm uses suffix tree in search engines?
 
(a) Weiner’s algorithm
 
(b) Farach’s algorithm
 
(c) Lempel – Ziv – Welch’s algorithm
 
(d) Suffix Tree Clustering
 
This key question is from Suffix tree in chapter Trie of Data Structures & Algorithms I
 
I had been asked this question in an online quiz.

1 Answers
Editor">Editor Staff answered 5 months ago

Correct option is (d) Suffix Tree Clustering
 
For explanation: The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of Suffix. Farach gave the first suffix tree contribution for all alphabets in 1997. Suffix Tree Clustering is a data clustering algorithm that uses suffix tree in search engines.


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