{"created":"2025-01-18T23:01:24.602164+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032283","sets":["1164:2592:2672:2675"]},"path":["2675"],"owner":"1","recid":"32283","title":["配列類似度に基づく大規模配列集合の高速分類アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-07-24"},"_buckets":{"deposit":"c8f46965-de1d-4f1b-b70c-719bdba39e11"},"_deposit":{"id":"32283","pid":{"type":"depid","value":"32283","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"配列類似度に基づく大規模配列集合の高速分類アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"配列類似度に基づく大規模配列集合の高速分類アルゴリズム"},{"subitem_title":"Classifying method of large size set of sequences based on pairwise similarities","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1996-07-24","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院基礎工学研究科物理系専攻情報工学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科物理系専攻情報工学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科物理系専攻情報工学分野"},{"subitem_text_value":"大阪大学大学院基礎工学研究科物理系専攻情報工学分野"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Physical Science Course, Graduate School of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Physical Science Course, Graduate School of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Physical Science Course, Graduate School of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Physical Science Course, Graduate School of Engineering Science, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/32283/files/IPSJ-AL96052005.pdf"},"date":[{"dateType":"Available","dateValue":"1998-07-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL96052005.pdf","filesize":[{"value":"619.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fe4785e1-19f2-42e2-b43f-a901a0adf9b3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岩出, 智行"},{"creatorName":"石原, 達也"},{"creatorName":"松田, 秀雄"},{"creatorName":"橋本, 昭洋"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tomoyuki, Iwade","creatorNameLang":"en"},{"creatorName":"Tatsuya, Ishihara","creatorNameLang":"en"},{"creatorName":"Hideo, Matsuda","creatorNameLang":"en"},{"creatorName":"Akihiro, Hashimoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"分子生物学におけるアミノ酸配列集合の解析手法として，マルチプルアライメントによる解析がある．しかし，マルチプルアライメントは対象となる配列集合が大規模（おおむね100以上）であると計算時間が膨大になり，また互いの類似度が高いような配列集合でないと意味のある結果が導き出せないことが知られている．そのため，あらかじめ配列集合をある程度互いの類似度の高い部分集合に分類しておく必要がある．そこで本研究では，配列間の近似的な類似度を計算するFASTA等の結果を用いることを想定した配列分類尺度を提案した．また，その分類尺度を基に，大規模配列集合の分類に耐え得る高速性を持ったアルゴリズムを作成，実装，性能評価を行なった．その結果十分高速で，かつ既存の方法と比較して，よりうまく類縁関係に分類できることがわかった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In molecular biology, several multiple alignment methods have been used for analyzing amino acid sequences. But, these methods are too expensive to align more than 100 sequences and cannot lead to meaningful results if the similarities of sequences are not enough. Therefore, there is a demand for classifying a large size set of sequences into small size sets. In this paper, we propose a method to classify sequences based on an approximate value of pairwise similarity (e.g. FASTA's score). The effectiveness of this method is demonstrated by measuring the performance on classifying hundreds of amino acid sequences.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"40","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"33","bibliographicIssueDates":{"bibliographicIssueDate":"1996-07-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"67(1996-AL-052)","bibliographicVolumeNumber":"1996"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32283,"updated":"2025-01-22T16:14:19.954958+00:00","links":{}}