Forbidden patterns

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

doi:10.1007/978-3-642-29344-3_28

Forbidden patterns

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

Department of Computer Science

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	LATIN 2012
Subtitle of host publication	Theoretical Informatics - 10th Latin American Symposium, Proceedings
Pages	327-337
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-642-29344-3_28
State	Published - 2012
Event	10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 - Arequipa, Peru Duration: 16 Apr 2012 → 20 Apr 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7256 LNCS

Conference

Conference	10th Latin American Symposiumon Theoretical Informatics, LATIN 2012
Country/Territory	Peru
City	Arequipa
Period	16/04/12 → 20/04/12

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-29344-3_28

Cite this

Fischer, J., Gagie, T., Kopelowitz, T., Lewenstein, M., Mäkinen, V., Salmela, L., & Välimäki, N. (2012). Forbidden patterns. In LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings (pp. 327-337). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7256 LNCS). https://doi.org/10.1007/978-3-642-29344-3_28

@inproceedings{91141b0780ee44359149f9b6916dcaac,

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",

}

Fischer, J, Gagie, T, Kopelowitz, T , Lewenstein, M, Mäkinen, V, Salmela, L & Välimäki, N 2012, Forbidden patterns. in LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7256 LNCS, pp. 327-337, 10th Latin American Symposiumon Theoretical Informatics, LATIN 2012, Arequipa, Peru, 16/04/12. https://doi.org/10.1007/978-3-642-29344-3_28

Forbidden patterns. / Fischer, Johannes; Gagie, Travis; Kopelowitz, Tsvi et al.
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings. 2012. p. 327-337 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7256 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Forbidden patterns

AU - Fischer, Johannes

AU - Gagie, Travis

AU - Kopelowitz, Tsvi

AU - Lewenstein, Moshe

AU - Mäkinen, Veli

AU - Salmela, Leena

AU - Välimäki, Niko

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84860800524&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-29344-3_28

DO - 10.1007/978-3-642-29344-3_28

M3 - منشور من مؤتمر

SN - 9783642293436

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 327

EP - 337

BT - LATIN 2012

T2 - 10th Latin American Symposiumon Theoretical Informatics, LATIN 2012

Y2 - 16 April 2012 through 20 April 2012

ER -

Forbidden patterns

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this