{"created":"2025-01-18T23:23:08.802856+00:00","updated":"2025-01-22T02:59:22.850184+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00060791","sets":["934:1151:5606"]},"path":["5606"],"owner":"10","recid":"60791","title":["A Modified Algorithm for Sequence Alignment Using Ant Colony System"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-05-25"},"_buckets":{"deposit":"e5da2dca-d8ce-48a7-b346-749d1bc393a5"},"_deposit":{"id":"60791","pid":{"type":"depid","value":"60791","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"A Modified Algorithm for Sequence Alignment Using Ant Colony System","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Modified Algorithm for Sequence Alignment Using Ant Colony System"},{"subitem_title":"A Modified Algorithm for Sequence Alignment Using Ant Colony System","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Original Papers","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2009-05-25","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science and Systems Engineering, Muroran Institute of Technology"},{"subitem_text_value":"Department of Computer Science and Systems Engineering, Muroran Institute of Technology"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science and Systems Engineering, Muroran Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Systems Engineering, Muroran Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/60791/files/IPSJ-TBIO0200008.pdf"},"date":[{"dateType":"Available","dateValue":"2009-05-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TBIO0200008.pdf","filesize":[{"value":"613.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"723cad01-9b1f-4a04-b095-3db68ea06e4a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ai, Mikami"},{"creatorName":"Jianming, Shi"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ai, Mikami","creatorNameLang":"en"},{"creatorName":"Jianming, Shi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12177013","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6679","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"73","bibliographic_titles":[{"bibliographic_title":"IPSJ Transactions on Bioinformatics （TBIO）"}],"bibliographicPageStart":"63","bibliographicIssueDates":{"bibliographicIssueDate":"2009-05-25","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":60791,"links":{}}