2026-03-14T14:22:52Z https://miyazaki-u.repo.nii.ac.jp/oai

oai:miyazaki-u.repo.nii.ac.jp:00002480 2025-01-09T05:36:21Z 73 73:36 73:36:330 73:36:330:316

ゲノム カイセキ ニ モチイル DP マッチング ノ ブンカツ トウチホウ ニ ヨル コウソクカ ゲノム解析に用いるDPマッチングの分割統治法による高速化 A Divide-and-Conquer Method of Dynamic Programming for Genome Informatics 中川, 匠 12587 ナカガワ, タクミ 吉原, 郁夫 11807 ヨシハラ, イクオ Yoshihara, Ikuo 山森, 一人 11805 ヤマモリ, クニヒト 50293395 Yamamori, Kunihito 安永, 守利 12590 ヤスナガ, モリトシ Yasunaga, Moritoshi Nakagawa, Takumi 12591 Genome Informatics, Dynamic Programming, Divide-and-Conquer, Alignment, Feature Extraction ABSTRACT Alignment based on DP-matching is used to extract unknown feature pattern embedd ed in genome sequence. To extract feature pattem with base length n, complete set of similarity of c andidate pattern with base length N = 2, 3, ・ ・ ・ , n is required. When extending base length n, number of candidate pattern and execution time i ncrease exponential order O(4n+1 ). This paper propose a new faster method of extracting feature pattern by reusing similartiy which is calculated past step. The method enable extracting feature pattern with base length n = 10 to speed up as much as 9 times than conventional method. departmental bulletin paper 宮崎大学工学部 Faculty of Engineering, University of Miyazaki 2006-08-30 VoR application/pdf 宮崎大学工学部紀要 35 257 262 Memoirs of Faculty of Engineering, University of Miyazaki AA00732558 05404924 https://miyazaki-u.repo.nii.ac.jp/record/2480/files/KJ00004439520.pdf http://hdl.handle.net/10458/445 https://miyazaki-u.repo.nii.ac.jp/records/2480 jpn