Approximate dictionary queries

Gerth Stølting Brodal, Leszek Gasieniec

Research output: Chapter in Book/Report/Conference proceedingConference contribution

47 Scopus citations


Given a set of n binary strings of length m each. We consider the problem of answering d-queries. Given a binary query string a of length m, a d-query is to report if there exists a string in the set within Hamming distance α of α. We present a data structure of size O(nm) supporting 1-queries in time O(m) and the reporting of all strings within Hamming distance 1 of α in time O(m). The data structure can be constructed in time O(nm). A slightly modified version of the data structure supports the insertion of new strings in amortized time O(m).

Original languageEnglish (US)
Title of host publicationCombinatorial Pattern Matching - 7th Annual Symposium, CPM 1996, Proceedings
EditorsGene Myers, Dan Hirschberg
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540612580, 9783540612582
StatePublished - 1996
Externally publishedYes
Event7th Annual Symposium on Combinatorial Pattern Matching, CPM 1996 - Laguna Beach, United States
Duration: Jun 10 1996Jun 12 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th Annual Symposium on Combinatorial Pattern Matching, CPM 1996
Country/TerritoryUnited States
CityLaguna Beach

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Approximate dictionary queries'. Together they form a unique fingerprint.

Cite this