Pattern matching in hypertext

DOI10.1007/3-540-63307-3_56MaRDI QIDQ5096935zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Pattern Matching in Hypertext
• Navigation in Hypertext Is Easy Only Sometimes
• Hypertext searching -- a survey
• Improved approximate pattern matching on hypertext
• scientific article; zbMATH DE number 2011852

Cites work

• A fast string searching algorithm
• Dynamic dictionary matching
• Fast parallel and serial approximate string matching
• Fast Pattern Matching in Strings
• Generalized String Matching
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1306892 (Why is no real title available?)
• Improved dynamic dictionary matching

Cited in

(10)

• Improved approximate pattern matching on hypertext
• Indexing hypertext
• Navigation in Hypertext Is Easy Only Sometimes
• scientific article; zbMATH DE number 1445383 (Why is no real title available?)
• Pattern Matching in Hypertext
• Order preserving pattern matching on trees and DAGs
• Hypertext searching -- a survey
• On the Complexity of String Matching for Graphs
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

This page was built for publication: Pattern matching in hypertext

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