{"created":"2025-01-18T23:02:25.483977+00:00","updated":"2025-01-22T15:35:57.882467+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00033634","sets":["1164:2735:2796:2797"]},"path":["2797"],"owner":"1","recid":"33634","title":["New Algorithms for Multiple Sequence Alignment"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-11-26"},"_buckets":{"deposit":"5217b4f4-d5e6-439f-84ee-682e2622c862"},"_deposit":{"id":"33634","pid":{"type":"depid","value":"33634","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"New Algorithms for Multiple Sequence Alignment","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"New Algorithms for Multiple Sequence Alignment"},{"subitem_title":"New Algorithms for Multiple Sequence Alignment","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-11-26","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"REAL WORLD COMPUTING PARTNERSHIP TSUKUBA MITSUI BLDG."}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"REAL WORLD COMPUTING PARTNERSHIP TSUKUBA MITSUI BLDG.","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/33634/files/IPSJ-MPS98022006.pdf"},"date":[{"dateType":"Available","dateValue":"2000-11-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS98022006.pdf","filesize":[{"value":"473.5 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"97cfed77-9c4f-4a53-aab7-5e24d806b73a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"PAUL, HORTON"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Paul, Horton","creatorNameLang":"en"}],"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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We have developed two new exact algorithms for gapless multiple alignment of DNA sequences. Unlike previous exact algorithms  for sufficiently short motifs  the complexity of our algorithms do not grow exponentially in the number of sequences. One algorithm  which assumes a class of scoring functions which includes the information theoretic entry scoring function  is polynomial in the number of sequences although it is exponential in the width of the motifs to be aligned. The other algorithm is super exponential in the width of the motif but linear in the number of sequences for a very general class of scoring functions.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We have developed two new exact algorithms for gapless multiple alignment of DNA sequences. Unlike previous exact algorithms, for sufficiently short motifs, the complexity of our algorithms do not grow exponentially in the number of sequences. One algorithm, which assumes a class of scoring functions which includes the information theoretic entry scoring function, is polynomial in the number of sequences although it is exponential in the width of the motifs to be aligned. The other algorithm is super exponential in the width of the motif but linear in the number of sequences for a very general class of scoring functions.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"36","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"31","bibliographicIssueDates":{"bibliographicIssueDate":"1998-11-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"105(1998-MPS-022)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":33634,"links":{}}