Problem
Research questions and friction points this paper is trying to address.
tunnelling
reference
repetitive text
auxiliary data structures
Tunnelling with a reference
๐ค AI Summary
ๆฌๆ่งฃๅณไบๅจๆ็ญๅ่ๆๆฌๆ
ๅตไธ๏ผๅฆไฝๅ ้้ฟ้ๅคๆๆฌ็ๅๅๆ็ดข้ฎ้ข๏ผ้่ฟไฝฟ็จ่พๅฐ็่พ
ๅฉๆฐๆฎ็ปๆๅๆน่ฟBaier็้ง้ๆๆฏใ
๐ Abstract
We show how to modify Baier's tunnelling for the case in which we have a non-repetitive and relatively short reference for a highly repetitive and much longer text. Given a pattern that mostly matches only one substring of the reference, we can use fairly small auxiliary data structures to speed up backward searching with an r-index for the whole text.
Innovation
Methods, ideas, or system contributions that make the work stand out.
tunnelling
non-repetitive reference
auxiliary data structures
backward searching
๐ Similar Papers
No similar papers found.
