Computing left-right maximal generic words

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

1 Citation (Scopus)

Abstract

The maximal generic words problem was proposed by Kucherov et al. (SPIRE 2012). Let D be a set of documents. In this problem, given a pattern P and a threshold δ ≤ |D|, we want to compute all right-maximal extensions of P which occur in at least δ distinct documents. They proposed an O(n)-space data structure which can solve this problem in O(|P| + rocc) time where n is the total length of documents in D and rocc is the number of right-maximal extensions of P. The data structure can be constructed in O(n) time. In this paper, we propose a more generalized problem. Given a pattern P and a threshold δ ≤ |D|, we want to compute all left-right-maximal extensions of P which occur in at least δ distinct documents. We propose an O(n log n)- space data structure which can solve this problem in O(|P| + occ log2 n + rocc log n) time where occ is the number of left-right-maximal extensions of P.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2015, PSC 2015
EditorsJan Zd'arek, Jan Holub
PublisherPrague Stringology Club
Pages5-16
Number of pages12
ISBN (Electronic)9788001057872
Publication statusPublished - Jan 1 2015
Event19th Prague Stringology Conference, PSC 2015 - Prague, Czech Republic
Duration: Aug 24 2015Aug 26 2015

Publication series

NameProceedings of the Prague Stringology Conference 2015, PSC 2015

Other

Other19th Prague Stringology Conference, PSC 2015
CountryCzech Republic
CityPrague
Period8/24/158/26/15

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

Nishimoto, T., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2015). Computing left-right maximal generic words. In J. Zd'arek, & J. Holub (Eds.), Proceedings of the Prague Stringology Conference 2015, PSC 2015 (pp. 5-16). (Proceedings of the Prague Stringology Conference 2015, PSC 2015). Prague Stringology Club.