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...

Full description

Main Author: HING, RATANA
Format: Thesis
Language: English
Institution: Universiti Teknologi Petronas
Record Id / ISBN-0: utp-utpedia.22683 /
Published: 2013
Subjects:
Online Access: http://utpedia.utp.edu.my/22683/1/20442C~1.PDF
http://utpedia.utp.edu.my/22683/
Tags: Add Tag
No Tags, Be the first to tag this record!
id utp-utpedia.22683
recordtype eprints
spelling utp-utpedia.226832022-02-22T06:43:06Z http://utpedia.utp.edu.my/22683/ COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM HING, RATANA QA75 Electronic computers. Computer science 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. 2013 Thesis NonPeerReviewed application/pdf en http://utpedia.utp.edu.my/22683/1/20442C~1.PDF HING, RATANA (2013) COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM. Masters thesis, UTP.
institution Universiti Teknologi Petronas
collection UTPedia
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
HING, RATANA
COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
description 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.
format Thesis
author HING, RATANA
author_sort HING, RATANA
title COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
title_short COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
title_full COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
title_fullStr COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
title_full_unstemmed COMPUTER ALGORITHMS FOR A FUNDAMENTAL PROBLEM IN BIOINFORMATICS: THE "PROTEIN LOOP CLOSURE" PROBLEM
title_sort computer algorithms for a fundamental problem in bioinformatics: the "protein loop closure" problem
publishDate 2013
url http://utpedia.utp.edu.my/22683/1/20442C~1.PDF
http://utpedia.utp.edu.my/22683/
_version_ 1741195850474848256
score 11.62408