Consecutive occurrences with distance constraints

DOI10.1007/978-3-031-52213-0_1MaRDI QIDQ6547814

Waseem Akram, Sanjeev Saxena

Publication date: 31 May 2024

zbMATH Keywords

algorithmsdata structurespattern matchingsegment intersection

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Reporting consecutive substring occurrences under bounded gap constraints
• An almost optimal algorithm for unbounded searching
• A data structure for dynamic trees
• On-line construction of suffix trees
• String indexing for top-\(k\) close consecutive occurrences
• Succinct non-overlapping indexing
• Gapped indexing for consecutive occurrences
• Range Non-overlapping Indexing
• Filtering Search: A New Approach to Query-Answering
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Consecutive occurrences with distance constraints

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