By Topic

Preliminary Results for GAMI: A Genetic Algorithms Approach to Motif Inference

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

7 Author(s)
C. B. Congdon ; Department of Computer Science, Colby College, Waterville, ME, 04901, Email: ccongdon@colby.edu ; C. W. Fizer ; N. W. Smith ; H. R. Gaskins
more authors

We have developed GAMI, an approach to motif inference that uses a genetic algorithms search and is designed specifically to work with divergent species and possibly long nucleotide sequences. The system design reduces the size of the search space as compared to typical window-location approaches for motif inference. This paper describes the motivation and system design for GAMI, discusses how we have designed the search space and compares this to the search space of other approaches, and presents initial results with data from the literature and from novel tasks. GAMI is able to find a host of putative conserved patterns; possible approaches for validating the utility of the conserved regions are discussed.

Published in:

2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology

Date of Conference:

14-15 Nov. 2005