Improved approximate pattern matching on hypertext

DOI10.1016/S0304-3975(99)00333-3zbMath0943.68181OpenAlexW2169603381MaRDI QIDQ1566744

Gonzalo Navarro

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00333-3

zbMATH Keywords

graph algorithmsapproximate structure matching

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (9)

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended ⋮ The complexity of approximate pattern matching on de Bruijn graphs ⋮ On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Sequence to graph alignment using gap-sensitive co-linear chaining ⋮ On the Complexity of String Matching for Graphs ⋮ Quantum time complexity and algorithms for pattern matching on labeled graphs ⋮ Unnamed Item ⋮ Parameterized matching on non-linear structures ⋮ On the complexity of approximately matching a string to a directed graph

Cites Work

• Fast string matching with k differences
• A subquadratic algorithm for approximate limited expression matching
• Finding approximate patterns in strings
• The theory and computation of evolutionary distances: Pattern recognition
• New and faster filters for multiple approximate string matching
• Pattern Matching in Hypertext

This page was built for publication: Improved approximate pattern matching on hypertext