20. ترتیبی یتمرالگو
1. for i=0:m
2. d(0,i)=0;
3. end
4. for j=0:n
5. d(i,0)=i;
6. end
7. for i=1:n
8. for j=1:m
9. if p(i-1)==t(j-1)
10. d(i,j)=d(i-1,j-1);
11. else
12. d(i,j)=minmum(d(i,j-1),d(i-1,j),d(i-1,j-1))+1;
13. end
14. end
15. end
O(nm)
O(n)
O(m)
20
36. موازی الگوریتم دوم قسمت:
ماتریس محاسبهD
2. FOR i=0 to m DO
FOR i=0 to n PARALLEL DO
compute D[i,j] according formula(4);
END FOR PARALLEL
Barrier synchronization
END FOR
O(1)
O(m)
36
46. منابع
[1] L. Z., B. J., and J. T. A software system for gene sequence database
construction. Engineering in Medicine and Biology Society, 2005.
[2] L. V.I. Binary codes capable of correcting deletions, insertions and
reversals. ov. Phys. Dokl, 1996.10.
[3] G. Navarro and R. Baeza-yates. A hybrid indexing method for approximate
string matching. Journal of Discrete Algorithms, 1(1):21–49, 2000.
[4] Z. C and C. GL. Parallel algorithms for approximate string matching on
pram and larpbs. Journal of software, 15:159–169, 2004.
[5] S. P. The theory and computation of evolutionary distance:pattern
recognition. Journal of Algorithms, pages 359–373, 1980.1.
[6] G. Navarro. A guided tour to approximate string matching. ACM
Computing Surveys, 33(1):31–88, 2000.
[7] B.-Y. Z. Y.S.Jayram and R. Krauthgamer. Approximating Edit Distance
Efficiently. Computer Science, 2004.10.
[8] K. A. T. MIURA and I. SHIOYA. Approximate String Matching Using
Markovian Distance. Algorithms and Programming, 2010.
[9] D. S. J. Zibert and N. Pavesic. An edit-distance model for the approximate
matching of timed strings. Pattern Analysis and Machine
Intelligence, 31(4):736–741, 2009.
46
47. منابع
[9] D. S. J. Zibert and N. Pavesic. An edit-distance model for the approximate
matching of timed strings. Pattern Analysis and Machine
Intelligence, 31(4):736–741, 2009.
[10] L. D. S. Wang and Z. Mei. Approximate Address Matching. International
Conference on P2P, Parallel, Grid, Cloud and Internet Computing,
2010.10.
[11] H.-C. Lee and E. F. RMESH algorithms for parallel string matching.
Los Alamitos: IEEE Computer Society Press, 1997.
[12] A. H. Wright and Y. Jiang. O(k) parallel algorithms for approximate
string matching. ournal of Neural Parallel and Scientific Computation,
1993.1.
[13] S. Xiao and W. chun Feng. Inter-Block GPU communication via fast
barrier synchronization. 24th IEEE International Parallel Distributed
Processing Symposium, 2010.
[14] K. C. K. G. Margaritis. String Matching on a Multicore GPU using
CUDA. 13th Panhellenic Conference on Informatics, 2009.
47