A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets

DOI10.1016/J.IPL.2004.03.017MaRDI QIDQ2390293zbMATHOpenAlexFDO

Authors Sung-Ryul Kim, Inbok Lee, Kunsoo Park

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.03.017

zbMATH Keywords

combinatorial problemsdesign of algorithmsstring algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Internet topics (68M11)

Recommendations

• Top-\(k\) term-proximity in succinct space
• Top-\(k\) term-proximity in succinct space
• Top-\(k\) ranked document search in general text databases
• scientific article; zbMATH DE number 1975030
• Top-\(k\) document retrieval in optimal time and linear space

Cites work

• scientific article; zbMATH DE number 1303610 (Why is no real title available?)
• An algorithm for string matching with a sequence of don't cares

Cited in

(1)

• scientific article; zbMATH DE number 1975030 (Why is no real title available?)

This page was built for publication: A fast algorithm for the generalizedk-keyword proximity problem given keyword offsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390293)