Computer Science – Data Structures and Algorithms
Scientific paper
2010-08-19
EPTCS 33, 2010, pp. 56-70
Computer Science
Data Structures and Algorithms
In Proceedings AMCA-POP 2010, arXiv:1008.3147
Scientific paper
10.4204/EPTCS.33.4
This paper presents an efficient program for checking Mendelian consistency in a pedigree. Since pedigrees may contain incomplete and/or erroneous information, geneticists need to pre-process them before performing linkage analysis. Removing superfluous genotypes that do not respect the Mendelian inheritance laws can speed up the linkage analysis. We have described in a formal way the Mendelian consistency problem and algorithms known in literature. The formalization helped to polish the algorithms and to find efficient data structures. The performance of the tool has been tested on a wide range of benchmarks. The results are promising if compared to other programs that treat Mendelian consistency.
Francesco Nicoletta de
Lettieri Giuseppe
Martini Luca
No associations
LandOfFree
Celer: an Efficient Program for Genotype Elimination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Celer: an Efficient Program for Genotype Elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Celer: an Efficient Program for Genotype Elimination will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-135183