A classification of alternatively spliced cassette exons using AdaBoost-based algorithm

  • Liang Li
  • , Qinke Peng
  • , Adnan Shakoor
  • , Tao Zhong
  • , Shiquan Sun
  • , Xiao Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Alternative splicing (AS) is a mechanism for generating different gene transcripts (called isoforms) from the same genomic sequence. Accurate classification of alternative splicing is important for understanding the mechanism of gene regulation. Although the different algorithms are applied to classify AS, the accuracy of these algorithms are still unsatisfactory. In this paper, we propose a new classification algorithm to classify the cassette exons and constitutive exons with existed and new features based on the AdaBoost algorithm. Experimental results show that the accuracy is higher than current algorithms. The sensitivity is 81.92% and the specificity is 74.06%, namely that 81.92% of cassette exons and 74.06% of constitutive exons were correctly classified.

Original languageEnglish
Title of host publication2014 IEEE International Conference on Information and Automation, ICIA 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages370-375
Number of pages6
ISBN (Electronic)9781479941001
DOIs
StatePublished - 21 Oct 2014
Event2014 IEEE International Conference on Information and Automation, ICIA 2014 - Hailar, Hulunbuir, China
Duration: 28 Jul 201430 Jul 2014

Publication series

Name2014 IEEE International Conference on Information and Automation, ICIA 2014

Conference

Conference2014 IEEE International Conference on Information and Automation, ICIA 2014
Country/TerritoryChina
CityHailar, Hulunbuir
Period28/07/1430/07/14

Keywords

  • AdaBoost
  • Alternative splicing
  • Cassette exon
  • Maximum entropy

Fingerprint

Dive into the research topics of 'A classification of alternatively spliced cassette exons using AdaBoost-based algorithm'. Together they form a unique fingerprint.

Cite this