Indexing a Dictionary for Subset Matching Queries

DOI10.1007/978-3-642-12476-1_11zbMATH Open1284.68214OpenAlexW1673470401MaRDI QIDQ3558268

Oren Weimann, Gad M. Landau, Dekel Tsur

Publication date: 4 May 2010

Published in: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_11

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (1)

Dictionary matching and indexing with errors and don't cares

Uses Software

• HAPLO

Recommendations

• Title not available (Why is that?) 👍 👎
• Efficient pattern searching over large dictionaries 👍 👎
• Compressing dictionary matching index via sparsification technique 👍 👎
• Dictionary matching and indexing with errors and don't cares 👍 👎
• An Improved Query Time for Succinct Dynamic Dictionary Matching 👍 👎
• String Processing and Information Retrieval 👍 👎
• Indexing methods for approximate dictionary searching 👍 👎

This page was built for publication: Indexing a Dictionary for Subset Matching Queries

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