Inferring Strings from Position Heaps in Linear Time

Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka +1

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 p…