A MCMC method for resolving two person mixtures
β Scribed by James M. Curran
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 924 KB
- Volume
- 48
- Category
- Article
- ISSN
- 1355-0306
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper a Monte Carlo Markov Chain (MCMC) method for resolving DNA mixtures containing at most four peaks per locus into a major and a minor contributor is presented. Unlike previous methods, this method can provide posterior probability assessments of the most probable genotype and a likely range for the mixing proportion. The proposed method is applied to two DNA mixtures where the true genotypes of the contributors are known. The method provides posterior probabilities of the genotypes of the contributes which concord strongly with the known facts.
π SIMILAR VOLUMES
Everyday bargaining problems are often solved by tossing a coin. A solution for two-person bargaining problems is axiomatized, which is a Paretooptimal generalization of this coin tossing method. The super-additive solution of Perles and Maschler is also shown to be a generalization of this method.
The satellite image deconvolution problem is ill-posed and must be regularized. Herein, we use an edge-preserving regularization model using a function, involving two hyperparameters. Our goal is to estimate the optimal parameters in order to automatically reconstruct images. We propose to use the m