{"created":"2025-01-19T01:33:52.759475+00:00","updated":"2025-01-19T10:19:01.175216+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00232802","sets":["1164:2735:11468:11517"]},"path":["11517"],"owner":"44499","recid":"232802","title":["文法圧縮アルゴリズムを用いたcolored de Bruijn graphの効率化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-02-29"},"_buckets":{"deposit":"6241ee99-1c5a-42f1-bb04-ae8f4ef765c3"},"_deposit":{"id":"232802","pid":{"type":"depid","value":"232802","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"文法圧縮アルゴリズムを用いたcolored de Bruijn graphの効率化","author_link":["631048","631049"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"文法圧縮アルゴリズムを用いたcolored de Bruijn graphの効率化"}]},"item_type_id":"4","publish_date":"2024-02-29","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学基幹理工学研究科"},{"subitem_text_value":"早稲田大学基幹理工学研究科"}]},"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/232802/files/IPSJ-MPS24147019.pdf","label":"IPSJ-MPS24147019.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS24147019.pdf","filesize":[{"value":"1.1 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"46050cba-35a4-41fd-8401-0915ff387d3f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岩月, 悠真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"清水, 佳奈"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Colored de Bruijn graph (CDBG) はサンプル特異的な変異の発見など多様な解析に役立つ．CDBG の色情報はグラフと関連するバイナリ行列 (color matrix) で保存されるが，サンプル数を増やすにつれてサイズが非常に大きくなる．そのため，実用に耐えうる CDBG を構築するには color matrix をうまく圧縮する必要がある．本研究では文法圧縮のアルゴリズムやハミング距離近傍探索による差分表現を用いて，color matrix の疎かつ行ベクトルが類似しやすい性質を生かした圧縮を行った．結果として，提案手法は既存手法と比較してデータ構造のサイズ削減とクエリ応答の高速化のより良いトレードオフを実現した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-02-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"19","bibliographicVolumeNumber":"2024-MPS-147"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":232802,"links":{}}