An Improved Algorithm for Approximate String Matching

Zvi Galil,Kunsoo Park

Lecture Notes in Computer Science（2005）

Columbia University

被引用156|浏览4

摘要

Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.

更多

查看译文

关键词

String Matching,Pattern Matching,Approximate Matching,Regular Expression Matching,Text Indexing