Towards approximate matching in compressed strings: Local subsequence recognition

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

Volumn 6651 LNCS, Issue , 2011, Pages 401-414

  Tiskin, Alexander ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; COMPRESSION MODEL; LONGEST COMMON SUBSEQUENCE PROBLEM; PLAIN TEXT; POLY-LOGARITHMIC FACTORS; STEPPING STONE;

COMPUTATION THEORY;

CHARACTER RECOGNITION;

EID: 79959299019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20712-9_32     Document Type: Conference Paper

References (22)

1. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Zcompressed files. Journal of Computer and System Sciences 52(2), 299-307 (1996). (Pubitemid 126375142)
2. Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theoretical Computer Science 409(3), 486-496 (2008).
3. Ćegielski, P., Guessarian, I., Lifshits, Y., Matiyasevich, Y.V.: Window subsequence problems for compressed texts. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 127-136. Springer, Heidelberg (2006). (Pubitemid 44055071)
4. Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A subquadratic sequence alignment algorithm for unrestricted score matrices. SIAM Journal on Computing 32(6), 1654-1673 (2003).
5. Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: Unified compression-based acceleration of edit-distance computation. Technical Report 1004.1194, arXiv.
6. Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: Proceedings of the 26th STACS, pp. 529-540 (2009).
7. Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Collage system: A unifying framework for compressed pattern matching. Theoretical Computer Science 298(1), 253-272 (2003).
8. Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228-240. Springer, Heidelberg (2007).
9. Lifshits, Y., Lohrey, M.: Querying and embedding compressed texts. In: Kŕalovic, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 681-692. Springer, Heidelberg (2006). (Pubitemid 44577955)
10. Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. Journal of Computer and System Sciences 20, 18-31 (1980).
11. Myers, G.: Approximately matching context-free languages. Information Processing Letters 54, 85-92 (1995).
12. Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48(3), 443-453 (1970).
13. Rytter,W.: Algorithms on compressed strings and arrays. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 48-65. Springer, Heidelberg (1999).
14. Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Technical Report 0707.3619, arXiv.
15. Tiskin, A.: Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms 6(4), 570-581 (2008).
16. Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Mathematics in Computer Science 1(4), 571-603 (2008).
17. Tiskin, A.: Faster subsequence recognition in compressed strings. Journal of Mathematical Sciences 158(5), 759-769 (2009).
18. Tiskin, A.: Fast distance multiplication of unit-Monge matrices. In: Proceedings of ACM-SIAM SODA, pp. 1287-1296 (2010).
19. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM 21(1), 168-173 (1974).
20. Welch, T.A.: A technique for high-performance data compression. Computer 17(6), 8-19 (1984).
21. Ziv, G., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23, 337-343 (1977).
22. Ziv, G., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24, 530-536 (1978) (Pubitemid 8631609)