{"title":"Celer:一个有效的基因型消除程序","authors":"N. Francesco, G. Lettieri, L. Martini","doi":"10.4204/EPTCS.33.4","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient program for checking Mendel ian consistency in a pedigree. Sincepedigrees may contain incomplete and/or erroneous information, geneticists need to pre-processthem before performing linkage analysis. Removing superflu ous genotypes that do not respect theMendelian inheritance laws can speed up the linkage analysis. We have described in a formal waythe Mendelian consistency problem and algorithms known in literature. The formalization helpedto polish the algorithms and to find efficient data structures . The performance of the tool has beentested on a wide range of benchmarks. The results are promising if compared to other programs thattreat Mendelian consistency.","PeriodicalId":118799,"journal":{"name":"AMCA-POP","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Celer: an Efficient Program for Genotype Elimination\",\"authors\":\"N. Francesco, G. Lettieri, L. Martini\",\"doi\":\"10.4204/EPTCS.33.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an efficient program for checking Mendel ian consistency in a pedigree. Sincepedigrees may contain incomplete and/or erroneous information, geneticists need to pre-processthem before performing linkage analysis. Removing superflu ous genotypes that do not respect theMendelian inheritance laws can speed up the linkage analysis. We have described in a formal waythe Mendelian consistency problem and algorithms known in literature. The formalization helpedto polish the algorithms and to find efficient data structures . The performance of the tool has beentested on a wide range of benchmarks. The results are promising if compared to other programs thattreat Mendelian consistency.\",\"PeriodicalId\":118799,\"journal\":{\"name\":\"AMCA-POP\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AMCA-POP\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.33.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AMCA-POP","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.33.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Celer: an Efficient Program for Genotype Elimination
This paper presents an efficient program for checking Mendel ian consistency in a pedigree. Sincepedigrees may contain incomplete and/or erroneous information, geneticists need to pre-processthem before performing linkage analysis. Removing superflu ous genotypes that do not respect theMendelian inheritance laws can speed up the linkage analysis. We have described in a formal waythe Mendelian consistency problem and algorithms known in literature. The formalization helpedto polish the algorithms and to find efficient data structures . The performance of the tool has beentested on a wide range of benchmarks. The results are promising if compared to other programs thattreat Mendelian consistency.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
