By Topic

A Graph Based Approach to Discover Conserved Regions in DNA and Protein Sequences

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)
Challa, S. ; Dept. of Comput. Sci., Manitoba Univ., Winnipeg, MB ; Thulasiraman, P.

This paper attempts to provide a graph based approach to discover conserved regions such as motifs in either DNA or Protein sequences. The motif discovery problem has gained lot of significance in biological science over the past decade. Lately various approaches have been used successfully to discover motifs. Some of them are based on probabilistic approach and the others on a combinatorial approach. We have followed a graph-based combinatorial approach to solve this problem, in particular, using the idea of de Bruijn graphs. The de Bruijn graph has been successfully adopted to solve problems such as local alignment and DNA fragment assembly. Our method harnesses the power of the de Bruijn graph to discover the conserved regions in a DNA or protein sequence. We have found that the algorithm was successful in mining signals for larger number of sequences and at a faster rate when compared to some popular motif searching tools.

Published in:

Advanced Information Networking and Applications Workshops, 2007, AINAW '07. 21st International Conference on  (Volume:1 )

Date of Conference:

21-23 May 2007