@inproceedings{7d289a8986f640289dababec09404c9e,
title = "Forbidden patterns",
abstract = "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.",
author = "Johannes Fischer and Travis Gagie and Tsvi Kopelowitz and Moshe Lewenstein and Veli M{\"a}kinen and Leena Salmela and Niko V{\"a}lim{\"a}ki",
year = "2012",
doi = "10.1007/978-3-642-29344-3_28",
language = "אנגלית",
isbn = "9783642293436",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "327--337",
booktitle = "LATIN 2012",
note = "10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 ; Conference date: 16-04-2012 Through 20-04-2012",
}