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

DOI10.1016/J.IPL.2004.03.017zbMATH Open1178.68185OpenAlexW2044909990MaRDI QIDQ2390293FDOQ2390293

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

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

zbMATH Keywords

combinatorial problemsdesign of algorithmsstring algorithms

Mathematics Subject Classification ID

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

Cites Work

• An algorithm for string matching with a sequence of don't cares
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)