Pattern Matching in Hypertext

DOI10.1006/JAGM.1999.1063MaRDI QIDQ4953246zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Noa Lewenstein, Moshe Lewenstein

Publication date 4 October 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c9a3cd8784626b5e172784c603814a86ba8f27e3

zbMATH Keywords

Internethypertext

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Pattern matching in hypertext
• Hypertext searching -- a survey
• Improved approximate pattern matching on hypertext
• Indexing hypertext

Cited in

(25)

• String Powers in Trees
• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• String powers in trees
• On the Complexity of String Matching for Graphs
• Parameterized matching on non-linear structures
• Algorithms and complexity on indexing founder graphs
• Improved approximate pattern matching on hypertext
• Computing the edit distance of a regular language
• Indexing hypertext
• Complexity results and algorithms for representing paths in digraphs
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Elastic-degenerate string matching with 1 error or mismatch
• The complexity of approximate pattern matching on de Bruijn graphs
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Fast pattern matching with epsilon transitions
• Hypertext searching -- a survey
• A probabilistic approach to navigation in Hypertext
• A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
• Quantum time complexity and algorithms for pattern matching on labeled graphs
• scientific article; zbMATH DE number 1445383 (Why is no real title available?)
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
• On the complexity of approximately matching a string to a directed graph
• Solving string problems on graphs using the labeled direct product
• Pattern matching in hypertext
• scientific article; zbMATH DE number 7561548 (Why is no real title available?)

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