{"created":"2025-01-18T23:21:43.969391+00:00","updated":"2025-01-22T03:51:03.164347+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00058835","sets":["1164:5352:5353:5354"]},"path":["5354"],"owner":"1","recid":"58835","title":["ミスマッチクラスタを表現する最小汎化集合の高速抽出"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-12-10"},"_buckets":{"deposit":"5022dcf6-4e9b-4550-bc27-667d7493491b"},"_deposit":{"id":"58835","pid":{"type":"depid","value":"58835","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":"Fast Extracting Minimum Generalized Set of Mismatch Cluster","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2008-12-10","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":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City 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/58835/files/IPSJ-BIO08015019.pdf"},"date":[{"dateType":"Available","dateValue":"2010-12-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-BIO08015019.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f3a9342d-449d-44ec-ae0a-bed8c712f607","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 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":"Yusuke, Sawada","creatorNameLang":"en"},{"creatorName":"Keiichi, Tamura","creatorNameLang":"en"},{"creatorName":"Kotaro, Araki","creatorNameLang":"en"},{"creatorName":"Hajime, Kitakami","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12055912","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":"配列データベースに対する暖昧な問合せ処理では,非常に多くの類似した部分文字列の集合 (ミスマッチクラスタ) が結果として得られる.そのため,ユーザがミスマッチクラスタを閲覧し,その全体像を把握することは困難である.著者らは,ミスマッチクラスタから暖昧な文字表現を含む最小汎化集合を高速に抽出するために,ドメイン分割法を併用した反復精密化法とその並列化方式を提案する.提案手法の有効性を評価するために,アミノ酸モチーフの抽出問題に適用して実験を行ったので,その実験結果についても報告する.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"An ambiguous query in sequence database returns a set of similar subsequences, called a mismatch cluster, to the user. Therefore, the user browses the mismatch clusters, and it is difficult to comprehend the mismatch clusters. The authors propose an iterative refinement method to extract the minimum generalized set including the ambiguous sequence patterns from mismatch clusters. In addition, the authors propose the use of both iterative refinement method in combination with the domain segmentation method and parallelization method to achieve a fast extracting the minimum generalized set. Moreover, the authors apply the three proposed methods to the problem of extraction of an amino acid motif and experimented it to evaluate the effectiveness, then we report about the experimental results. ","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"76","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告バイオ情報学(BIO)"}],"bibliographicPageStart":"73","bibliographicIssueDates":{"bibliographicIssueDate":"2008-12-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"126(2008-BIO-015)","bibliographicVolumeNumber":"2008"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":58835,"links":{}}