Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard

DOI10.1007/BF01834827MaRDI QIDQ2563728zbMATH OpenFDO

Authors U. Fischbacher

Publication date 22 January 1997

Published in Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01834827

zbMATH Keywords

Bayes formulaBayesian keyHamiltonian circuitmaximum a posterior probabilityNP-hardtabular keys

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Complexity and performance of numerical algorithms (65Y20) Taxonomy, cladistics, statistics in mathematical biology (92B10)

Recommendations

• Optimization of Taxonomic Keys by Means of Probabilistic Modelling
• Approximating MAPs for belief networks is NP-hard and other theorems
• Finding MAPs for belief networks is NP-hard
• scientific article; zbMATH DE number 2243356

Cites work

• Finding MAPs for belief networks is NP-hard
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• Optimization of Taxonomic Keys by Means of Probabilistic Modelling
• Probabilistic Models for Bacterial Taxonomy

Describes a project that uses

Uses Software

• SYSTEX

This page was built for publication: Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563728)