東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computational genomic signatures and...

Nalbantoglu, Ozkan Ufuk.

FindBook

Google Book

Amazon

博客來

Computational genomic signatures and metagenomics.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computational genomic signatures and metagenomics./
作者:	Nalbantoglu, Ozkan Ufuk.
面頁冊數:	200 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .
Contained By:	Dissertation Abstracts International72-06B.
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3450325
ISBN:	9781124588902

Computational genomic signatures and metagenomics.
Nalbantoglu, Ozkan Ufuk.

Computational genomic signatures and metagenomics. - 200 p.

Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .

Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2011.

Mathematical characterizations of biological sequences form one of the main elements of bioinformatics. In this work, a class of DNA sequence characterization, namely computational genomics signatures, which capture global features of these sequences is used to address emerging computational biology challenges. Because of the species specificity and pervasiveness of genome signatures, it is possible to use these signatures to characterize and identify a genome or a taxonomic unit using a short genome fragment from that source. However, the identification accuracy is generally poor when the sequence model and the sequence distance measure are not selected carefully. We show that the use of relative distance measures instead of absolute metrics makes it possible to obtain better detection accuracy. Furthermore, the use of relative metrics can create opportunities for using more complex models to develop genome signatures, which cannot be used efficiently when conventional distance measures are used.

ISBN: 9781124588902Subjects--Topical Terms:

1669061
Engineering, Computer.

Computational genomic signatures and metagenomics.
LDR:03528nam 2200325 4500 001 1403048
005 20111108080402.5
008 130515s2011 ||||||||||||||||| ||eng d
020 $a 9781124588902
035 $a (UMI)AAI3450325
035 $a AAI3450325
040 $a UMI $c UMI
100 1 $a Nalbantoglu, Ozkan Ufuk. $3 1682283
245 1 0 $a Computational genomic signatures and metagenomics.
300 $a 200 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .
500 $a Adviser: Khalid Sayood.
502 $a Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2011.
520 $a Mathematical characterizations of biological sequences form one of the main elements of bioinformatics. In this work, a class of DNA sequence characterization, namely computational genomics signatures, which capture global features of these sequences is used to address emerging computational biology challenges. Because of the species specificity and pervasiveness of genome signatures, it is possible to use these signatures to characterize and identify a genome or a taxonomic unit using a short genome fragment from that source. However, the identification accuracy is generally poor when the sequence model and the sequence distance measure are not selected carefully. We show that the use of relative distance measures instead of absolute metrics makes it possible to obtain better detection accuracy. Furthermore, the use of relative metrics can create opportunities for using more complex models to develop genome signatures, which cannot be used efficiently when conventional distance measures are used.
520 $a Using a relative distance measure and a model based on the relative abundance of oligonucleotides in a genome fragment, a novel genome signature was defined. This signature was employed to address a class of metagenomics problems. The metagenomics approach enables sampling and sequencing of a microbial community without isolating and culturing single species. Determining the taxonomic classification of the bacterial species within the microbial community from the mixture of short DNA fragments is a difficult computational challenge. We present supervised and unsupervised algorithms for taxonomic classification of metagenomics data and demonstrate their effectiveness on simulated and real-world data. The supervised algorithm, RAIphy, classifies metagenome fragments of unknown origin by assigning them to the taxa, defined in a signature database of previously sequenced microbial genomes. The signatures in the database are updated iteratively during the classification process. Most metagenomics samples include unidentified species, thus they require clustering. Pseudo-assembly of fragments, followed by clustering of taxa is employed in the unsupervised setting. The signatures developed in this work are more specific-specific and pervasive than any signatures currently available in the literature, and demonstrate the potential and viability of using genome signatures to solve various metagenomics problems as well as other challenges in computational biology.
590 $a School code: 0138.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Biology, Bioinformatics. $3 1018415
690 $a 0464
690 $a 0715
710 2 $a The University of Nebraska - Lincoln. $b Electrical Engineering. $3 1058470
773 0 $t Dissertation Abstracts International $g 72-06B.
790 1 0 $a Sayood, Khalid, $e advisor
790 1 0 $a Balkir, Sina $e committee member
790 1 0 $a Scott, Stephen D. $e committee member
790 1 0 $a Hoffman, Michael W. $e committee member
790 $a 0138
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3450325