@article{oai:miyazaki-u.repo.nii.ac.jp:00002561,
 author = {山森, 一人 and Yamamori, Kunihito and 東, 博志 and 吉原, 郁夫 and Yoshihara, Ikuo and Higashi, Hiroshi},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Sep},
 note = {Recent advance of genomic analysis technologies gives us a lot of DNA sequence data. These are used for further genome analysis. To find the optimum global alignment is investigated as one of the genomic analysis. For this purpose, Dynamic Programming (DP) matching is usually used. However, DP matching requires storage space in the square of the length of the sequences. For example, to find the optimum global alignment for one million bases, 1TB memory is needed. So, divide and conquer method is proposed to reduce required memory space. However, it leads increasing of the amount of calculation of DP matching. So we propose a method to achieve fast computation time with small required memory by combination of branch-cut and parallel processing. Our method succeeded to reduce computation time to 8% of conventional method.},
 pages = {345--350},
 title = {並列DPマッチングによる大域アラインメントの高速化},
 volume = {39},
 year = {2010},
 yomi = {ヤマモリ, クニヒト and ヒガシ, ヒロシ and ヨシハラ, イクオ}
}