Pattern matching in pseudo real-time

Amir, 2009, Pattern matching with address errors: Rearrangement distances, J. Comput. Syst. Sci., 75, 359, 10.1016/j.jcss.2009.03.001 Amir, 2006, Function matching, SIAM J. Comput., 35, 1007, 10.1137/S0097539702424496 Amir, 2003, Overlap matching, Inf. Comput., 181, 57, 10.1016/S0890-5401(02)00035-4 Amir, 2006, Swap and mismatch edit distance, Algorithmica, 45, 109, 10.1007/s00453-005-1192-8 Amir, 1994, Alphabet dependence in parameterized matching, Inf. Process. Lett., 49, 111, 10.1016/0020-0190(94)90086-8 Peter Clifford, Raphaël Clifford, Self-normalised distance with don't cares, in: CPM '07, 2007, pp. 63–70. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, A black box for online approximate pattern matching, in: CPM '08, 2008, pp. 143–151. Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson, A sub-quadratic sequence alignment algorithm for unrestricted cost matrices, in: SODA '02, 2002, pp. 679–688. Fischer, 1973, Fast on-line integer multiplication, 67 Galil, 1981, String matching in real time, J. ACM, 28, 134, 10.1145/322234.322244 Knuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 323, 10.1137/0206024 Landau, 1998, Incremental string comparison, SIAM J. Comput., 27, 557, 10.1137/S0097539794264810 Landau, 1988, Fast string matching with k differences, J. Comput. Syst. Sci., 37, 63, 10.1016/0022-0000(88)90045-1 Levenshtein, 1966, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Phys. Dokl., 10 Udi Manber, Gene Myers, Suffix arrays: a new method for on-line string searches, in: SODA '90, 1990, pp. 319–327. Ukkonen, 1985, Algorithms for approximate string matching, Inf. Control, 64, 100, 10.1016/S0019-9958(85)80046-2