32
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Design of shortest double-stranded DNA sequences covering all k-mers with applications to protein-binding microarrays and synthetic enhancers

      research-article
      , *
      Bioinformatics
      Oxford University Press

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Motivation: Novel technologies can generate large sets of short double-stranded DNA sequences that can be used to measure their regulatory effects. Microarrays can measure in vitro the binding intensity of a protein to thousands of probes. Synthetic enhancer sequences inserted into an organism’s genome allow us to measure in vivo the effect of such sequences on the phenotype. In both applications, by using sequence probes that cover all k-mers, a comprehensive picture of the effect of all possible short sequences on gene regulation is obtained. The value of k that can be used in practice is, however, severely limited by cost and space considerations. A key challenge is, therefore, to cover all k-mers with a minimal number of probes. The standard way to do this uses the de Bruijn sequence of length . However, as probes are double stranded, when a k-mer is included in a probe, its reverse complement k-mer is accounted for as well.

          Results: Here, we show how to efficiently create a shortest possible sequence with the property that it contains each k-mer or its reverse complement, but not necessarily both. The length of the resulting sequence approaches half that of the de Bruijn sequence as k increases resulting in a more efficient array, which allows covering more longer sequences; alternatively, additional sequences with redundant k-mers of interest can be added.

          Availability: The software is freely available from our website http://acgt.cs.tau.ac.il/shortcake/.

          Contact: rshamir@ 123456tau.ac.il

          Related collections

          Author and article information

          Journal
          Bioinformatics
          Bioinformatics
          bioinformatics
          bioinfo
          Bioinformatics
          Oxford University Press
          1367-4803
          1367-4811
          1 July 2013
          19 June 2013
          19 June 2013
          : 29
          : 13
          : i71-i79
          Affiliations
          Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel
          Author notes
          *To whom correspondence should be addressed.
          Article
          btt230
          10.1093/bioinformatics/btt230
          3694677
          23813011
          c956f3dd-1b6b-4ef9-a8e2-3c09ec83a383
          © The Author 2013. Published by Oxford University Press.

          This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License ( http://creativecommons.org/licenses/by-nc/3.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited. For commercial re-use, please contact journals.permissions@oup.com

          History
          Page count
          Pages: 9
          Categories
          Ismb/Eccb 2013 Proceedings Papers Committee July 21 to July 23, 2013, Berlin, Germany
          Original Papers
          Gene Regulation and Transcriptomics

          Bioinformatics & Computational biology
          Bioinformatics & Computational biology

          Comments

          Comment on this article