|
JAIST Repository >
JAIST >
Theses >
Doctor of Philosophy（Information Science） >
R03) (Jun.2021 - Mar.2022 >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/17791
|
| Title: | 蛋白質の折りとデザインに応⽤を持つグラフ埋め込み問題の計算複雑さ |
| Authors: | Feng, Tianfeng |
| Authors(alternative): | ふぇん, ていあんふぇん |
| Keywords: | protein folding problem
HP (hydrophobic-polar) model
embedding problem
Hamiltonian path problem
edge-weighted Eulerian path problem |
| Issue Date: | Mar-2022 |
| Description: | Supervisor: 上原 隆平
先端科学技術研究科
博士 |
| Title(English): | "Computational Complexity of Graph Embedding Problems Inspired by Protein Folding and Design |
| Authors(English): | Feng, Tianfeng |
| Language: | eng |
| URI: | https://hdl.handle.net/10119/17791 |
| Academic Degrees and number: | 甲第1296号 |
| Degree-granting date: | 2022-03-24 |
| Degree name: | 博士(情報科学) |
| Degree-granting institutions: | 北陸先端科学技術大学院大学 |
| Appears in Collections: | D-IS. 2021年度(R03) (Jun.2021 - Mar.2022)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| abstract.pdf | 要旨 | 77Kb | Adobe PDF | View/Open | | paper.pdf | 本文 | 2935Kb | Adobe PDF | View/Open | | summary.pdf | 内容の要旨及び論文審査の結果の要旨 | 289Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
