Large-scale analysis of gene clustering in bacteria.
An important strategy to study operons and their evolution is to investigate clustering of related genes across multiple bacterial genomes. Although existing algorithms are available that can identify gene clusters across two or more genomes, very few algorithms are efficient enough to study gene clusters across hundreds of genomes. We observe that a querying strategy can be used to analyze gene clusters across a large number of genomes and develop an efficient algorithm to identify all related clusters on a genome from a given query cluster. We use this algorithm to study gene clustering in 400 bacterial genomes by starting from a well-characterized list of operons in Escherichia coli K12 and perform comparative analysis of operon occurrences, gene orientations, and rearrangements both within and across clusters. We show that important biological insights can be obtained by comparing results across these categories. A software program implementing the algorithm (GCQuery) and supplementary data containing detailed results are available at http://faculty.cs.tamu.edu/shsze/gcquery.
Yang
Qingwu
Q
Department of Computer Science, Texas A&M University, College Station, Texas 77843, USA.
Sze
Sing-Hoi
SH
D000465:Algorithms; D001412:Bacillus subtilis / Q000235:genetics; D048168:Escherichia coli K12 / Q000235:genetics; D015321:Gene Rearrangement; D005798:Genes, Bacterial; D016680:Genome, Bacterial; D005810:Multigene Family; D009876:Operon