By Topic

Motifs recognition in DNA sequences comparing the motif finding automaton algorithm against a traditional approach

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

5 Author(s)
Magallanes, Y. ; Univ. de las Americas, Puebla, Mexico ; Olmos, I. ; Osorio, M. ; Peredo, L.O.
more authors

This paper presents the comparison between algorithms used to find inexact motifs (transformed into a set of exact sub-sequences) in a DNA sequence. The MFA algorithm builds an automaton that searches for the set of exact sub-sequences by building a finite automaton in a similar way to the KMP algorithm. This algorithm is compared against the traditional automaton using the basic idea of the subset construction. This traditional algorithm is implemented using some characteristics to increase its performance which will end in an algorithm that can be proven to have the optimal number of states.

Published in:

Electronics, Communications and Computer (CONIELECOMP), 2010 20th International Conference on

Date of Conference:

22-24 Feb. 2010