The complexity of checking consistency of pedigree information and related problems
- 1 January 2004
- journal article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 19 (1) , 42-59
- https://doi.org/10.1007/bf02944784
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Detection and Integration of Genotyping Errors in Statistical GeneticsAmerican Journal of Human Genetics, 2002
- Merlin—rapid analysis of dense genetic maps using sparse gene flow treesNature Genetics, 2001
- Allegro, a new computer program for multipoint linkage analysisNature Genetics, 2000
- An Optimal Algorithm for Automatic Genotype EliminationAmerican Journal of Human Genetics, 1999
- Analysis of Human Genetic LinkagePublished by Project MUSE ,1999
- PedCheck: A Program for Identification of Genotype Incompatibilities in Linkage AnalysisAmerican Journal of Human Genetics, 1998
- On the complexity of protein folding (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-CompleteJournal of Computational Biology, 1998
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The complexity of computing the permanentTheoretical Computer Science, 1979