Referenced Items are not available for this document.
This paper attempts to provide a new approach to discover conserved regions such as motifs in either DNA or Protein sequences. We have followed a graph-based 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:
Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on
(Volume:1
)
Date of Conference: 14-16 Aug. 2009
- Page(s):
- 39 - 42
- Print ISBN:
- 978-0-7695-3735-1
- INSPEC Accession Number:
- 11024812
- Conference Location :
- Tianjin
- Digital Object Identifier :
- 10.1109/FSKD.2009.542
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
