PubMed Health⌕ Search

Biomedical subjects

Jörg Hoheisel

Publications and source records attributed to Jörg Hoheisel.

2 recordsLinked to original sources

Strategy to sequence the genome of Corynebacterium glutamicum ATCC 13032: use of a cosmid and a bacterial artificial chromosome library.

The initial strategy of the Corynebacterium glutamicum genome project was to sequence overlapping inserts of an ordered cosmid library. High-density colony grids of approximately 28 genome equivalents were used for the identification of overlapping clones by Southern hybridization. Altogether 18 contiguous genomic segments comprising 95 overlapping cosmids were assembled. Systematic shotgun sequencing of the assembled cosmid set revealed that only 2.84 Mb (86.6%) of the C. glutamicum genome were represented by the cosmid library. To obtain a complete genome coverage, a bacterial artificial chromosome (BAC) library of the C. glutamicum chromosome was constructed in pBeloBAC11 and used for genome mapping. The BAC library consists of 3168 BACs and represents a theoretical 63-fold coverage of the C. glutamicum genome (3.28 Mb). Southern screening of 2304 BAC clones with PCR-amplified chromosomal markers and subsequent insert terminal sequencing allowed the identification of 119 BACs covering the entire chromosome of C. glutamicum. The minimal set representing a 100% genome coverage contains 44 unique BAC clones with an average overlap of 22 kb. A total of 21 BACs represented linking clones between previously sequenced cosmid contigs and provided a valuable tool for completing the genome sequence of C. glutamicum.

Chromosomes, Artificial, Bacterial↗

Microarray data representation, annotation and storage.

Management and analysis of the huge amounts of data produced by microarray experiments is becoming one of the major bottlenecks in the utilization of this high-throughput technology. We describe the basic design of a microarray gene expression database to help microarray users and their informatics teams to set up their information services. We describe two data models--a simpler one called ArrayExpressB and the complete model ArrayExpressC, and discuss some implementation issues. For latest developments see http: wwwebi.ac.uk/arrayexpress

Algorithms↗