WEKO3
アイテム
A Modified Algorithm for Sequence Alignment Using Ant Colony System
https://ipsj.ixsq.nii.ac.jp/records/60791
https://ipsj.ixsq.nii.ac.jp/records/6079105e71377-3167-4edf-9f44-5fa111696a29
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TBIO0200008.pdf (613.0 kB)
|
Copyright (c) 2009 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2009-05-25 | |||||||
| タイトル | ||||||||
| タイトル | A Modified Algorithm for Sequence Alignment Using Ant Colony System | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | A Modified Algorithm for Sequence Alignment Using Ant Colony System | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Original Papers | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of Computer Science and Systems Engineering, Muroran Institute of Technology | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science and Systems Engineering, Muroran Institute of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Systems Engineering, Muroran Institute of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Systems Engineering, Muroran Institute of Technology | ||||||||
| 著者名 |
Ai, Mikami
Jianming, Shi
× Ai, Mikami Jianming, Shi
|
|||||||
| 著者名(英) |
Ai, Mikami
Jianming, Shi
× Ai, Mikami Jianming, Shi
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments indicate that this algorithm is as much as 2,900 times faster than the original ACS-MultiAlignment algorithm. We also compare this algorithm to the other approaches such as Gibbs sampling algorithm using numerical experiments. The results show that our algorithm finds the best value prompter than Gibbs approach. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments indicate that this algorithm is as much as 2,900 times faster than the original ACS-MultiAlignment algorithm. We also compare this algorithm to the other approaches such as Gibbs sampling algorithm using numerical experiments. The results show that our algorithm finds the best value prompter than Gibbs approach. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA12177013 | |||||||
| 書誌情報 |
IPSJ Transactions on Bioinformatics （TBIO） 巻 2, p. 63-73, 発行日 2009-05-25 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6679 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
