QQ客服 官方微博 反馈留言

	Fixed topology alignment with recombination
	Ma, B ; Wang, LS ; Li, M
	1998
关键词	APPROXIMATION ALGORITHMS SEQUENCES SUBJECT TREE ALIGNMENT PHYLOGENY EVOLUTION
英文摘要	In this paper, we study a new version of multiple sequence alignment, Fixed topology alignment with recombination. We show that it can not be approximated within any constant ratio unless P = NP. For a more restricted version, we show that the problem is MAX-SNP-hard. This implies that there is no PTAS for this version unless P = NP. We also propose approximation algorithms for a special case, where each internal node has at most one recombination child and any two merge paths for different recombination nodes do not share any common node.; Computer Science, Software Engineering; SCI(E); CPCI-S(ISTP); 2
语种	英语
出处	SCI
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/157427]
专题	数学科学学院
推荐引用方式 GB/T 7714	Ma, B,Wang, LS,Li, M. Fixed topology alignment with recombination. 1998-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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