Fast optimal genome tiling with applications to microarray design and homology search

Piotr Herman, Paul Bertone, Bhaskar Dasgupta*, Mark Gerstein, Ming-Yang Kao, Michael Snyder

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


In this paper, we consider several variations of the following basic tiling problem: given a sequence of real numbers with two size-bound parameters, we want to find a set of tiles of maximum total weight such that each tiles satisfies the size bounds. A solution to this problem is important to a number of computational biology applications such as selecting genomic DNA fragments for PCR-based amplicon microarrays and performing homology searches with long sequence queries. Our goal is to design efficient algorithms with linear or near-linear time and space in the normal range of parameter values for these problems. For this purpose, we first discuss the solution to a basic online interval maximum problem via a sliding-window approach and show how to use this solution in a nontrivial manner for many of the tiling problems introduced. We also discuss NP-hardness results and approximation algorithms for generalizing our basic tiling problem to higher dimensions. Finally, computational results from applying our tiling algorithms to genomic sequences of five model eukaryotes are reported.

Original languageEnglish (US)
Pages (from-to)766-785
Number of pages20
JournalJournal of Computational Biology
Issue number4
StatePublished - 2004


  • Homology search
  • Microarray design
  • Tiling problems

ASJC Scopus subject areas

  • Modeling and Simulation
  • Molecular Biology
  • Genetics
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'Fast optimal genome tiling with applications to microarray design and homology search'. Together they form a unique fingerprint.

Cite this