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

DOI10.1007/BF01834827zbMath0857.92002MaRDI QIDQ2563728

Urs Fischbacher

Publication date: 22 January 1997

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

zbMATH Keywords

Hamiltonian circuitNP-hardBayes formulaBayesian keymaximum a posterior probabilitytabular keys

Mathematics Subject Classification ID

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

Related Items (1)

Probabilistic Models for Bacterial Taxonomy

Uses Software

• SYSTEX

Cites Work

• Finding MAPs for belief networks is NP-hard
• Unnamed Item

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