Solving longest common subsequence and related problems on graphical processing units

Software - Practice and Experience

Volumn 40, Issue 8, 2010, Pages 673-700

  Deorowicz, Sebastian ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Constrained longest common subsequence; Cuda; General processing using gpu; Graphical processing units; Longest common subsequence; Transposition invariance

Indexed keywords

CONSTRAINED LONGEST COMMON SUBSEQUENCES; CUDA; GENERAL PROCESSING USING GPU; GRAPHICAL PROCESSING UNITS; LONGEST COMMON SUBSEQUENCES; TRANSPOSITION INVARIANCE;

HIGHWAY ACCIDENTS;

PROGRAM PROCESSORS;

EID: 77956386944     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.976     Document Type: Article

References (52)

1. Khronos OpenCL Working Group. The OpenCL Specification, Version 1.0, Document Revision 43, Munshi (ed.). Available at: http://www.khronos.org/ registry/cl/specs/opencl-1.0.43pdf [16 May 2009].
2. Trevett N. OpenCL-The Open Standard for Heterogeneous Parallel Programming. Available at: http://www.khronos.org/developers/library/overview/ opencl-overview-pdf [18 June 2009].
3. Schive H-Y, Chien C-H, Wong S-K, Tsai Y-C, Chiueh T. Graphic-Card Cluster for Astrophysics (GraCCA) - Performance tests. arXiv:0707.2991v2 [astro-ph], 2008. Available at: http://arxiv.org/abs/0707.2991 [1 March 2010].
4. Frezzotti A, Ghiroldi GP, Gibelli L. Solving kinetic equations on GPUs I: Model kinetic equations. arXiv:0903.4044v1 [physics.comp-ph], 2009. Available at: http://arxiv.org/abs/0903.4044 [1 March 2010].
5. Alerstam E, Svensson T, Andersson-Engels S. Parallel computing with graphics processing units for high-speed Monte Carlo simulation of photon migration. Journal of Biomedical Optics 2008;13(6):060504-1-060504-3.
6. Park H, Fishwick PA. A fast hybrid time-synchronous/event approach to parallel discrete event simulation of queuing networks. Proceedings of the 40th Conference on Winter Simulation, Washington, DC, Mason SJ, Hill RR, Mönch L, Rose O, Jefferson T, Fowler JW (eds.), 2008;795-803.
7. NVidia Corporation. CUDA Zone-The Resource for CUDA Developers. Available at: http://www.nvidia.com/object/cuda home.html [18 June 2009].
8. Gusfield D. Algorithms on Strings, Trees, and Sequences. Cambridge University Press: Cambridge, NY, U. S. A., 1999.
9. Crochemore M, Hancart Ch, Lecroq T. Algorithms on Strings. Cambridge University Press: Cambridge, NY, U. S. A., 2007.
10. Bereg S, Kubica M, Waleń T, Binhai Z. RNA multiple structural alignment with longest common subsequence. Journal of Combinatorial Optimization 2006;13(2):179-188.
11. Crawford T, Iliopoulos C., Raman R. String matching techniques for musical similarity and melodic recognition. Computing in Musicology 1998;11:71-100.
12. Lemström K, Tarhio J. Searching monophonic patterns within polyphonic sources. Proceedings of Content-Based Multimedia Information Access Conference (RIAO), Paris, France, 2000;1261-1279.
13. Lemström K, Ukkonen E. Including interval encoding into edit distance based music comparison and retrieval. Proceedings of AISB'2000 Symposium on Creative and Cultural Aspects and Applications of AI and Cognitive Science, Birmingham, U. K., 2000;53-60.
14. Navarro G, Grabowski Sz, Mäkinen V, Deorowicz S. Improved time and space complexities for transposition invariant string matching. Technical Report TR/DCC-2005-4, University of Chile, Department of Computer Science, 2005;1-11. Available at: ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/mnloglogs.ps.gz.
15. Tsai Y-T. The constrained common subsequence problem. Information Processing Letters 2003;88(4):173-176.
16. Deorowicz S. Fast algorithm for the constrained longest common subsequence problem. Theoretical and Applied Informatics 2007;19(2):91-102.
17. Peng Z, Ting H. Time and space efficient algorithms for constrained sequence alignment. Proceedings of the Implementation and Application of Automata, Ninth International Conference (CIAA), Kingston, Canada, 2004;237-246.
18. ™ Programming Guide, Version 2.2. Available at: http://www.nvidia.com/object/cuda get.html [18 June 2009].
19. Farber R. CUDA, supercomputing for the masses: Parts 1-15. Doctor Dobb's Journal 2008-2009. Available at: http://www.ddj.com/architect/207200659 [1 March 2010].
20. Deorowicz S. Computing the longest common transposition-invariant subsequence with GPU. Man-Machine Interactions, Series Advances in Intelligent and Soft Computing, Cyran KA, Kozielski S, Peters JF, Stanczyk U, Wakulicz-Deja A (eds.), vol. 59. Springer: Berlin, Heidelberg, 2009;551-559.
21. Bergroth L, Hakonen H, Raita T. A survey of longest common subsequence algorithms. Proceedings of the Seventh International Symposium on String Processing and Information Retrieval (SPIRE), A Coruña, Spain, 2000;39-48.
22. Wong CK, Chandra AK. Bounds for the string editing problem. The Journal of the ACM 1976;23(1):13-16.
23. Hunt JW, Szymanski TG. A fast algorithm for computing longest common subsequences. Communications of the ACM 1977;20(5):350-353.
24. Kuo S, Cross GR. An improved algorithm to find the length of the longest common subsequence of two strings. ACM SIGIR Forum 1989;23%(3-4):89-99.
25. Eppstein D, Galil Z, Giancarlo R, Italiano GF. Sparse dynamic programming I: Linear cost functions. Journal of the ACM 1992;39(3):519-545.
26. van Emde Boas P, Kaas R, Zijlstra E. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 1977;6(3):80-82.
27. Masek WJ, Paterson MS. A faster algorithm for computing string edit distances. Journal of Computer and System Sciences 1980;20(1):18-31.
28. Allison L, Dix TL. A bit-string longest common subsequence algorithm. Information Processing Letters 1986;23(6):305-310.
29. Crochemore M, Iliopoulos CS, Pinzon YJ, Reid JF. A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters 2001;80(6):279-285.
30. Hyyrö H. Bit-parallel LCS-length computation revisited. Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms, Ballina, New South Wales, Australia, 2004;16-27.
31. Deorowicz S. Speeding up transposition-invariant string matching. Information Processing Letters 2006;100(1):14-20.
32. 2/w) time and space. Proceedings of the 12th Australasian Workshop on Combinatorial Algorithms, Bandung, Indonesia, 2001;106-117.
33. Hirschberg DS. A linear space algorithm for computing maximal common subsequences. Communication of the ACM 1975;18(6):341-343.
34. Chowdhury RA, Ramachandran V. Cache-oblivious dynamic programming. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. ACM Press: New York, NY, U. S. A., 2006;591-600.
35. Lemström K, Navarro G, Pinzon Y. Practical algorithms for transposition-invariant string-matching. Journal of Discrete Algorithms 2005;3%(2-4):267-292.
36. Mäkinen V, Navarro G, Ukkonen E. Transposition invariant string matching. Journal of Algorithms 2005;56(2):124-153.
37. Grabowski Sz, Deorowicz S. Nice to be a chimera: A hybrid algorithm for the longest common transpositioninvariant subsequence problem. Proceedings of the Ninth International Conference on Modern Problems of Radio Engineering, Telecommunication and Computer Science, Lviv-Slavsko, Ukraine, 2008;50-54.
38. Chin FYL, De Santis A, Ferrara AL, Ho NL, Kim SK. A simple algorithm for the constrained sequence problems. Information Processing Letters 2004;90(4):175-179.
39. Arslan AN, Eǧecioǧlu O. Algorithms for the constrained longest common subsequence problems. International Journal of Foundations of Computer Science 2005;16(6):1099-1109.
40. Peng Ch-L. An approach for solving the constrained longest common subsequence problem. Master's Thesis, Department of Computer Science and Engineering, National Sun Yat-sen University, Taiwan, 2003;1-29. Available at: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/getfile?URN=etd-0828103- 125439&filename=etd-0828103-125439pdf [1 March 2010].
41. Deorowicz S, Obstój J. Constrained longest common subsequence computing algorithms in practice. Computing and Informatics 2010;29(3). Available at: http://sun. aei.polsl.pl/~sdeor/pub/tr do2009pdf [1 March 2010].
42. He D, Arslan AN. A space-efficient algorithm for the constrained pairwise sequence alignment problem. Genome Informatics 2005;16(2):237-246.
43. Lipton RJ, Lopresti D. A Systolic array for rapid string comparison. Proceedings of the Chapel Hill Conference on VLSI, Chapel Hill, NC, 1985;363-376.
44. Ranka S, Sahni S. String editing on an SIMD hypercube multicomputer. Journal of Parallel and Distributed Computing 1990;9:411-418.
45. Rajko S, Aluru S. Space and time optimal parallel sequence alignments. IEEE Transactions on Parallel and Distributed Systems 2004;15(12):1070-1081.
46. Valiant LG. A bridging model for parallel computation. Communications of the ACM 1990;33(8):103-111.
47. Krusche P, Tiskin A. Efficient longest common subsequence computation using bulk-synchronous parallelism. Lecture Notes in Computer Science 2006;3984:165-174.
48. Liu W, Schmidt B, Voss G, Schroder A, Muller-Wittig W. Bio-sequence database scanning on a GPU. Proceedings of the 20th International Parallel and Distributed Processing Symposium, Rhodes Island, Greece, 2006;274-281.
49. Manavski SA, Valle G. CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment. BMC Bioinformatics 2008;9(Suppl 2): S10. Available at: http://www.biomedcentral.com/1471-2105/9/S2/ S10 [1 March 2010].
50. Ligowski Ł, Rudnicki W. An efficient implementation of Smith Waterman algorithm on GPU using CUDA, for massively parallel scanning of sequence databases. ipdps. IEEE International Symposium on Parallel and Distributed Processing 2009;1-8. DOI: 10.1109/IPDPS.2009.5160931.
51. Farrar M. Striped Smith-Waterman speeds database searches six times over other SIMD implementations. Bioinformatics 2007;23(2):156-161.
52. Kloetzli J, Strege B, Decker J, Olano M. Parallel longest common subsequence using graphics hardware. Proceedings of the Eurographics Symposium on Parallel Graphics and Visualization, Crete, Greece, Favre J, Ma KL, Weiskopf D (eds.), 2008;14-15. Available at: http://www.cs.umbc.edu/~olano/papers/ cudaLCSpdf [1 March 2010].