The following pages link to Pattern Matching in Hypertext (Q4953246):
Displayed 14 items.
- Parameterized matching on non-linear structures (Q989510) (← links)
- Improved approximate pattern matching on hypertext (Q1566744) (← links)
- String powers in trees (Q1679231) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- String Powers in Trees (Q2942264) (← links)
- (Q5091210) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
- On the Complexity of String Matching for Graphs (Q6075757) (← links)
- Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)