By Topic

Extending Pattern Branching to Handle Challenging Instances

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
$33 $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

1 Author(s)
Jaime Davila ; University of Connecticut

We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact algorithms that solves this problem is pattern branching [10], however this algorithm fails to solve challenging instances such as (15, 5) in most cases. In this paper we discuss a simple extension to this algorithm and an implementation of it that allows us to tackle challenging instances such as (15, 5) and (17, 6) with accuracy close to 100%

Published in:

Sixth IEEE Symposium on BioInformatics and BioEngineering (BIBE'06)

Date of Conference:

16-18 Oct. 2006