By Topic

The improvement and implementation in the algorithm of finding maximal motifs in DNA 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

4 Author(s)
Fu Yifan ; Ideal Inst. of Inf. Technol., Northeast normal Univ., Jilin, China ; Zhou Dongdai ; Zhong Shaochun ; Zhao Ruiqing

DNA sequences are formed by nucleotides A;C; G; T. Often, a particular word called motif can occur in many sequences of a group. There has been an algorithm to find both the frequent and the maximal motif in the DNA sequences, but it has some disadvantages. Such as the time and place cost is very high. In the paper, we build a tree based on the motif length to improve it, and implement a small system according to the original and improved algorithm. Then we compare the latest new algorithms about the problem with them, and give the empirical result of them.

Published in:

Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on  (Volume:1 )

Date of Conference:

17-19 Nov. 2008