COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
The "protein loop closure" problem is a fundamental problem in bioinformatics. Thebackbone of a protein is a kinematic chain. When using current techniques to try to get a "picture" of a protein, there are limitations. Whilst we can "see" most ofthe backbone, there a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://utpedia.utp.edu.my/id/eprint/22683/1/20442C~1.PDF http://utpedia.utp.edu.my/id/eprint/22683/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Petronas |
| Language: | English |
| Summary: | The "protein loop closure" problem is a fundamental problem in bioinformatics.
Thebackbone of a protein is a kinematic chain. When using current techniques to try
to get a "picture" of a protein, there are limitations. Whilst we can "see" most ofthe
backbone, there are parts that current techniques do not show. We need to fill in any
gaps in the "picture", as thebackbone defines thetype of protein. From computational
perspective, the "protein loop closure" problem can be viewed as an inverse
kinematics problem. Inverse kinematics can be bestthought of in terms of a robotic
arm comprising of several links connected by joints. |
|---|