2009 International Symposium on Intelligent Ubiquitous Computing and Education 2009
DOI: 10.1109/iuce.2009.141
|View full text |Cite
|
Sign up to set email alerts
|

Prediction of Protein Coding Regions by Support Vector Machine

Abstract: With the exponential growth of genomic sequences, there is an increasing demand to accurately identify protein coding regions from genomic sequences. Despite many progresses being made in the identification of protein coding regions by computational methods during recent years, the performances and efficiencies of the prediction methods still need to be improved. A novel method to predict the position of coding regions is proposed. First, a support vector machine is used as a classifier to recognize the first … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…The candidate features are determined using Markov-chain Monte Carlo (MCMC) sampler. ANN [42] Optimal Weight Vector ---TDNN [43] Weight Matrix ---FFNN [44] Data Window Slide -0.66 0.69 BPNN [7] Sliding Window ---ANN [2] Orthogonal Encoding -0.97 -Naive Bayes [2] Orthogonal Encoding -0.63 -SVM [23] -7-cross validation 0.80 0.82 SVM [48] Binary Feature Mapping Rule -0.99 0.99 SVM [52] Sparse Encoding 5-cross validation 0.96 0.95 FFBPNN [45] RS (Random sub-sampling) 5-cross validation 0.77 0.76 RVM [61] MCMC (Markov Chain Monte Carlo) sampler -0.60 0.56 SVM [54] Base-stacking energy of dinucleotides 5-cross validation 0.67 0.77…”
Section: Other Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The candidate features are determined using Markov-chain Monte Carlo (MCMC) sampler. ANN [42] Optimal Weight Vector ---TDNN [43] Weight Matrix ---FFNN [44] Data Window Slide -0.66 0.69 BPNN [7] Sliding Window ---ANN [2] Orthogonal Encoding -0.97 -Naive Bayes [2] Orthogonal Encoding -0.63 -SVM [23] -7-cross validation 0.80 0.82 SVM [48] Binary Feature Mapping Rule -0.99 0.99 SVM [52] Sparse Encoding 5-cross validation 0.96 0.95 FFBPNN [45] RS (Random sub-sampling) 5-cross validation 0.77 0.76 RVM [61] MCMC (Markov Chain Monte Carlo) sampler -0.60 0.56 SVM [54] Base-stacking energy of dinucleotides 5-cross validation 0.67 0.77…”
Section: Other Methodsmentioning
confidence: 99%
“…[5,50] In bioinformatics, applications of SVM includes splice site prediction, promoter prediction, host-pathogen separation. [51][52][53] The method explained in [22] uses statistical data for classification of promoter instead of features like TATA boxes, CAAT boxes and CpG islands. Sensitvity and specificity values attained using tetramer frequencies of bases is above 80%, still there is an opportunity for enhancement in the accuracy obtained.…”
Section: Support Vector Machinementioning
confidence: 99%
See 1 more Smart Citation
“…Meanwhile, the sliding window size is relevant to prediction performance, the use of a smaller size can increase the accuracy on the border of exon but leads to of higher rate of false positive prediction Hatzigeorgiou et al (1996). They Hatzigeorgiou et al (1996); Shuo and Yi-sheng (2009) use 91 whereas we adopt 90 in practice for convenience of counting the number of codons. The slight difference has almost no effect on the prediction performance.…”
Section: Hybrid Encodingmentioning
confidence: 99%
“…It is a common phenomenon that nucleotide sequences in DNA perform a period three property [3,11] due to codon composition and structure in the strand. This fundamental characteristic can be exploited to predict the codon regions that help in determination of RNA sequences in DNA.…”
Section: Introductionmentioning
confidence: 99%