Reporting consecutive substring occurrences under bounded gap constraints

DOI10.1016/j.tcs.2016.02.005zbMath1344.68061OpenAlexW2254112209MaRDI QIDQ294948

Sharma V. Thankachan, Gonzalo Navarro

Publication date: 16 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.005

zbMATH Keywords

pattern matchingsuffix treesgeometric data structuresheavy-path decomposition

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (2)

String indexing for top-\(k\) close consecutive occurrences ⋮ Gapped indexing for consecutive occurrences

Cites Work

• Unnamed Item
• Unnamed Item
• Substring range reporting
• A data structure for dynamic trees
• String indexing for patterns with wildcards
• Indexing factors with gaps
• Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
• Range Non-overlapping Indexing and Successive List Indexing
• Optimal static range reporting in one dimension

This page was built for publication: Reporting consecutive substring occurrences under bounded gap constraints