원문정보
보안공학연구지원센터(IJBSBT)
International Journal of Bio-Science and Bio-Technology
Vol.5 No.2
2013.04
pp.141-150
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. This idea is very insightful for solving bioinformatics problems. Aligning distantly related protein sequences is a long-standing problem in bioinformatics and a key for successful protein structure prediction. A fast and valid algorithm can benefit the whole process of biology research. In this paper, we introduce an algorithm that given a certain evaluation function, will calculate the optimal alignment by dynamic programming.
목차
Abstract
1. Introduction
1.1. Background
1.2. Our Result
2. Dynamic Programming
2.1. The Algorithm
2.2. The Tool: BioConductor
2.3. The Result
2.4. Remarks
3. Local Search Alignment
3.1 The Algorithm
3.2 The Tool: BLAST
3.3 The Result
4. Progressive Alignment
4.1 The Algorithm
4.2 The Tool: ClustalW
4.3 The Result
5. Online Tools Implementations
5.1 MultiIdent
5.2 EGM
5.3 FASTA
5.4 FFAS
References
1. Introduction
1.1. Background
1.2. Our Result
2. Dynamic Programming
2.1. The Algorithm
2.2. The Tool: BioConductor
2.3. The Result
2.4. Remarks
3. Local Search Alignment
3.1 The Algorithm
3.2 The Tool: BLAST
3.3 The Result
4. Progressive Alignment
4.1 The Algorithm
4.2 The Tool: ClustalW
4.3 The Result
5. Online Tools Implementations
5.1 MultiIdent
5.2 EGM
5.3 FASTA
5.4 FFAS
References
저자정보
참고문헌
자료제공 : 네이버학술정보