Abstract
As an alternative to dichotomous keys, tabular keys are used for taxonomic identification. With the use of computers, keys based on the Bayes formula can also be made available more widely. For the development of a key, the maximum a posterior probability (MAP) for a taxon is important because it allows to evaluate the quality of a key. If it is low, the taxon is hard to distinguish from other taxa. In this paper, we show that finding MAP in a Bayesian key is NP-hard. Estimates for MAP or other measures have to be used for the estimation of the quality of a Bayesian key.
Similar content being viewed by others
References
Dybowski, W and D. A. Franklin: Conditional Probability and the Identification of Bacteria: A Pilot Study. Journal of General Microbiology54, 215–229 (1968)
Forget, P. M., J. Lebbe, H. Puig, R. Vignes, and M. H. Hideux: Microcomputer-aided identification: An application to trees from French Guiana. Bot. J. Linn. Soc.93, 205–223 (1986)
Garey, M. R. and D. S. Johnson: Computers and Intractability, A Guide to the Theory of NP-Completeness. New York 1979
Lebbe, J.: Manuel d'Utilisation de logiciel XPER. Microapplication, Paris (1984)
Newell, I. M.: Construction and use of tabular keys. Pac. Insects, 12(1): 25–37 (1970)
Pankhurst, R. J.: A package of computer programs for handling taxonomic databases. Computer applications in the Bioscience, Vol 2 No 1, 1986, 33–39 (1986)
Pankhurst, R. J.: Partical Taxonomic Computing. Cambridge University Press, Cambridge, 1991
Pankhurst, R. J. and J. M. Allison: British grasses — a punched card key to grasses in the vegetative state. Field Studies Council Occasional Publication No. 10, and British Museum (Natural History). 76 pp. and 124 cards. Botany Department. British Museum (Natural History), Cromwell Road, London SW7 51313, UK (1985)
Rao, C. K. and R. J. Pankhurst: A polyclave to the Monocotyledonous Families of the World. A computer generated Identification key. British Museum (Natural History). 59 pp. and 235 cards. Pankhurst: Botany Department, British Museum (Natural History), Cromwell Road, London SW7 51313, UK (1986)
Shimony, S. E.: Finding MAPS for belief networks is NP-hard. Artificial intelligence68, 399–410 (1994)
Sneath, P. H. A.: BASIC Program for Character Separation Indices from an Identification Matrix of Percent Positive Characteristics. Computers and Geoscience5, 349–357 (1979)
Sneath, P. H. A.: BASIC Program for the Most Diagnostic Properties of Groups from an Identification Matrix of Percent Positive Characteristics. Computers and Geoscience6, 21–26 (1979)
Sneath, P. H. A.: BASIC Program for Determining the Best Identification Scores Possible from the Most Typicle Example when Compared with an Identification Matrix of Percent Positive Characteristics. Computers and Geoscience6, 27–34 (1979)
Strasser, W.: Bestimmungsschlüssel für die Laub- und Lebermoose der Schweiz. Steffisburg 1987
Volger, E.: Gräserbestimmung nach Photos, Backwell Wissenschaftsverlag Berlin 1994
Willcox, W. R. and S. P. Lapage: Methods used in a Program for Computer-aided Identification of Bacteria. In: Pankhurst R. J. (Ed.) 1975: Biological Identification with Computers. 103–119 (1975)
Willcox, W. R., S. P. Lapage and B. Holmes: A Review of Numerical Methods in Bacterial Identification. Antoine van Leewenhoek46, 233–299 (1980)
Winkler, R., 2000 Pilze einfach bestimmen. AT Verlag Aarau-Stuttgart (1996)
Woolley, J. B. and N. D. Stone: Application of Artificial Intelligence to Systematics: SYSTEX — A Prototype expert system for species identification, Syst. Zool.,36(3), 248–267 (1987)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fischbacher, U. Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard. J. Math. Biol. 34, 926–936 (1996). https://doi.org/10.1007/BF01834827
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01834827