An algorithm for the generalized k-keyword proximity problem and finding longest repetitive substring in a set of strings

Abstract

The data grid may consist of huge number of documents and the number of documents which contain the keywords in the query may be very large. Therefore, we need some method to measure the relevance of the documents to the query. In this paper we propose algorithms for computing k-keyword proximity score [3] in more realistic environments. Furthermore, we show that they can be used to find longest repetitive substring with constraints in a set of strings. © Springer-Verlag Berlin Heidelberg 2006.