Gecko and GhostFam

A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contained in such clusters. For a rigorous and efficient detection in multiple genomes, it is essential to have an appropriate model of gene clusters accompanied by efficient algorithms locating them. The Gecko method described herein was designed to serve as a basic tool for the detection and visualization of gene cluster data in prokaryotic genomes founded on a formal string-based gene cluster model.

[1]  Igor B. Rogozin,et al.  Computational approaches for the analysis of gene neighbourhoods in prokaryotic genomes , 2004, Briefings Bioinform..

[2]  B. Snel,et al.  Conservation of gene order: a fingerprint of proteins that physically interact. , 1998, Trends in biochemical sciences.

[3]  Michael Y. Galperin,et al.  The COG database: new developments in phylogenetic classification of proteins from complete genomes , 2001, Nucleic Acids Res..

[4]  C. DeLisi,et al.  The society of genes: networks of functional links between genes from comparative genomics , 2002, Genome Biology.

[5]  A. Valencia,et al.  Conserved Clusters of Functionally Related Genes in Two Bacterial Genomes , 1997, Journal of Molecular Evolution.

[6]  Jens Stoye,et al.  Finding All Common Intervals of k Permutations , 2001, CPM.

[7]  E. Koonin,et al.  Evolution of gene fusions: horizontal transfer versus independent events , 2002, Genome Biology.

[8]  R. Overbeek,et al.  The use of gene clusters to infer functional coupling. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Dmitrij Frishman,et al.  SNAPper: gene order predicts gene function , 2002, Bioinform..

[10]  Jens Stoye,et al.  Character sets of strings , 2007, J. Discrete Algorithms.

[11]  P Bork,et al.  Gene context conservation of a higher order than operons. , 2000, Trends in biochemical sciences.

[12]  Takeaki Uno,et al.  Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.

[13]  Mathieu Raffinot,et al.  The Algorithmic of Gene Teams , 2002, WABI.

[14]  Jens Stoye,et al.  Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences , 2004, CPM.

[15]  Giorgio Satta,et al.  Efficient text fingerprinting via Parikh mapping , 2003, J. Discrete Algorithms.

[16]  Javier Tamames,et al.  Evolution of gene order conservation in prokaryotes , 2001, Genome Biology.

[17]  B. Snel,et al.  SHOT: a web server for the construction of genome phylogenies. , 2002, Trends in genetics : TIG.

[18]  Berend Snel,et al.  Comparative Genome Analysis: Exploiting the Context of Genes to Infer Evolution and Predict Function , 2000 .