A simple greedy algorithm for reconstructing pedigrees.

TL;DR: The modified method presented here allows to properly address the question of whether a reasonably high likelihood solution that is easy to obtain is practically as useful as a guaranteed maximum likelihood solution and enables investigation into the properties of maximum likelihood pedigree estimates.

TL;DR: Content analysis was used to analyse publically-available consent and informational materials provided to potential clients of ancestry and direct-to-consumer genetic testing companies to determine what consent is required, what risks associated with participation were highlighted, and whether the consent or notification of third parties was suggested or required.

TL;DR: This new pedigree reconstruction system, PR‐genie, performs reconstruction using maximum likelihood with optimization driven by the cross‐entropy method and demonstrates pedigree reconstruction performance on simulated populations over a wide range of population parameters and under assortative and intergenerational mating schema.

TL;DR: In this paper, the authors survey k-best enumeration problems and the algorithms for solving them, including the problems of finding the k shortest paths, k smallest spanning trees, and k best matchings in weighted graphs.

TL;DR: An overview of the main design concepts of SCIP and how it can be used to solve constraint integer programs is given and experimental results show that the approach outperforms current state-of-the-art techniques for proving the validity of properties on circuits containing arithmetic.

TL;DR: This volume comprises the papers accepted for presentation at UAI 2004, held at the Banff Park Inn in Banff, Canada, from July 7 through 11, 2004, and is confident that the proceedings will become an important archival reference for the field.

TL;DR: The DNA evidence supports the hypothesis that the remains of the last Tsar, Tsarina, three of their five children, the Royal Physician and three servants are those of the Romanov family.

TL;DR: In this paper, the Hungarian method is used to find the minimal cost assignment and the best assignment after excluding the minimum cost assignment, which can be used to rank all the assignments in a sequence in order of cost.