{"title":"利用离散晶格的全局约束增强了蛋白质结构确定问题近似解的计算能力","authors":"A. D. Palù, Enrico Pontelli, A. Dovier","doi":"10.1109/BIBMW.2007.4425398","DOIUrl":null,"url":null,"abstract":"This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate solutions of the protein structure determination problem. The paper discusses various alternatives and provides preliminary results concerning the computational properties of the different global constraints.","PeriodicalId":260286,"journal":{"name":"2007 IEEE International Conference on Bioinformatics and Biomedicine Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Enhancing the computation of approximate solutions of the protein structure determination problem through global constraints for discrete crystal lattices\",\"authors\":\"A. D. Palù, Enrico Pontelli, A. Dovier\",\"doi\":\"10.1109/BIBMW.2007.4425398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate solutions of the protein structure determination problem. The paper discusses various alternatives and provides preliminary results concerning the computational properties of the different global constraints.\",\"PeriodicalId\":260286,\"journal\":{\"name\":\"2007 IEEE International Conference on Bioinformatics and Biomedicine Workshops\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Bioinformatics and Biomedicine Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIBMW.2007.4425398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Bioinformatics and Biomedicine Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBMW.2007.4425398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhancing the computation of approximate solutions of the protein structure determination problem through global constraints for discrete crystal lattices
This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate solutions of the protein structure determination problem. The paper discusses various alternatives and provides preliminary results concerning the computational properties of the different global constraints.