SAGE Journals Online
Advertisement
Sign In to gain access to subscriptions and/or personal tools.

 

Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Advertisement

Sign In to gain access to subscriptions and/or personal tools.
Statistical Methods in Medical Research
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Right arrow Citation Map
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Sobel, E.
Right arrow Articles by Lange, K.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Sobel, E.
Right arrow Articles by Lange, K.
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Metropolis sampling in pedigree analysis

E. Sobel

Department of Biomathematics, University of California, Los Angeles

K. Lange

Department of Biomathematics, University of California, Los Angeles

This paper reviews and develops the applications of Markov chain Monte Carlo methods in pedigree analysis, with particular stress on the Metropolis algorithm. In likelihood based genetic analyses, standard deterministic algorithms often fail because of the computational complexity of the observed pedigree data under a proposed genetic model. The new Monte Carlo methods permit approximate maximum likelihood estimation in the presence of such complexity. Monte Carlo implementation of the EM algorithm is the key to successful maximum likelihood analysis. Gibbs sampling and the Metropolis algorithm are alternative ways of defining Markov chains for performing the E step of the EM algorithm. Two applications illustrate the power and simplicity of the Metropolis algorithm. One of these applications involves a discrete model for variance component analysis of quantitative traits; the other application involves a Monte Carlo version of location scores for multipoint linkage analysis.

Statistical Methods in Medical Research, Vol. 2, No. 3, 263-282 (1993)
DOI: 10.1177/096228029300200305
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?




Advertisement