You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Information and the Clone Mapping of Chromosomes
Bin Yu and T. P. Speed
The Annals of Statistics
Vol. 25, No. 1 (Feb., 1997), pp. 169-185
Published by: Institute of Mathematical Statistics
Stable URL: http://www.jstor.org/stable/2242716
Page Count: 17
You can always find the topics here!Topics: Entropy, Libraries, Chromosomes, Map libraries, Cosmids, DNA mapping, Sequencing, Genomes, Yeasts, Roundworms
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
A clone map of part or all of a chromosome is the result of organizing order and overlap information concerning collections of DNA fragments called clone libraries. In this paper the expected amount of information (entropy) needed to create such a map is discussed. A number of different formalizations of the notion of a clone map are considered, and exact or approximate expressions or bounds for the associated entropy are calculated for each formalization. Based on these bounds, comparisons are made for four species of the entropies associated with the mapping of their respective cosmid clone libraries. All the entropies have the same first-order term N log2 N (when the clone library size N → ∞) as that obtained by Lehrach et al.
The Annals of Statistics © 1997 Institute of Mathematical Statistics