@inproceedings{ca72fca46dee4800bfd3034c2ae5f7fd,
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 = "https://doi.org/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",
}