minimumhausdorffdistanceunderrigidmotionsandcomparisonofproteinstructures

CSpace > 系统科学研究所

	minimumhausdorffdistanceunderrigidmotionsandcomparisonofproteinstructures
	Banghe LI1 ; Bo LI1 ; Yuefeng SHEN 2
	2009
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	000 期号:004 页码:560
摘要	Hausdorff distance between two compact sets, defined as the maximum distance from a point of one set to another set, has many application in computer science. It is a good measure for the similarity of two sets. This paper proves that the shape distance between two compact sets in R^n defined by nfinimum Hausdorff distance under rigid motions is a distance. The authors introduce similarity comparison problems in protein science, and propose that this measure may have good application to comparison of protein structure as well. For calculation of this distance, the authors give one dimensional formulas for problems （2, n）, （3, 3）, and （3, 4）. These formulas can reduce time needed for solving these problems. The authors did some data, this formula can reduce time needed to one As n increases, it would save more time. numerical experiments for （2, n）. On these sets of fifteenth of the best algorithms known on average.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/42964
专题	系统科学研究所
作者单位	1.中国科学院数学与系统科学研究院 2.中国科学院大学
推荐引用方式 GB/T 7714	Banghe LI,Bo LI,Yuefeng SHEN. minimumhausdorffdistanceunderrigidmotionsandcomparisonofproteinstructures[J]. journalofsystemsscienceandcomplexity,2009,000(004):560.
APA	Banghe LI,Bo LI,&Yuefeng SHEN.(2009).minimumhausdorffdistanceunderrigidmotionsandcomparisonofproteinstructures.journalofsystemsscienceandcomplexity,000(004),560.
MLA	Banghe LI,et al."minimumhausdorffdistanceunderrigidmotionsandcomparisonofproteinstructures".journalofsystemsscienceandcomplexity 000.004(2009):560.