Pattern matching in hypertext

DOI10.1007/3-540-63307-3_56zbMath1497.68589OpenAlexW1544751140MaRDI QIDQ5096935

Amihood Amir, Noa Lewenstein, Moshe Lewenstein

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_56

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (4)

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ On the Complexity of String Matching for Graphs ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ Order Preserving Pattern Matching on Trees and DAGs

Cites Work

• Dynamic dictionary matching
• Improved dynamic dictionary matching
• A fast string searching algorithm
• Generalized String Matching
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Pattern matching in hypertext