Promoter Prediction in DNA Sequences

碩士 === 國立中山大學 === 資訊工程學系研究所 === 91 === Recently, the prediction of promoters has attracted many researchers'' attention. Unfortunately, most previous prediction algorithms did not provide high enough sensitivity and specificity. The goal of this thesis is to develop an efficient prediction...

Full description

Bibliographic Details
Main Authors: Jih-Wei Huang, 黃繼緯
Other Authors: Chang-Biau Yang
Format: Others
Language:en_US
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/17159645528215501061
id ndltd-TW-091NSYS5392025
record_format oai_dc
spelling ndltd-TW-091NSYS53920252016-06-22T04:20:46Z http://ndltd.ncl.edu.tw/handle/17159645528215501061 Promoter Prediction in DNA Sequences DNA序列之啟動區預測方法 Jih-Wei Huang 黃繼緯 碩士 國立中山大學 資訊工程學系研究所 91 Recently, the prediction of promoters has attracted many researchers'' attention. Unfortunately, most previous prediction algorithms did not provide high enough sensitivity and specificity. The goal of this thesis is to develop an efficient prediction algorithm that can increase the detection power (power = 1 - false negative). We do not try to find more distinct features in promoters one by one, such as transcriptional elements. Our main idea is to use the computer power to calculate all possible patterns which are the possible features of promoters. Accordingly, we shall define some scoring methods for training a given set of sequences, which involve promoter sequences and non-promoter sequences. Then, we can obtain a threshold value for determining whether a testing sequence is a promoter or not. By the experimental results, our prediction has higher correct rate than other previous methods. Chang-Biau Yang 楊昌彪 2003 學位論文 ; thesis 33 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立中山大學 === 資訊工程學系研究所 === 91 === Recently, the prediction of promoters has attracted many researchers'' attention. Unfortunately, most previous prediction algorithms did not provide high enough sensitivity and specificity. The goal of this thesis is to develop an efficient prediction algorithm that can increase the detection power (power = 1 - false negative). We do not try to find more distinct features in promoters one by one, such as transcriptional elements. Our main idea is to use the computer power to calculate all possible patterns which are the possible features of promoters. Accordingly, we shall define some scoring methods for training a given set of sequences, which involve promoter sequences and non-promoter sequences. Then, we can obtain a threshold value for determining whether a testing sequence is a promoter or not. By the experimental results, our prediction has higher correct rate than other previous methods.
author2 Chang-Biau Yang
author_facet Chang-Biau Yang
Jih-Wei Huang
黃繼緯
author Jih-Wei Huang
黃繼緯
spellingShingle Jih-Wei Huang
黃繼緯
Promoter Prediction in DNA Sequences
author_sort Jih-Wei Huang
title Promoter Prediction in DNA Sequences
title_short Promoter Prediction in DNA Sequences
title_full Promoter Prediction in DNA Sequences
title_fullStr Promoter Prediction in DNA Sequences
title_full_unstemmed Promoter Prediction in DNA Sequences
title_sort promoter prediction in dna sequences
publishDate 2003
url http://ndltd.ncl.edu.tw/handle/17159645528215501061
work_keys_str_mv AT jihweihuang promoterpredictionindnasequences
AT huángjìwěi promoterpredictionindnasequences
AT jihweihuang dnaxùlièzhīqǐdòngqūyùcèfāngfǎ
AT huángjìwěi dnaxùlièzhīqǐdòngqūyùcèfāngfǎ
_version_ 1718318452458913792