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

Authors:
Inbok Lee;Sung-Ryul Kim
Affiliations:
Department of Computer Science, King’s College London, London, United Kingdom;Division of Internet & Media and CAESIT, Konkuk University, Seoul, Republic of Korea
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Year:
2006

Citing 4
Cited 0

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A fast algorithm for the generalized k-keyword proximity problem given keyword offsets

Information Processing Letters
Linear-time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Linear time algorithm for the generalised longest common repeat problem

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

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.