An improved data structure for left-right maximal generic words problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For a set D of documents and a positive integer d, a string w is said to be d-left-right maximal, if (1) w occurs in at least d documents in D, and (2) any proper superstring of w occurs in less than d documents. The left-right-maximal generic words problem is, given a set D of documents, to preprocess D so that for any string p and for any positive integer d, all the superstrings of p that are d-left-right maximal can be answered quickly. In this paper, we present an O(n log m) space data structure (in words) which answers queries in O(|p| + o log log m) time, where n is the total length of documents in D, m is the number of documents in D and o is the number of outputs. Our solution improves the previous one by Nishimoto et al. (PSC 2015), which uses an O(n log n) space data structure answering queries in O(|p| + r · log n + o · log2 n) time, where r is the number of right-extensions q of p occurring in at least d documents such that any proper right extension of q occurs in less than d documents.

Original languageEnglish
Title of host publication30th International Symposium on Algorithms and Computation, ISAAC 2019
EditorsPinyan Lu, Guochuan Zhang
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771306
DOIs
Publication statusPublished - Dec 2019
Event30th International Symposium on Algorithms and Computation, ISAAC 2019 - Shanghai, China
Duration: Dec 8 2019Dec 11 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume149
ISSN (Print)1868-8969

Conference

Conference30th International Symposium on Algorithms and Computation, ISAAC 2019
CountryChina
CityShanghai
Period12/8/1912/11/19

Fingerprint

Data structures

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). An improved data structure for left-right maximal generic words problem. In P. Lu, & G. Zhang (Eds.), 30th International Symposium on Algorithms and Computation, ISAAC 2019 [40] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 149). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2019.40

An improved data structure for left-right maximal generic words problem. / Fujishige, Yuta; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

30th International Symposium on Algorithms and Computation, ISAAC 2019. ed. / Pinyan Lu; Guochuan Zhang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 40 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 149).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fujishige, Y, Nakashima, Y, Inenaga, S, Bannai, H & Takeda, M 2019, An improved data structure for left-right maximal generic words problem. in P Lu & G Zhang (eds), 30th International Symposium on Algorithms and Computation, ISAAC 2019., 40, Leibniz International Proceedings in Informatics, LIPIcs, vol. 149, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30th International Symposium on Algorithms and Computation, ISAAC 2019, Shanghai, China, 12/8/19. https://doi.org/10.4230/LIPIcs.ISAAC.2019.40
Fujishige Y, Nakashima Y, Inenaga S, Bannai H, Takeda M. An improved data structure for left-right maximal generic words problem. In Lu P, Zhang G, editors, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 40. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.ISAAC.2019.40
Fujishige, Yuta ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / An improved data structure for left-right maximal generic words problem. 30th International Symposium on Algorithms and Computation, ISAAC 2019. editor / Pinyan Lu ; Guochuan Zhang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{1d6862d3c8aa47ad91797eacfb6b6e54,
title = "An improved data structure for left-right maximal generic words problem",
abstract = "For a set D of documents and a positive integer d, a string w is said to be d-left-right maximal, if (1) w occurs in at least d documents in D, and (2) any proper superstring of w occurs in less than d documents. The left-right-maximal generic words problem is, given a set D of documents, to preprocess D so that for any string p and for any positive integer d, all the superstrings of p that are d-left-right maximal can be answered quickly. In this paper, we present an O(n log m) space data structure (in words) which answers queries in O(|p| + o log log m) time, where n is the total length of documents in D, m is the number of documents in D and o is the number of outputs. Our solution improves the previous one by Nishimoto et al. (PSC 2015), which uses an O(n log n) space data structure answering queries in O(|p| + r · log n + o · log2 n) time, where r is the number of right-extensions q of p occurring in at least d documents such that any proper right extension of q occurs in less than d documents.",
author = "Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2019",
month = "12",
doi = "10.4230/LIPIcs.ISAAC.2019.40",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Pinyan Lu and Guochuan Zhang",
booktitle = "30th International Symposium on Algorithms and Computation, ISAAC 2019",

}

TY - GEN

T1 - An improved data structure for left-right maximal generic words problem

AU - Fujishige, Yuta

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2019/12

Y1 - 2019/12

N2 - For a set D of documents and a positive integer d, a string w is said to be d-left-right maximal, if (1) w occurs in at least d documents in D, and (2) any proper superstring of w occurs in less than d documents. The left-right-maximal generic words problem is, given a set D of documents, to preprocess D so that for any string p and for any positive integer d, all the superstrings of p that are d-left-right maximal can be answered quickly. In this paper, we present an O(n log m) space data structure (in words) which answers queries in O(|p| + o log log m) time, where n is the total length of documents in D, m is the number of documents in D and o is the number of outputs. Our solution improves the previous one by Nishimoto et al. (PSC 2015), which uses an O(n log n) space data structure answering queries in O(|p| + r · log n + o · log2 n) time, where r is the number of right-extensions q of p occurring in at least d documents such that any proper right extension of q occurs in less than d documents.

AB - For a set D of documents and a positive integer d, a string w is said to be d-left-right maximal, if (1) w occurs in at least d documents in D, and (2) any proper superstring of w occurs in less than d documents. The left-right-maximal generic words problem is, given a set D of documents, to preprocess D so that for any string p and for any positive integer d, all the superstrings of p that are d-left-right maximal can be answered quickly. In this paper, we present an O(n log m) space data structure (in words) which answers queries in O(|p| + o log log m) time, where n is the total length of documents in D, m is the number of documents in D and o is the number of outputs. Our solution improves the previous one by Nishimoto et al. (PSC 2015), which uses an O(n log n) space data structure answering queries in O(|p| + r · log n + o · log2 n) time, where r is the number of right-extensions q of p occurring in at least d documents such that any proper right extension of q occurs in less than d documents.

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

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

U2 - 10.4230/LIPIcs.ISAAC.2019.40

DO - 10.4230/LIPIcs.ISAAC.2019.40

M3 - Conference contribution

AN - SCOPUS:85076353657

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 30th International Symposium on Algorithms and Computation, ISAAC 2019

A2 - Lu, Pinyan

A2 - Zhang, Guochuan

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -