Reporting consecutive substring occurrences under bounded gap constraints

DOI10.1016/J.TCS.2016.02.005zbMATH Open1344.68061OpenAlexW2254112209MaRDI QIDQ294948FDOQ294948

Authors: Gonzalo Navarro, Sharma V. Thankachan 

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

Recommendations

• Reporting consecutive substring occurrences under bounded gap constraints
• Substring Range Reporting
• Substring range reporting
• scientific article; zbMATH DE number 2185638
• Range Non-overlapping Indexing and Successive List Indexing

zbMATH Keywords

pattern matchingsuffix treesgeometric data structuresheavy-path decomposition

Mathematics Subject Classification ID

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

Cites Work

• A data structure for dynamic trees
• Title not available (Why is that?)
• Indexing factors with gaps
• Optimal static range reporting in one dimension
• Persistent predecessor search and orthogonal point location on the word RAM
• Title not available (Why is that?)
• Range Non-overlapping Indexing and Successive List Indexing
• Substring range reporting

Cited In (7)

• Searching of Gapped Repeats and Subrepetitions in a Word
• String indexing for top-\(k\) close consecutive occurrences
• Gapped indexing for consecutive occurrences
• Gapped indexing for consecutive occurrences
• Reporting consecutive substring occurrences under bounded gap constraints
• Substring Range Reporting
• Consecutive occurrences with distance constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294948)