Parikh matching in the streaming model

Lap Kei Lee; Moshe Lewenstein; Qin Zhang

doi:10.1007/978-3-642-34109-0_35

Parikh matching in the streaming model

Lap Kei Lee, Moshe Lewenstein, Qin Zhang

Department of Computer Science

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

11 Scopus citations

Abstract

Let S be a string over an alphabet Σ∈=∈{σ ₁, σ ₂, A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σ _i in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we present upper and lower bounds on the problem of approximate Parikh matching in the streaming model.

Original language	English
Title of host publication	String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings
Publisher	Springer Verlag
Pages	336-341
Number of pages	6
ISBN (Print)	9783642341083
DOIs	https://doi.org/10.1007/978-3-642-34109-0_35
State	Published - 2012
Event	19th International Symposium on String Processing and Information Retrieval, SPIRE 2012 - Cartagena de Indias, Colombia Duration: 21 Oct 2012 → 25 Oct 2012

Publication series

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

Conference

Conference	19th International Symposium on String Processing and Information Retrieval, SPIRE 2012
Country/Territory	Colombia
City	Cartagena de Indias
Period	21/10/12 → 25/10/12

Access to Document

10.1007/978-3-642-34109-0_35

Cite this

Lee, L. K., Lewenstein, M., & Zhang, Q. (2012). Parikh matching in the streaming model. In String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings (pp. 336-341). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7608 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_35

@inproceedings{6ea967dcef1f40f9aab39ac5e734c9ab,

title = "Parikh matching in the streaming model",

abstract = "Let S be a string over an alphabet Σ∈=∈{σ 1, σ 2, A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σ i in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we present upper and lower bounds on the problem of approximate Parikh matching in the streaming model.",

author = "Lee, {Lap Kei} and Moshe Lewenstein and Qin Zhang",

year = "2012",

doi = "10.1007/978-3-642-34109-0_35",

language = "אנגלית",

isbn = "9783642341083",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "336--341",

booktitle = "String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings",

address = "גרמניה",

note = "19th International Symposium on String Processing and Information Retrieval, SPIRE 2012 ; Conference date: 21-10-2012 Through 25-10-2012",

}

Lee, LK, Lewenstein, M & Zhang, Q 2012, Parikh matching in the streaming model. in String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7608 LNCS, Springer Verlag, pp. 336-341, 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, Cartagena de Indias, Colombia, 21/10/12. https://doi.org/10.1007/978-3-642-34109-0_35

Parikh matching in the streaming model. / Lee, Lap Kei; Lewenstein, Moshe; Zhang, Qin.
String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Springer Verlag, 2012. p. 336-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7608 LNCS).

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

TY - GEN

T1 - Parikh matching in the streaming model

AU - Lee, Lap Kei

AU - Lewenstein, Moshe

AU - Zhang, Qin

PY - 2012

Y1 - 2012

N2 - Let S be a string over an alphabet Σ∈=∈{σ 1, σ 2, A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σ i in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we present upper and lower bounds on the problem of approximate Parikh matching in the streaming model.

AB - Let S be a string over an alphabet Σ∈=∈{σ 1, σ 2, A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σ i in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we present upper and lower bounds on the problem of approximate Parikh matching in the streaming model.

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

U2 - 10.1007/978-3-642-34109-0_35

DO - 10.1007/978-3-642-34109-0_35

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84867550298

SN - 9783642341083

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

SP - 336

EP - 341

BT - String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings

PB - Springer Verlag

T2 - 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012

Y2 - 21 October 2012 through 25 October 2012

ER -

Lee LK, Lewenstein M, Zhang Q. Parikh matching in the streaming model. In String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Springer Verlag. 2012. p. 336-341. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-34109-0_35

Parikh matching in the streaming model

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this