QQ客服 官方微博 反馈留言

	Randomized algorithms for Motif detection
	Wang, LS ; Dong, LA ; Fan, H
	2004
关键词	EXPECTATION MAXIMIZATION NONCODING SEQUENCES FINDING MOTIFS PRIMERS PROGRAM DESIGN
英文摘要	Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software. Results: (1) We design a randomized algorithm for consensus pattern problem. We can show that with high probability, our randomized algorithm finds a pattern in polynomial time with cost error at most e x l for each string, where L is the length of the motif and a can be any positive number given by the user. (2) We design an improved EM (Expectation Maximization) algorithm that outperforms the original EM algorithm. (3) We develop a software MotifDetector that uses our randomized algorithm to find good seeds and uses the improved EM algorithm to do local search. We compare MotifDetector with Buhler and Tompa's PROJECTION which is considered to be the best known software for motif detection. Simulations show that MotifDetector is slower than PROJECTION when the pattern length is relatively small, and outperforms PROJECTION when the pattern length becomes large.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000226690300073&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Theory & Methods; SCI(E); CPCI-S(ISTP); 1
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/400319]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, LS,Dong, LA,Fan, H. Randomized algorithms for Motif detection. 2004-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。