从线性时间中的位置堆推断字符串
Inferring Strings from Position Heaps in Linear Time
摘要:
位置堆是用于字符串匹配问题的文本字符串的索引结构。它们是有根树,其边和节点分别被标记和编号。本文研究了位置堆构造反问题的变形,并给出了线性时间算法。基本的问题是从一个带标记边和编号节点的有根树中恢复一个文本字符串。在变体问题中,输入树可能会丢失我们必须恢复的边标签或节点编号。
英文摘要:
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 inverse problem of position heap construction and gives linear-time algorithms for those problems. The basic problem is to restore a text string from a rooted tree with labeled edges and numbered nodes. In the variant problems, the input trees may miss edge labels or node numbers which we must restore as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。