|
[1] Michailidis, P.D. and Margaritis, K.G.. (2002), On-Line Approximate String Searching Algorithms: Survey and Experimental Results, Intern. J Computer Math., 79(8), pp. 867-888. [2] Michailidis, P.D. and Margaritis, K.G.. (2001), String Matching Problem on a Cluster of Personal Computers: Experimental Results, In: Proc. of the 15th International Conference on Systems for Automation of Engineering and Research, 2001, pp. 71-75. [3] Michailidis, P.D. and Margaritis, K.G.. (1999), A Survey of On-line Approximate String Matching Algorithms, Technical Report, Dept. of Applied Informatics, University of Macedoniz. [4] Cheng, L.L., Cheung, D.W., Yiu, S.M. (2003), Approximate String Matching in DNA Sequences, In: Eighth International Conference on Database Systems for Advanced Applications (DASFAA), Kyoto, Japan, March 2003, pp. 303-310. [5] Ukkonen, E., Approximate String-Matching over Suffix Trees (1993), In: Fourth Annual Sysmposium on Combinatorial Matching, Padova, Italy, volume 684 of LNCS, Springer, June 1993, pp. 228-242. [6] Navarro, G. (2001), A Guided Tour to Approximate String Matching, ACM Computing Surveys, 33(1):31-88. [7] Boyer, R.S. and Moore, J.S. (1977), A Fast String Searching Algorithm, Communications of the ACM, 20(10):762-772. [8] Horspool, R.N. (1980), Practical Fast Searching in Strings, Software-Practice and Experience, 10(6):501-506. [9] Charras, C. and Lecpoq ,T. (1997), Boyer-Moore algorithm, Retrieved December 2004, from Web site: http://www-igm.univ-mlv.fr/~lecroq/string/node14.html. [10] Charras, C. and Lecpoq ,T. (1997), Horspool algorithm, Retrieved December 2004, from Web site: http://www-igm.univ-mlv.fr/~lecroq/string/node18.html. [11] Halmos, P.R. (1973), Distance between Strings, Retrieved December 2004, from Web site: http://www.cut-the-knot.org/do_you_know/Strings.shtml. [12] Black, P.E. (2000), Hamming distance, Retrieved December 2004, from Web site: http://www.nist.gov/dads/HTML/hammingdist.html. [13] Baeza-Yates, R.A. and Gonnet, G.H. (1992), A New Approach to Text Searching, Communications of the ACM, 35(10): 74-92. [14] Baeza-Yates, R.A. and Gonnet, G.H. (1994), Fast String Matching with Mismatches, Information and Computation, 180(2): 187-199. [15] Baeza-Yates, R.A. and Navarro, G. (1996), A Fast Heuristic for Approximate String Matching, In: Proc. of the 3rd South American Workshop on String Processing, Carleton University Press, pp. 47-63. [16] Baeza-Yates, R.A. and Navarro, G. (1996), A Faster Algorithm for Approximate String Matching, In: Proc. of the 7th Annual Symposium on Combinatorial Pattern Matching, No. 1075, Springer-Verlag, Berlin, pp. 1-23. [17] Baeza-Yates, R.A. and Navarro, G. (1999), A Faster Algorithm for Approximate String Matching, Algorithmica, 23(2): 127-158. [18] Baeza-Yates, R.A. and Perleberg, C.H. (1996), Fast and Practical Approximate String Matching, Information Processing Letters, 59(1): 21-27. [19] Chang, W.I. and Lampe, J. (1992), Theoretical and Empirical Comparisons of Approximate String Matching Algorithms, In: Proc. of the 3rd Annual Symposium on Combinatorial Pattern Matching, No. 664, Springer-Verlag, Berlin, pp. 175-184. [20] Chang, W. and Lawler, E. (1994), Sublinear Approximate String Matching and Biological Applications, Algorithmica, 12(4-5): 327-344. [21] Dermouche, A. (1995), A Fast Algorithm for String Matching with Mismatches, Information Processing Letters, 55(2): 105-110. [22] El-Mabrouk, N. and Chrochemore, M. (1996), Boyer-Moore Strategy to Efficient Approximate String Matching, In: Proc. of 711 Annual Symposium on Combinatorial Pattern Matching, No. 1075, Springer-Verlag, Berlin, pp.24-38. [23] Galil, Z. and Giancarlo, R. (1986), Improved String Matching with k Mismatches, Sigact News, 17(4): 52-54. [24] Grossi, R. and Luccio, F. (1989), Simple and Efficient String Matching with k Mismatches, Information Processing Letters, 33(3): 113-120. [25] Galil, Z. and Park, K. (1990), An Improved Algorithm for Approximate String Matching, SIAM Journal of Computing, 19(6): 989-999. [26] Jokinen, P., Tarhio, J. and Ukkonen, E. (1996), A Comparison of Approximate String Matching Algorithms, Software-Practice and Experience, 26(12): 1439-1458. [27] Kurtz, S. (1996), Approximate String Searching under Weighted Edit Distance. In: Proc. of the 3rd South American Workshop on String Processing, Carleton University Press, pp. 156-170. [28] Landau, G.M. and Vishkin, U. (1986), Efficient String Matching with k Mismatches, Theoretical Computer Science, 43(2–3): 239-249. [29] Landau, G.M. and Vishkin, U. (1988), Fast String Matching with k Differences, Journal of Computer and System Sciences, 37(1): 63-78. [30] Landau, G.M. and Vishkin, U. (1989), Fast Parallel and Serial Approximate String Matching, Journal of Algorithms, 10(2): 157-169. [31] Myers, G. (1998), A Fast Bit-Vector Algorithm for Approximate Pattern Matching Based On Dynamic Programming, In: Proc. of the 9th Annual Symposium on Combinatorial Pattern Matching, No. 1448 , Springer-Verlag, Berlin, pp. 1-13. [32] Myers, G. (1999), A Fast Bit-Vector Algorithm for Approximate Pattern Matching Based On Dynamic Programming, Journal of the Association for Computing Machinery, 46(3): 395-415. [33] Navarro, G. (1997), Multiple Approximate String Matching by Counting, In: Proc. of the 4th South American Workshop on String Processing, Carleton University Press, pp. 125-139. [34] Navarro, G. (1997), A Partial Deterministic Automaton for Approximate String Matching, In: Proc. of the 4th South American Workshop on String Processing, Carleton University Press, pp. 112-124. [35] Navarro, G. and Raffinot, M. (1998), A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching, In: Proc. of the 9th Annual Symposium on Combinatorial Pattern Matching, No. 1448, Springer-Verlag, Berlin, pp. 14-33. [36] Pevzner, P. and Waterman, M. (1995), Multiple Filtration and Approximate Pattern Matching, Algorithmica, 13(1–2): 135–154. [37] Sellers, P.H. (1980), The Theory and Computation of Evolutionary Distance: Pattern Recognition, Journal of Algorithms, 1(4): 359–373. [38] Sutinen, E. and Tarhio, J. (1995), On Using Q-Gram Locations in Approximate String Matching, In: Proc. 3rd Annual European Symposium, No. 979, Springer-Verlag, Berlin, pp. 327-340. [39] Takaoka, T. (1994), Approximate Pattern Matching with Samples, In: Proc. of the 5th International Symposium on Algorithm and Computation, No. 834, Springer-Verlag, Berlin, pp. 234-242. [40] Tarhio, J. and Ukkonen, E. (1993), Approximate Boyer-Moore String Matching, SIAM Journal on Computing, 22(2): 243-260. [41] Ukkonen, E. (1985), Finding Approximate Patterns in Strings, Journal of Algorithms, 4(1–3): 32-137. [42] Ukkonen, E. (1992), Approximate String Matching with Q-Grams and Maximal Matches, Theoretical Computer Science, 92(1): 191-211. [43] Ukkonen, B. and Wood, D. (1993), Approximate String Matching with Suffix Automata, Algorithmica, 10(5): 353-364. [44] Wu, S. and Manber, U. (1992), Fast Text Searching Allowing Errors, Communications of the ACM, 35(10): 83-91. [45] Wu, S., Manber, U. and Myers, G. (1996), A Subquadratic Algorithm for Approximate Limited Expression Matching, Algorithmica, 15(1): 50-67. [46] Wright, A. (1994), Approximate String Matching using Within-Word Parallelism, Software-Practice and Experience, 24(4): 337-362. [47] Henikoff, S. and Henikoff, J.G. (1992), Amino Acid Substitution Matrices from Protein Blocks, In: Proc. of the National Academy of Sciences, Vol. 89, pp. 10915-10919. [48] Dayhoff, M. O., Schwartz, R. M. and Orcutt, B. C. (1978). Atlas of Protein Sequence and Structure, Vol. 5, Suppl. 3, National Biomedical Research Foundation, Washington, DC.
|