The Improvement and Implementation in the Algorithm of Finding Maximal Motifs in DNA Sequences

摘要：

DNA sequences are formed by nucleotides A;C;G;T.Ofen,a particular word called motif can occur inmany sequences of a group.There has been analgorithm to find both the frequent and the maximalmotif in the DNA sequences,but it has somedisadvantages.Such as the time and place cost is veryhigh.In the paper,we build a tree based on the motiflength to improve it,and implement a small systemaccording to the original and improvedalgorithm.Then we compare the latest new algorithmsabout the problem with them,and give the empiricalresult of them.

作者: Fu Yifan Zhou Dongdai Zhong Shaochun Zhao Ruiqing

作者单位: Ideal Institute of Information Technology,Northeast normal university,China E-learning laboratory of College of Computer Science,Jilin University,China

会议类型: 国际会议

会议名称: 2008 3rd International Conference on Intelligent System and Knowledge Engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)

会议地点: 厦门

会议语种:英文

页码: 176-179

在线出版日期: 2008-11-17（万方平台首次上网日期，不代表论文的发表时间）