Abstract: Introduction Biological mechanisms underlying the regulation of gene expression are not completely understood. It is known that they involve binding of transcription factors to regulatory elements on gene promoters. However, attempts to computationally predict such elements in DNA sequences of gene promoters typically yield an excess of false positives. Computational identification of CREs is currently based mainly on three different approaches: (1) identification of conserved motifs using interspecies sequence global alignments (Pennacchio 2001); (2) identification of conserved motifs in the promoters of coregulated genes (Hughes et al 2000, Sudarsanam et al 2002, Bussemaker et al 2001, Eskin et al 2002, Bailey et al 1994, Fujibuchi et al 2001, Palin et al 2002); (3) computational detection of known experimentally identified motifs in genes’ promoters for which binding factors are unknown (Kel et al 2003). The limitations of the first approach are caused by the high mutation, deletion and insertion rates in gene promoter regions (Ludwig 2002), that prevent a correct alignment of the promoter region. As experimental data is accumulating on known DNA binding elements, increasing amount of information can be used to search for similar elements in genes for which transcription factors are unknown. Our approach involves consensus pattern search of known regulatory elements in 5kb upstream of gene transcription start site against a background word distribution simulated by shuffling symbols in consensus, with the aim of minimizing false positives by using a background model of random matches of experimentally determined consensi, and integrating information from the promoters of ortholog genes.