### Abstract

Two strings of equal length are said to parameterized match if there is a bijection that maps the characters of one string to those of the other string, so that two strings become identical. The parameterized pattern matching problem is, given two strings T and P, to find the occurrences of substrings in T that parameterized match P. Diptarama et al. [Position Heaps for Parameterized Strings, CPM 2017] proposed an indexing data structure called parameterized position heaps, and gave a left-toright online construction algorithm. In this paper, we present a right-to-left online construction algorithm for parameterized position heaps. For a text string T of length n over two kinds of alphabets Σand II of respective size σ and π, our construction algorithm runs in O(n log(σ+π)) time with O(n) space. Our right-to-left parameterized position heaps support pattern matching queries in O(mlog(σ+π)+mπ+pocc)) time, where m is the length of a query pattern P and pocc is the number of occurrences to report. Our construction and pattern matching algorithms are as efficient as Diptarama et al.'s algorithms.

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

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

Editors | Jan Holub, Jan Zdarek |

Publisher | Prague Stringology Club |

Pages | 91-102 |

Number of pages | 12 |

ISBN (Electronic) | 9788001064849 |

Publication status | Published - 2018 |

Event | 22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic Duration: Aug 27 2018 → Aug 28 2018 |

### Publication series

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

### Conference

Conference | 22nd Prague Stringology Conference, PSC 2018 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 8/27/18 → 8/28/18 |

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Right-to-left online construction of parameterized position heaps'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the Prague Stringology Conference, PSC 2018*(pp. 91-102). (Proceedings of the Prague Stringology Conference, PSC 2018). Prague Stringology Club.