東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Development and testing of algorithm...

Ramaraj, Thiruvarangan.

Linked to FindBook

Google Book

Amazon

博客來

Development and testing of algorithmic solutions for problems in computational genomics and proteomics.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Development and testing of algorithmic solutions for problems in computational genomics and proteomics./
Author:	Ramaraj, Thiruvarangan.
Description:	148 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-07, Section: B, page: 4355.
Contained By:	Dissertation Abstracts International71-07B.
Subject:	Biology, Bioinformatics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3408948
ISBN:	9781124055930

Development and testing of algorithmic solutions for problems in computational genomics and proteomics.
Ramaraj, Thiruvarangan.

Development and testing of algorithmic solutions for problems in computational genomics and proteomics. - 148 p.

Source: Dissertation Abstracts International, Volume: 71-07, Section: B, page: 4355.

Thesis (Ph.D.)--Montana State University, 2010.

This dissertation covers three subjects: (i) computational characterization of Antigen (Ag)-Antibody (Ab) interactions; (ii) a novel and effective algorithm to predict the epitope of a protein based on an antibody imprinting technique; (iii) a comparison of existing de novo genome assembler algorithms targeted specifically at the assembly of data generated by Illumina (Solexa) short-read sequencing technology, and suggestions for their improvement.

ISBN: 9781124055930Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Development and testing of algorithmic solutions for problems in computational genomics and proteomics.
LDR:03282nam 2200349 4500 001 1399863
005 20110930095852.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124055930
035 $a (UMI)AAI3408948
035 $a AAI3408948
040 $a UMI $c UMI
100 1 $a Ramaraj, Thiruvarangan. $3 1678875
245 1 0 $a Development and testing of algorithmic solutions for problems in computational genomics and proteomics.
300 $a 148 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-07, Section: B, page: 4355.
500 $a Adviser: Brendan M. Mumey.
502 $a Thesis (Ph.D.)--Montana State University, 2010.
520 $a This dissertation covers three subjects: (i) computational characterization of Antigen (Ag)-Antibody (Ab) interactions; (ii) a novel and effective algorithm to predict the epitope of a protein based on an antibody imprinting technique; (iii) a comparison of existing de novo genome assembler algorithms targeted specifically at the assembly of data generated by Illumina (Solexa) short-read sequencing technology, and suggestions for their improvement.
520 $a The first part focuses on identification, characterization and understanding the ways in which the antibodies and antigens interact. We analyze Epitope/Paratope region using a large dataset of Ag-Ab complex structural data taken from the PDB. Epitope/Paratope regions in our dataset have been characterized in terms of their size, average amino acid residue composition, residue-residue pairing preferences, and residue dispersion in the epitope and paratope regions. This analysis provides a more up-to-date picture of the Ag-Ab interface and provides new insights into the role of residue composition and distribution in Ag-Ab recognition. The above analysis helps in obtaining a refined substitution matrix optimized for antibody imprinting technique and used to improve the effectiveness of the epitope prediction algorithms that have also been developed and are the second focus of the thesis.
520 $a The third and the final part focus on the de novo genome assembly problems. The genome assembly programs takes the short reads generated by Whole genome shotgun sequencing technology and computationally reconstructs the genome. For the genome assembly problem the connections between read length, read type, repeat complexity, quality score and coverage and how these parameters help in improving or diminishing the capability of the assembly programs to assemble the sequence data were studied in depth. At the end of this experimental process it gives us a better understanding of the impact of the above mentioned parameters on the complexity of genome assembly and helps ascertain margins on these parameters of sequence data that enable efficient and accurate assembly by the programs.
590 $a School code: 0137.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a Montana State University. $b Computer Science. $3 1270347
773 0 $t Dissertation Abstracts International $g 71-07B.
790 1 0 $a Mumey, Brendan M., $e advisor
790 1 0 $a Jesaitis, Al $e committee member
790 1 0 $a Dratz, Ed $e committee member
790 1 0 $a Starkey, Denbigh $e committee member
790 1 0 $a Mudge, Joann $e committee member
790 $a 0137
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3408948