Cart (Loading....) | Create Account
Close category search window
 

Prediction of Interacting Motif Pairs Using Stochastic Boosting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jisu Kim ; Sch. of Comput. Sci. & Eng., Inha Univ., Inchon ; Byungkyu Park ; Kyungsook Han

The recent development of high-throughput experimental methods has generated a large amount of protein interaction data, which is becoming the foundation for new biological discoveries. There are several methods developed for motif discovery, but these methods focus on detecting individual motifs rather than interacting motif pairs. The primary focus of this study is to predict reliable interacting motif pairs from combinations of protein features using a stochastic method. This paper describes an improved boosting algorithm for predicting interacting motif pairs of proteins and a method for generating negative interaction data for the algorithm.

Published in:

Frontiers in the Convergence of Bioscience and Information Technologies, 2007. FBIT 2007

Date of Conference:

11-13 Oct. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.