𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Putting numbers on the network connections

✍ Scribed by Gary D. Stormo; Yue Zhao


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
80 KB
Volume
29
Category
Article
ISSN
0265-9247

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

DNA–protein interactions are fundamental to many biological processes, including the regulation of gene expression. Determining the binding affinities of transcription factors (TFs) to different DNA sequences allows the quantitative modeling of transcriptional regulatory networks and has been a significant technical challenge in molecular biology for many years. A recent paper by Maerkl and Quake1 demonstrated the use of microfluidic technology for the analysis of DNA–protein interactions. An array of short DNA sequences was spotted onto a glass slide, which was then covered with a microfluidic device allowing each spot to be within a chamber into which the flow of materials was controlled by valves. By trapping the DNA–protein complexes on the surface and measuring their concentrations microscopically, they could determine the binding affinity to a large number of DNA sequences that were varied systematically. They studied four TFs from the basic helix–loop–helix family of proteins, all of which bind to E‐box sites with the consensus CAnnTG (where β€œn” can be any base), and showed that variations in affinity for different sites allows each TF to regulate different genes. BioEssays 29:717–721, 2007. Β© 2007 Wiley Periodicals, Inc.


πŸ“œ SIMILAR VOLUMES


On the Number of Cycles in 3-Connected C
✍ R.E.L Aldred; Carsten Thomassen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie