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

Finding transcription factor binding sites based on multiple pairwise alignment

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

2 Author(s)
Xianhua Dai ; Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., China ; Zhiming Dai

The motif detection problem has been well studied and several algorithms have been developed in the past few years. Although some are better than the others in a sense, yet not a single one is recognized to be the best. However, since Pevzner and Sze defined a "challenge problem" in motif detection, most of the algorithms, which were considered to be good, have showed their inability to solve this problem. Then some new algorithms have been proposed to solve this "challenge problem", but the computation cost is a big problem all the same. In this paper, we present a new method based on multiple pairwise alignment to solve the "challenge problem" with less computation cost than the existing methods. This new method combines profile-driven method with pattern-driven method. So it has the advantages of both profile-driven method and pattern-driven method. It has high success rate in finding the motif and less computation cost. We refer to the new method as FMMPA (finding motif based on multiple pairwise alignment).

Published in:

Intelligent Signal Processing and Communication Systems, 2005. ISPACS 2005. Proceedings of 2005 International Symposium on

Date of Conference:

13-16 Dec. 2005

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.