+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.