Pattern Matching in Hypertext
From MaRDI portal
Publication:4953246
DOI10.1006/jagm.1999.1063zbMath0956.68043OpenAlexW2054895735MaRDI QIDQ4953246
Noa Lewenstein, Amihood Amir, 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
Searching and sorting (68P10) Combinatorics on words (68R15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (14)
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended ⋮ Computing the edit distance of a regular language ⋮ The complexity of approximate pattern matching on de Bruijn graphs ⋮ On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ String Powers in Trees ⋮ String powers in trees ⋮ On the Complexity of String Matching for Graphs ⋮ Algorithms and complexity on indexing founder graphs ⋮ Quantum time complexity and algorithms for pattern matching on labeled graphs ⋮ Unnamed Item ⋮ Parameterized matching on non-linear structures ⋮ Improved approximate pattern matching on hypertext ⋮ On the complexity of approximately matching a string to a directed graph ⋮ Solving string problems on graphs using the labeled direct product
This page was built for publication: Pattern Matching in Hypertext
