A simulated annealing algorithm for maximum likelihood pedigree reconstruction.

doi:10.1016/s0040-5809(02)00048-5

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Back to search

Article

A simulated annealing algorithm for maximum likelihood pedigree reconstruction.

Theoretical population biology - 1 Mar 2003

Almudevar Anthony

Abstract excerpt

The calculation of maximum likelihood pedigrees for related organisms using genotypic data is considered. The problem is formulated so that the domain of optimization is a permutation space. This is a feature shared by the travelling salesman problem, for which simulated annealing is known to be effective. Using this technique it is found that pedigrees can be reconstructed with minimal error using genotypic data...

Topics

Algorithms
Canada
DNA, Satellite
Genotype
Humans
Likelihood Functions
Models, Theoretical
Pedigree

Source

Open in PubMed

Identifiers

PMID: 12615491
DOI: 10.1016/s0040-5809(02)00048-5

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 30 Aug 2026.

Community interpretation

Discuss the evidence

Ask a question, add context or challenge an interpretation. Community activity is separate from scientific evidence strength.

discussions

replies

Citations encouraged

Claims remain attributable.

No discussion yet

Be the first to add a careful, cited interpretation.

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics