@article{oai:miyazaki-u.repo.nii.ac.jp:00002615,
 author = {山森, 一人 and Yamamori, Kunihito and 河野, 忠明 and 吉原, 郁夫 and Yoshihara, Ikuo and 相川, 勝 and Aikawa, Masaru and Kawano, Tadaaki},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Jul},
 note = {Recent advance of genomic analysis technologies gives us a lot of DNA sequence data. Many researchers apply these data for post-genomic investigation. To find the optimum global alignment is investigated as one of the most important tasks of post-genomic investigation because it is the first step of there researches. Dynamic Programming (DP) matching is a major way to find the optimum alignment between sequences. However, DP matching requires O(N^2) memory space to align the sequences consisting of N bases. To reduce memory space, divide and conquer algorithm is used with DP matching, but it leads longer computation time. In this paper, we propose a high-speed method to obtain the optimum global alignment by parallel DP maching assisted with GPGPU(General Purpose computing on Graphics Processing Unit). In this method, we utilize many stream processors like an arithmetic pipeline. Experimental results showed that our method achieved about five times faster than that by CPU.},
 pages = {323--326},
 title = {GPGPUを用いた並列DPマッチングによる大域アラインメントの高速化},
 volume = {41},
 year = {2012},
 yomi = {ヤマモリ, クニヒト and カワノ, タダアキ and ヨシハラ, イクオ and アイカワ, マサル}
}