High-speed Generation of Logic Function to Identify Exon-Intron Boundaries by Parallel GP
この論文をさがす
説明
Abstract Genetic Programming (GP) is applied to various field. However, it is a problem that GP needs a lot of execution time for large scale problems such as genome informatics. In this paper, we focus on reducing computation time of GP. For this objective, we parallelize GP by island model on a personal computer (PC) cluster system to identify exon-intron boundaries in DNA sequences which is example of application. In addition, we described individuals as an one dimentional matrix to reduce the time of migration which is a process of island model. The paralellized GP achieved linear speedup ratio on each number of PC. Moreover, we show quality of solution to change on each number of PC.
収録刊行物
-
- 宮崎大学工学部紀要
-
宮崎大学工学部紀要 33 343-348, 2004-10
宮崎大学工学部
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050007314766196096
-
- NII論文ID
- 110001150811
-
- NII書誌ID
- AA00732558
-
- ISSN
- 05404924
-
- HANDLE
- 10458/346
-
- NDL書誌ID
- 7196148
-
- 本文言語コード
- en
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB
- NDLサーチ
- CiNii Articles