48 search results - page 1 / 10 » Computational analyses of eukaryotic promoters |
BMCBI
2007
13 years 4 months ago
2007
Computational analysis of eukaryotic promoters is one of the most difficult problems in computational genomics and is essential for understanding gene expression profiles and reve...
BMCBI
2006
13 years 4 months ago
2006
Background: The discovery of cis-regulatory motifs still remains a challenging task even though the number of sequenced genomes is constantly growing. Computational analyses using...
ISMB
1996
13 years 6 months ago
1996
BMCBI
2008
13 years 4 months ago
2008
Background: Eukaryotic promoter prediction using computational analysis techniques is one of the most difficult jobs in computational genomics that is essential for constructing a...
IMSCCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Background: TATA box is one of the most important transcription factor binding sites. But the exact sequences of TATA box are still not very clear. Results: In this study, we cond...