title: GCHap: fast MLEs for haplotype frequencies by gene counting.
abstract: GCHap quickly finds maximum likelihood estimates (MLEs) of frequencies of haplotypes given genotype information on a random sample of individuals. It uses the gene counting method but by excluding haplotypes with zero MLE at an early stage, this implementation uses many orders of magnitude less space and time than naive implementations. A second program, ApproxGCHap, is provided to give alternate estimates for data sets with large numbers of loci or large amounts of missing genotypes.
  
  
  BACKGROUND
  The Java classes and Javadocs pages for GCHap can be obtained from bioinformatics.med.utah.edu/~alun
authors.affiliation: Department of Medical Informatics and Center for High Performance Computing, University of Utah, 391 Chipeta Way Suite D, Salt Lake City, UT 84108, USA. alun@genepi.med.utah.edu
authors.forename: Alun
authors.initials: A
authors.lastname: Thomas
mesh_terms: D000465:Algorithms; D020869:Gene Expression Profiling / Q000379:methods*; D005787:Gene Frequency / Q000235:genetics*; D008040:Genetic Linkage / Q000235:genetics*; D006239:Haplotypes / Q000235:genetics*; D019146:Hypermedia; D016013:Likelihood Functions; D020641:Polymorphism, Single Nucleotide / Q000235:genetics; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software