A theory of information with special application to search problems

DOI10.1016/S0097-8485(99)00045-5zbMATH Open1003.94009OpenAlexW4253612668WikidataQ30833904 ScholiaQ30833904MaRDI QIDQ4532709FDOQ4532709

Authors: W. John Wilbur, Andrew F. Neuwald 

Publication date: 5 June 2002

Full work available at URL: https://doi.org/10.1016/s0097-8485(99)00045-5

Recommendations

• Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede
• Information-theoretic approaches to branching in search
• Information storage and search complexity theory
• Information Theory and Selected Applications
• Logic versus Approximation
• scientific article; zbMATH DE number 3591873
• scientific article; zbMATH DE number 1216200
• On information theory and its applications
• scientific article; zbMATH DE number 1222084

zbMATH Keywords

information theorysolvent accessibilitysearch problemsprotein secondary structureprotein tertiary structurealignment profileconfirmatory information

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Information theory (general) (94A15) Measures of information, entropy (94A17)

Cited In (3)

• On partial information retrieval: the unconstrained 100 prisoner problem
• Latent periodicity of serine-threonine and tyrosine protein kinases and other protein families
• Title not available (Why is that?)

This page was built for publication: A theory of information with special application to search problems

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