Koshiro Kumagai

Inferring Strings from Position Heaps in Linear Time

2022 · arXiv (Cornell University)

Position heaps are index structures of text strings used for the string matching problem. They are rooted trees whose edges and nodes are labeled and numbered, respectively. This paper is concerned with variants of the …