Improved approximate pattern matching on hypertext
From MaRDI portal
Publication:1566744
DOI10.1016/S0304-3975(99)00333-3zbMath0943.68181MaRDI QIDQ1566744
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
68U15: Computing methodologies for text processing; mathematical typography
Related Items
Parameterized matching on non-linear structures, On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
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