We consider several types of internal queries: questions about subwords of a text. As the main tool we develop an optimal data structure for the problem called here internal pattern matching. This data structure provides constant-time answers to queries about occurrences of one subword x in another ...
Highlights, strengths & weaknesses, commercial applications, and societal impact — written for this paper on demand.
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!