### 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 log^{2} n + rocc log n) time where occ is the number of left-right-maximal extensions of P.

Original language | English |
---|---|

Title of host publication | Proceedings of the Prague Stringology Conference 2015, PSC 2015 |

Editors | Jan Zd'arek, Jan Holub |

Publisher | Prague Stringology Club |

Pages | 5-16 |

Number of pages | 12 |

ISBN (Electronic) | 9788001057872 |

Publication status | Published - Jan 1 2015 |

Event | 19th Prague Stringology Conference, PSC 2015 - Prague, Czech Republic Duration: Aug 24 2015 → Aug 26 2015 |

### Publication series

Name | Proceedings of the Prague Stringology Conference 2015, PSC 2015 |
---|

### Other

Other | 19th Prague Stringology Conference, PSC 2015 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 8/24/15 → 8/26/15 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

### Cite this

*Proceedings of the Prague Stringology Conference 2015, PSC 2015*(pp. 5-16). (Proceedings of the Prague Stringology Conference 2015, PSC 2015). Prague Stringology Club.