政府計畫(GRB),建議「依年度遞減排序」,以查看最新的研究方向。
畢業學年度 | 論文標題 | 連結 | 學位 | 畢業時長(years) |
---|---|---|---|---|
關鍵字 | ||||
113 | 以科技管理... 以科技管理角度探討3C科技設計迷思 (Discuss the myths of 3C technology design from the perspective of technology management) | NTHU | 博 | 暫無口試日期 |
科技管理(techology-management)、盲人(blind)、情境感知(content-aware) 科技管理(... | ||||
112 | 基於單切斷... 基於單切斷或重接距離的多參考支架問題研究 (A Study of Multiple Reference Scaffolding Problem Based on Single-Cut-or-Join Distance) | NTHU NDLTD | 碩 | 2.00 |
生物資訊(bioinformatics)、支架問題(scaffolding problem)、整數線性規劃(integer linear programming)、單切斷或重接距離(Single-Cut-or-Join Distance) 生物資訊(... | ||||
112 | 基於偽範例... 基於偽範例鄰接數的單參考支架問題研究 (A Study of Single Reference Scaffolding Problem Based on Pseudo-Exemplar Adjacency Number) | NTHU NDLTD | 碩 | 2.00 |
支架(Scaffolding)、鄰接數(Adjacency Number)、偽範例(Pseudo-Exemplar) 支架(Sc... | ||||
112 | 基於居中配... 基於居中配對模式之雙切斷並重接距離的支架問題研究 (A Study of Single Reference Scaffolding Problem Based on Intermediate Double-Cut-and-Join Distance) | NTHU NDLTD | 碩 | 1.99 |
支架問題(Scaffolding)、演算法(Algorithm)、雙切斷並重接距離(Double-Cut-and-Join distance)、整數線性規劃(Integer linear programming)、居中配對模式(Intermediate matching) 支架問題(... | ||||
112 | 一個具有最... 一個具有最穩定二級結構和最佳密碼子使用的密碼子優化改進演算法 (An Improved Algorithm for Codon Optimization with Most Stable Secondary Structure and Optimal Codon Usage) | NTHU NDLTD | 碩 | 1.99 |
密碼子優化(codon)、演算法(RNA)、二級結構(optimization)、RNA(greedy)、動態規劃演算法(dynamic-programming) 密碼子優化... | ||||
112 | 使用大語言... 使用大語言模型整合與建構腦連接圖譜的功能探索應用 (Application for Functional Exploration of Brain Connectomics Constructed and Integrated Using Large Language Models) | NTHU NDLTD | 碩 | 1.88 |
連接體探索(Connectomics Exploration)、果蠅腦(Fly Brain)、大語言模型應用(LLM Application) 連接體探索... | ||||
111 | 二級結構穩... 二級結構穩定性及密碼子優化之演算法 (Algorithms for Codon Optimization with the Stability of Secondary Structure) | NTHU NDLTD | 碩(提早入學) | 2.48 |
密碼子優化(codon)、演算法(RNA)、二級結構(optimization)、RNA(greedy)、動態規劃演算法(dynamic-programming)、貪婪演算法(secondary-structure) 密碼子優化... | ||||
111 | 一個解決範... 一個解決範例斷點距離支架問題的改良演算法 (An Improved Algorithm for Solving Scaffolding Problem Based on Exemplar Breakpoint Distance) | NTHU NDLTD | 碩 | 1.99 |
支架問題(Scaffolding)、範例配對(Exemplar-matching)、斷點距離(Breakpoint-Distance) 支架問題(... | ||||
111 | 根據最內不... 根據最內不可縮小保守區間支架問題的研究 (A Study of the Two-sided Scaffolding Problem Based on Most-Inner Irreducible Conserved Intervals) | NTHU NDLTD | 碩 | 1.99 |
基因定序(scaffolding)、演算法(contig)、不可縮小保守區間(Irreducible Conserved Interval) 基因定序(... | ||||
111 | 基於最少配... 基於最少配對之雙切斷並重接距離的Scaffolding問題改良演算法 (An Improved Algorithm for Scaffolding Problem Based on Exemplar Double-cut-and-join Distance) | NTHU NDLTD | 碩 | 1.99 |
基因定序(scaffolding problem)、雙切斷並重接距離(double-cut-and-join distance)、最少配對(exemplar matching)、整數線性規劃(integer linear programming) 基因定序(... | ||||
110 | 根據雙切斷... 根據雙切斷並重接距離解決Scaffolding問題的改良演算法 (An Improved Algorithm for Solving Scaffolding Problem Based on Double-cut-and-join Distance) | NTHU NDLTD | 碩 | 1.99 |
雙切斷並重接(double-cut-and-join)、演算法(algorithm)、基因體組裝(scaffolding)、最大配對模式(maximum matching)、整數線性規劃(integer linear programming)、次世代定序(next generation sequencing) 雙切斷並重... | ||||
110 | 具有最不穩... 具有最不穩定二級結構的密碼子優化演算法 (Algorithms for Codon Optimization with the Most Unstable Secondary Structure) | NTHU NDLTD | 碩 | 1.99 |
密碼子優化(codon optimization)、二級結構(secondary structure)、整數線性規劃(integer linear programming) 密碼子優化... | ||||
110 | 具有最穩定... 具有最穩定二級結構的密碼子優化之演算法 (Algorithms for Codon Optimization with the Most Stable Secondary Structure) | NTHU NDLTD | 碩 | 1.99 |
密碼子優化(Codon optimization)、二級結構(Secondary structure)、密碼子偏好性(Codon bias) 密碼子優化... | ||||
110 | 根據不可縮... 根據不可縮小保守區間支架問題的研究 (A study of the scaffolding problem based on Irreducible conserved intervals) | NTHU NDLTD | 碩 | 1.99 |
支架問題(scaffolding problem)、不可縮小保守區間(irreducible conserved interval)、次世代定序(next generation sequencing) 支架問題(... | ||||
109 | 根據保留區... 根據保留區間距離解決Scaffolding問題之研究 (The Study of Solving Scaffolding Problem Based on Conserved Interval Distance) | NTHU NDLTD | 碩 | 3.00 |
保留區間(scaffolding) 保留區間(... | ||||
109 | 尋找多目標... 尋找多目標密碼子優化的柏拉圖最佳解之有效率演算法 (Efficient Algorithms for Finding Pareto-optimal Solutions of Multi-objective Codon Optimization) | NTHU NDLTD | 碩 | 2.00 |
密碼子優化(Codon Optimization)、柏拉圖最佳解(Pareto-optimal solutions)、整數線性規劃演算法(Integer linear programming)、動態規劃演算法(Dyanmic programming) 密碼子優化... | ||||
109 | 解決多目標... 解決多目標密碼子優化的有效率演算法 (Efficient Algorithms for Solving Multi-objective Codon Optimization) | NTHU NDLTD | 碩 | 2.00 |
密碼子優化(codon optimization)、動態規劃(dynamic programming)、整數線性規劃(integer linear programming) 密碼子優化... | ||||
109 | 根據雙切斷... 根據雙切斷並重接距離解決 Scaffolding 問題之研究 (The Study of Solving Scaffolding Problem Based on Double-cut-and-join Distance) | NTHU NDLTD | 碩 | 2.00 |
雙切斷並重接(double-cut-and-join)、演算法(algorithm)、基因體組裝(scaffolding)、最大配對模式(maximum matching)、整數線性規劃(integer linear programming)、次世代定序(next generation sequencing) 雙切斷並重... | ||||
108 | 根據最少配... 根據最少配對模式解決Scaffolding問題的改良演算法 (An Improved Algorithm for Solving Scaffolding Problem Based on Exemplar Model) | NTHU NDLTD | 碩 | 2.00 |
演算法(algorithm)、基因體組裝(scaffolding problem)、最少配對模型(exemplar model)、整數線性規劃(integer linear programming)、生物資訊(bioinformatics)、次世代定序(next generation sequencing) 演算法(a... | ||||
108 | 根據居中配... 根據居中配對模式解決Scaffoding問題之改進演算法 (An Improved Algorithm for Solving Scaffolding Problem Based on Intermediate Model) | NTHU NDLTD | 碩 | 2.00 |
生物資訊(bioinformatics)、演算法(algorithm)、基因組組裝(scaffolding problem)、居中配對模式(intermediate model)、整數線性規劃(integer linear programming)、次世代定序(next generation sequencing)、重複組裝(repeatedly scaffolding) 生物資訊(... | ||||
108 | 根據最多配... 根據最多配對模式解決Scaffolding問題之改進演算法 (An Improved Algorithm for Solving Scaffolding Problem Based on Maximum-Matching Model) | NTHU NDLTD | 碩 | 2.00 |
演算法(algorithm)、基因體組裝(scaffolding problem)、最多配對模式(maximum-matching model)、整數線性規劃(integer linear programming)、次世代定序(bioinformatics)、生物資訊(next generation sequencing) 演算法(a... | ||||
107 | 一個多重參... 一個多重參考式Scaffolding工具的網路伺服器 (A Web Server of Multiple Reference Based Scaffolding Tool) | NTHU NDLTD | 碩 | 2.00 |
演算法(algorithm)、基於多從參考式的scaffolding(Multiple reference-based scaffolding)、網路伺服器(web server)、權重機制(weighting scheme)、生物資訊(Bioinformatics)、次世代定序(next generation sequencing) 演算法(a... | ||||
107 | 根據居中配... 根據居中配對模式解決scaffolding之研究 (The Study of Solving Scaffolding Problem Based on Intermediate-matching Model) | NTHU NDLTD | 碩 | 2.00 |
演算法(algorithm)、基因體組裝(scaffolding problem)、居中配對模式(intermediate-matching model)、整數線性規劃(integer linear programming)、生物資訊(bioinformatics)、次世代定序(next generation sequencing) 演算法(a... | ||||
107 | 根據最多配... 根據最多配對模式解決Scaffolding問題之研究 (The Study of Solving Scaffolding Problem Based on Maximum-matching Model) | NTHU NDLTD | 碩 | 2.00 |
演算法(algorithm)、基因體組裝(scaffolding problem)、最多配對模式(maximum-matching model)、整數線性規劃(integer linear programming)、生物資訊(bioinformatics)、次世代定序(next generation sequencing) 演算法(a... | ||||
107 | 根據最少配... 根據最少配對模式解決 Scaffolding 問題之研究 (The Study of Solving Scaffolding Problem Based on Exemplar Model) | NTHU NDLTD | 碩 | 2.00 |
演算法(algorithm)、基因體組裝(scaffolding problem)、最少配對模型(exemplar model)、整數線性規劃(integer linear programming)、生物資訊(bioinformatics)、次世代定序(next generation sequencing) 演算法(a... | ||||
107 | 根據最多配... 根據最多配對模式解決Scaffolding問題的啟發式演算法 (A Heuristic Algorithm for Solving Scaffolding Problem Based on Maximum-matching Model) | NTHU NDLTD | 碩(提早入學) | 3.00 |
基因體組裝(contig scaffolding)、最多配對模式(maximum-matching model)、基因體重組(genome rearrangement)、重複序列標記(duplicate sequence marker) 基因體組裝... | ||||
107 | 根據最少配... 根據最少配對模式解決scaffolding問題的啟發式演算法 (A Heuristic Algorithm for Solving Scaffolding Problem Based on Exemplar Model) | NTHU NDLTD | 碩 | 2.50 |
基因體組裝(contig scaffolding)、啟發式演算法(heuristic algorithm)、重組距離(exemplar model)、最少配對模型(breakpoint distance) 基因體組裝... | ||||
106 | 利用基因體... 利用基因體重組決定序列片段的次序與方向 (Scaffolding Contigs Using Genome Rearrangements) | NTHU NDLTD | 博 | 4.97 |
演算法(Algorithm)、生物資訊(Bioinformatics)、基因體(Genome)、序列片段(Contig)、支架(Scaffold)、定序與定向(Ordering and orientation) 演算法(A... | ||||
105 | R3D-B... R3D-BLAST2: 一個改良相似RNA三級子結構的搜尋工具 (R3D-BLAST2: an improved search tool for similar RNA 3D substructures) | NTHU NDLTD | 碩 | 1.92 |
生物資訊(Bioinformatics)、核糖核酸(RNA)、三級結構(Tertiary structure)、BLAST-like搜尋工具(BLAST-like search tool)、結構字母(Structural alphabet) 生物資訊(... | ||||
105 | 利用一個參... 利用一個參考基因體的 Paired-end Reads 來進行 Contig Scaffolding (Contig Scaffolding Using Paired-end Reads from a Reference Genome) | NTHU NDLTD | 碩 | 1.92 |
生物資訊(Bioinformatics)、次世代定序(Next-generation sequencing)、單一參考基因體(Contigs) 生物資訊(... | ||||
105 | 改良的兩個... 改良的兩個RNA三級結構比對 (An Improved Pairwise Alignment of RNA Tertiary Structures) | NTHU NDLTD | 碩 | 1.92 |
生物資訊(Bioinformatics)、核醣核酸三級結構(RNA tertiary structure)、結構比對(Structural alignment)、結構字元(Structural alphabet) 生物資訊(... | ||||
104 | 以BWT建... 以BWT建立方式解決最大重複子字串問題 (On the Construction of the Burrows-Wheeler Transform and the Maximal Repeating Group Finding) | NTHU NDLTD | 碩 | 暫無口試日期 |
最大重複子字串(BWT)、字串比對(Maximal Repeating Groups) 最大重複子... | ||||
104 | 利用一級、... 利用一級、二級與三級結構進行兩個RNA的比對 (Pairwise Alignment of RNAs Using Primary, Secondary and Tertiary Structures) | NTHU NDLTD | 碩 | 暫無口試日期 |
結構比對(RNA)、RNA(undefined) 結構比對(... | ||||
104 | Multi... Multi-CSAR: 一個基於代數重組距離並利用多個參考基因體的Contig Scaffolding工具 (Multi-CSAR: A Cnotig Scaffolding Tool Using Multiple Reference Genomes Based on Algebraic Rearrangement Distance) | NTHU NDLTD | 碩 | 暫無口試日期 |
次世代定序(scaffolding)、多個參考基因體(contig)、代數重組距離(NGS) 次世代定序... | ||||
104 | 繪圖系統開... 繪圖系統開發 (The Development of a Graphic System) | NTHU NDLTD | 碩 | 暫無口試日期 |
繪圖系統(Graphic system) 繪圖系統(... | ||||
104 | CSAR:... CSAR: 一個基於代數重組距離並利用一個參考基因體的Contig Scaffolding工具 (CSAR: A Contig Scaffolding Tool Using Single Reference Genome Based on Algebraic Rearrangement Distance) | NTHU NDLTD | 碩 | 暫無口試日期 |
次世代定序(next generation sequencing)、基因體草圖(drafe genome)、代數重組距離(algebraic rearrangement distance) 次世代定序... | ||||
104 | 區塊限制型... 區塊限制型的序列比對 (Sequence Alignment with Block Constraint) | NTHU NDLTD | 碩 | 暫無口試日期 |
序列比對(sequence alignment)、區塊限制(Block Constraint) 序列比對(... | ||||
103 | 利用一級與... 利用一級與三級結構進行兩個RNA的比對 (Pairwise Alignment of RNA Using Primary and Tertiary Structures) | NTHU NDLTD | 碩 | 暫無口試日期 |
生物資訊(bioinformatics)、核醣核酸三級結構(RNA tertiary structure)、結構比對(structural alignment)、結構字元(structural alphabet)、親合性互動式(affinity propagation) 生物資訊(... | ||||
103 | 一個計算非... 一個計算非重疊反轉與轉位距離的有效率演算法 (An Efficient Algorithm for Computing Non-overlapping Inversion and Transposition Distance) | NTHU NDLTD | 碩 | 暫無口試日期 |
演算法(Algorithm)、計算生物學(computational biology)、反轉(inversion)、轉位(transposition)、突變距離(mutation distance) 演算法(A... | ||||
103 | 利用多個參... 利用多個參考基因體重組DNA片段 (Assembling Contigs Using Multiple Reference Genomes) | NTHU NDLTD | 碩 | 暫無口試日期 |
演算法(Algorithm)、計算生物學(Computational Biology)、DNA片段組裝(Contig Assembly)、多參考式(Multiple Reference) 演算法(A... | ||||
102 | 二元字串的... 二元字串的字首區段互換 (Prefix Block-Interchanges on Binary Strings) | NTHU NDLTD | 碩 | 暫無口試日期 |
演算法(algorithms)、區段互換(block-interchanges)、字首區段互換(prefix block-interchanges)、二元字串(binary strings) 演算法(a... | ||||
102 | 利用非重疊... 利用非重疊的反轉進行近似字串的比對 (Approximate String Matching under Non-Overlapping Inversions) | NTHU NDLTD | 碩 | 暫無口試日期 |
近似字串比對(approximate string matching)、非重疊反轉(non-overlapping inversions)、動態規劃(dynamic programming) 近似字串比... | ||||
101 | 利用反轉與... 利用反轉與區塊互換進行基因體連續片段的重組 (not found) | NTHU NDLTD | 碩 | 暫無口試日期 |
次世代定序、基因體定序、基因體連續片段組裝、反轉、區塊互換 次世代定序... |