DocumentCode :
3397949
Title :
A novel parallel motif discovery algorithm based on de Bruijn graph
Author :
Zhou, Hong ; Zhao, Zheng ; Wang, Hongpo
Author_Institution :
Sch. of Comput. Sci. & Technol., Tianjin Univ., Tianjin, China
Volume :
2
fYear :
2010
fDate :
30-31 May 2010
Firstpage :
139
Lastpage :
142
Abstract :
this paper attempts to provide a new approach to discover conserved regions such as motifs in either DNA or Protein sequences. We not only use the idea of de Bruijn graphs, but also follow a parallel approach to solve this problem. The de Bruijn graph has been successfully adopted to solve problems such as local alignment and DNA fragment assembly. To accelerate the speed, our method harnesses the power of parallelism 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.
Keywords :
Agricultural engineering; Assembly; Automation; Computer science; DNA; Diseases; Evolution (biology); Mechatronics; Parallel processing; Protein sequence; Motif; de bruijn graph; parallel;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Mechatronics and Automation (ICIMA), 2010 2nd International Conference on
Conference_Location :
Wuhan, China
Print_ISBN :
978-1-4244-7653-4
Type :
conf
DOI :
10.1109/ICINDMA.2010.5538350
Filename :
5538350
Link To Document :
بازگشت