Decomposition and reconstruction of protein sequences: The problem of uniqueness and factorizable langauge

	Decomposition and reconstruction of protein sequences: The problem of uniqueness and factorizable langauge
	Shi, XL ; Xie, HM ; Zhang, SY ; Hao, BL
	2007
会议日期	JUL 12-14, 2006
会议地点	Pohang, SOUTH KOREA
卷号	50
期号	1
页码	118-123
英文摘要	In our attempt to justify the CVTree approach of inferring phylogenetic relationship among bacteria from their complete genomes without using sequence alignment, we encountered the problem of the uniqueness of the reconstruction of a protein sequence from its constituent K-peptides, which has a natural relation to a well-understood problem in graph theory, namely, the number of Eulerian loops in a graph. The existence of finite state automata to recognize the uniqueness of a sequence reconstruction provides us with yet another application of factorizable language, which was elucidated at a previous Dynamics Days Asia Pacific meeting (DDAP1).
会议录	JOURNAL OF THE KOREAN PHYSICAL SOCIETY
会议录出版者	KOREAN PHYSICAL SOC
会议录出版地	SEOUL
语种	英语
ISSN号	0374-4884
WOS研究方向	Physics
内容类型	会议论文
源URL	[http://ir.itp.ac.cn/handle/311006/23679]
专题	SCI会议论文
作者单位	1.Acad Sinica, Inst Phys, Beijing 100044, Peoples R China 2.Fudan Univ, T Life Res Ctr, Shanghai 200433, Peoples R China 3.Acad Sinica, Inst Theoret Phys, Beijing 100044, Peoples R China 4.Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China 5.Acad Sinica, Inst Bot, Beijing 100044, Peoples R China
推荐引用方式 GB/T 7714	Shi, XL,Xie, HM,Zhang, SY,et al. Decomposition and reconstruction of protein sequences: The problem of uniqueness and factorizable langauge[C]. 见:. Pohang, SOUTH KOREA. JUL 12-14, 2006.