An algorithm for haplotype analysis

Conference · Mon Dec 01 04:00:00 EST 1997

OSTI ID:549013

Lin, Shili; Speed, T P ^[1]

---

1. Univ. of California, Berkeley, CA (United States)

This paper proposes an algorithm for haplotype analysis based on a Monte Carlo method. Haplotype configurations are generated according to the distribution of joint haplotypes of individuals in a pedigree given their phenotype data, via a Markov chain Monte Carlo algorithm. The haplotype configuration which maximizes this conditional probability distribution can thus be estimated. In addition, the set of haplotype configurations with relatively high probabilities can also be estimated as possible alternatives to the most probable one. This flexibility enables geneticists to choose the haplotype configurations which are most reasonable to them, allowing them to include their knowledge of the data under analysis. 18 refs., 2 figs., 1 tab.

• Research Organization: Association for Computing Machinery, New York, NY (United States); Sloan (Alfred P.) Foundation, New York, NY (United States)
• OSTI ID: 549013
• Report Number(s): CONF-970137--; CNN: Grant R01HG01093-01
• Country of Publication: United States
• Language: English

Related Subjects

55 BIOLOGY AND MEDICINE
BASIC STUDIES
99 GENERAL AND MISCELLANEOUS
ACCURACY
ALGORITHMS
BIOLOGICAL EVOLUTION
BIOLOGICAL MARKERS
COMPUTER CODES
COMPUTERIZED SIMULATION
CORRELATIONS
DATA
DNA-CLONING
EFFICIENCY
GENES
GENETIC MAPPING
GENETICS
GENOTYPE
HAPLOIDY
HEREDITARY DISEASES
HUMAN CHROMOSOMES
HUMAN POPULATIONS
ITERATIVE METHODS
MARKOV PROCESS
MOLECULAR BIOLOGY
MONTE CARLO METHOD
PHENOTYPE
PROBABILITY
S CODES
STATISTICS