Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2008 Sep;15(7):655-65.
doi: 10.1089/cmb.2007.0114.

Design of compact, universal DNA microarrays for protein binding microarray experiments

Affiliations

Design of compact, universal DNA microarrays for protein binding microarray experiments

Anthony A Philippakis et al. J Comput Biol. 2008 Sep.

Abstract

Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs). This design represents all possible sequence variants of a given length k (i.e., all k-mers) on a single array, allowing a complete characterization of the binding specificities of a given TF. Here, we present the mathematical foundations of this design based on de Bruijn sequences generated by linear feedback shift registers. We show that these sequences represent the maximum number of variants for any given set of array dimensions (i.e., number of spots and spot lengths), while also exhibiting desirable pseudo-randomness properties. Moreover, de Bruijn sequences can be selected that represent gapped sequence patterns, further increasing the coverage of the array. This design yields a powerful experimental platform that allows the binding preferences of TFs to be determined with unprecedented resolution.

PubMed Disclaimer

Figures

FIG. 1.
FIG. 1.
De Bruijn sequence of order 2 (a) and its associated de Bruijn graph (b).
FIG. 2.
FIG. 2.
Addition and multiplication tables over GF(4).
FIG. 3.
FIG. 3.
Generation of de Bruijn sequences over 4-letter (a) and 2-letter (b) alphabets.
FIG. 4.
FIG. 4.
Cartoon depicting all m-mers (gray vertices) and m-mers samples by an order k < m de Bruijn sequence (black vertices). Vertices are connected by an edge if they are 1 mismatch away. (a) de Bruijn sequence that samples m-mers randomly. (b) de Bruijn sequence that samples m-mers regularly.

Similar articles

Cited by

References

    1. Ben-Dor A. Karp R. Schwikowski B., et al. Universal DNA tag systems: a combinatorial design scheme. J. Comput. Biol. 2000;7:503–519. - PubMed
    1. Benos P.V. Lapedes A.S. Stormo G.D. Is there a code for protein-DNA recognition? Probab(ilistical)ly. Bioessays. 2002;24:466–475. - PubMed
    1. Berger M.F. Philippakis A.A. Qureshi A.M., et al. Compact, universal DNA microarrays to comprehensively determine transcription-factor binding site specificities. Nat. Biotechnol. 2006;24:1429–1435. - PMC - PubMed
    1. Bulyk M.L. Computational prediction of transcription-factor binding site locations. Genome Biol. 2003;5:201. - PMC - PubMed
    1. Bulyk M.L. Gentalen E. Lockhart D.J., et al. Quantifying DNA-protein interactions by double-stranded DNA arrays. Nat. Biotechnol. 1999;17:573–577. - PubMed

Publication types

MeSH terms

Substances

LinkOut - more resources