Online Approximate Matching with Non-local Distances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5577 LNCS, Issue , 2009, Pages 142-153

  Clifford, Raphaël ^a   Sach, Benjamin ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; BLACK BOX METHOD; DISTANCE FUNCTIONS; LOG FACTORS; MATCHING PROBLEMS; NONLOCAL; OFFLINE; ON-LINE ALGORITHMS; RUNNING TIME; SUBSTRING; WORST CASE;

PHASE MODULATION;

PATTERN MATCHING;

EID: 70350630103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02441-2_13     Document Type: Conference Paper

References (12)

1. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1221-1229 (2006)
2. Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 118-129. Springer, Heidelberg (2008)
3. Amir, A., Aumann, Y., Lewenstein, M., Porat, E.: Function matching. SIAM Journal on Computing 35(5), 1007-1022 (2006)
4. Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Inf. Comput. 181(1), 57-74 (2003)
5. Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorith-mica 45(1), 109-120 (2006)
6. Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Inf. Process. Lett. 49(3), 111-115 (1994)
7. Clifford, P., Clifford, R.: Self-normalised distance with don't cares. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 63-70. Springer, Heidelberg (2007)
8. Clifford, R., Efremenko, K., Porat, B., Porat, E.: A black box for online approximate pattern matching. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 143-151. Springer, Heidelberg (2008)
9. Galil, Z.: String matching in real time. Journal of the ACM 28(1), 134-149 (1981)
10. Landau, G.M., Vishkin, U.: Fast string matching with k differences. J. Comput. Syst. Sci. 37(1), 63-78 (1988)
11. Levenshtein, I.V.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory (1966)
12. Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18-31 (1980)