Pseudo-realtime pattern matching: Closing the gap

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

Volumn 6129 LNCS, Issue , 2010, Pages 101-111

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

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LONGEST COMMON EXTENSIONS; OFFLINE; OPTIMAL TIME COMPLEXITY; TIME COMPLEXITY;

ELECTROSTATIC DISCHARGE;

PATTERN MATCHING;

EID: 79956302862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13509-5_10     Document Type: Conference Paper

References (10)

1. Abrahamson, K.R.: Generalized string matching. SIAM J. Comput. 16(6), 1039-1051 (1987).
2. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: SODA 2000, pp. 794-803 (2000). (Pubitemid 30549331)
3. 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).
4. Clifford, R., Sach, B.: Online approximate matching with non-local distances. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 142-153. Springer, Heidelberg (2009).
5. Galil, Z.: String matching in real time. Journal of the ACM 28(1), 134-149 (1981).
6. Kosaraju, S.R.: Efficient string matching (1987) (manuscript).
7. Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557-582 (1998). (Pubitemid 128497670)
8. Landau, G.M., Vishkin, U.: Fast string matching with k differences. J. Comput. Syst. Sci. 37(1), 63-78 (1988).
9. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: SODA 1990, pp. 319-327 (1990).
10. Porat, E., Porat, B.: Exact and approximate pattern matching in the streaming model. In: FOCS 2009, pp. 315-323 (2009).