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

An algorithm for mining frequent patterns in biological sequence

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)

Most of the existing algorithms for mining frequent patterns could produce lots of projected databases and short patterns which could increase the time and memory cost of mining. In order to overcome such shortcoming, a fast and efficient algorithm named FBPM for mining frequent patterns in biological sequence is proposed. We first present the concept of primary pattern, and then use prefix tree for mining frequent primary patterns. A pattern growth approach is also presented to mine all the frequent patterns without producing large amount of irrelevant patterns. Our experimental results show that FBPM not only improves the performance but also achieves effective mining results.

Published in:

Computational Advances in Bio and Medical Sciences (ICCABS), 2011 IEEE 1st International Conference on

Date of Conference:

3-5 Feb. 2011

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.