WEKO3
アイテム
New Algorithms for Multiple Sequence Alignment
https://ipsj.ixsq.nii.ac.jp/records/33634
https://ipsj.ixsq.nii.ac.jp/records/33634eb3583fc-ffa3-48a1-af39-c56acbee9460
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-MPS98022006.pdf (473.5 kB)
|
Copyright (c) 1998 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1998-11-26 | |||||||
| タイトル | ||||||||
| タイトル | New Algorithms for Multiple Sequence Alignment | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | New Algorithms for Multiple Sequence Alignment | |||||||
| 言語 | ||||||||
| 言語 | jpn | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| REAL WORLD COMPUTING PARTNERSHIP TSUKUBA MITSUI BLDG. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| REAL WORLD COMPUTING PARTNERSHIP TSUKUBA MITSUI BLDG. | ||||||||
| 著者名 |
PAUL, HORTON
× PAUL, HORTON
|
|||||||
| 著者名(英) |
Paul, Horton
× Paul, Horton
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN10505667 | |||||||
| 書誌情報 |
情報処理学会研究報告数理モデル化と問題解決（MPS） 巻 1998, 号 105(1998-MPS-022), p. 31-36, 発行日 1998-11-26 |
|||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
