Forbidden patterns

Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations


We consider the problem of indexing a collection of documents (a.k.a. strings) of total length n such that the following kind of queries are supported: given two patterns P + and P -, list all documents containing P + but not P -. This is a natural extension of the classic problem of document listing as considered by Muthukrishnan [SODA'02], where only the positive pattern P + is given. Our main solution is an index of size O(n 3/2) bits that supports queries in O(|P +| + |P -| + n match + √n) time.

Original languageEnglish
Title of host publicationLATIN 2012
Subtitle of host publicationTheoretical Informatics - 10th Latin American Symposium, Proceedings
Number of pages11
StatePublished - 2012
Event10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 - Arequipa, Peru
Duration: 16 Apr 201220 Apr 2012

Publication series

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


Conference10th Latin American Symposiumon Theoretical Informatics, LATIN 2012


Dive into the research topics of 'Forbidden patterns'. Together they form a unique fingerprint.

Cite this