𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of the information content of a classification

✍ Scribed by Kenneth Baclawski; Dan A. Simovici

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
381 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Information Content of a Character u
The Information Content of a Character under a Markov Model of Evolution
✍ Max Shpak; Gary A. Churchill πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 147 KB

The rate of evolutionary change associated with a character determines its utility for the reconstruction of phylogenetic history. For a given age of lineage splits, we examine the information content of a character to assess the magnitude and range of an optimal rate of substitution. On the one han

A Goal-based Classification of Web Infor
A Goal-based Classification of Web Information Tasks
✍ Melanie Kellar; Carolyn Watters; Michael Shepherd πŸ“‚ Article πŸ“… 2007 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 190 KB

## Abstract While researchers have been studying user activity on the Web since its inception, there remains a lack of understanding of the high level tasks in which users engage on the Web. We have recently conducted a field study in which participants were asked to annotate all web usage with a t

The Elements for a Classification of Uni
The Elements for a Classification of Units of Genetic Information with a Combinatorial Component
✍ Julio Collado-Vides πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 875 KB

An integrative approach to the study of the regulation of gene expression has been undertaken here. The main goal of this approach is to make explicit the common rules that govern the relative location of regulatory sites within operons and other units of genetic information (UGIs). A classification

Information Content of Protein Sequences
Information Content of Protein Sequences
✍ OLAF WEISS; MIGUEL A JIMΓ‰NEZ-MONTAΓ‘O; HANSPETER HERZEL πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 153 KB

The complexity of large sets of non-redundant protein sequences is measured. This is done by estimating the Shannon entropy as well as applying compression algorithms to estimate the algorithmic complexity. The estimators are also applied to randomly generated surrogates of the protein data. Our res