52 search results - page 3 / 11 » Computational Heuristics for Simplifying a Biological Model |
RECOMB
2008
Springer
15 years 9 months ago
2008
Springer
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
82
Voted
CIBCB
2006
IEEE
15 years 3 months ago
2006
IEEE
— Computational prediction of transcription factor’s binding sites and regulatory target genes has great value to the biological studies of cellular process. Existing practices...
BMCBI
2010
14 years 9 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
81
Voted
CIBCB
2006
IEEE
15 years 3 months ago
2006
IEEE
— Microarray data analysis is notoriously challenging as it involves a huge number of genes compared to only a limited number of samples. Gene selection, to detect the most signi...
RECOMB
2007
Springer
15 years 9 months ago
2007
Springer
Transcription factor (TF) binding to its DNA target site is a fundamental regulatory interaction. The most common model used to represent TF binding specificities is a position spe...