LAUSR

Text Indexing for Faster Gapped Pattern Matching

Sign Up to like & get
recommendations!
0 Published in 2024 at "Algorithms"

DOI: 10.3390/a17120537

Abstract: We revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text T[1..n] to enable efficient reporting of all occ occurrences of a gapped pattern P=P1[α..β]P2 in T.… read more here.

Keywords: text indexing; time; space; query time ... See more keywords