title: An efficient pseudomedian filter for tiling microrrays.
abstract: BACKGROUND
  Tiling microarrays are becoming an essential technology in the functional genomics toolbox. They have been applied to the tasks of novel transcript identification, elucidation of transcription factor binding sites, detection of methylated DNA and several other applications in several model organisms. These experiments are being conducted at increasingly finer resolutions as the microarray technology enjoys increasingly greater feature densities. The increased densities naturally lead to increased data analysis requirements. Specifically, the most widely employed algorithm for tiling array analysis involves smoothing observed signals by computing pseudomedians within sliding windows, a O(n2logn) calculation in each window. This poor time complexity is an issue for tiling array analysis and could prove to be a real bottleneck as tiling microarray experiments become grander in scope and finer in resolution.
  
  
  RESULTS
  We therefore implemented Monahan's HLQEST algorithm that reduces the runtime complexity for computing the pseudomedian of n numbers to O(nlogn) from O(n2logn). For a representative tiling microarray dataset, this modification reduced the smoothing procedure's runtime by nearly 90%. We then leveraged the fact that elements within sliding windows remain largely unchanged in overlapping windows (as one slides across genomic space) to further reduce computation by an additional 43%. This was achieved by the application of skip lists to maintaining a sorted list of values from window to window. This sorted list could be maintained with simple O(log n) inserts and deletes. We illustrate the favorable scaling properties of our algorithms with both time complexity analysis and benchmarking on synthetic datasets.
  
  
  CONCLUSIONS
  Tiling microarray analyses that rely upon a sliding window pseudomedian calculation can require many hours of computation. We have eased this requirement significantly by implementing efficient algorithms that scale well with genomic feature density. This result not only speeds the current standard analyses, but also makes possible ones where many iterations of the filter may be required, such as might be required in a bootstrap or parameter estimation setting. Source code and executables are available at http://tiling.gersteinlab.org/pseudomedian/.
authors.affiliation: Interdepartmental Program in Computational Biology and Bioinformatics, Yale University, New Haven, CT 06520, USA. thomas.royce@yale.edu <thomas.royce@yale.edu>
authors.forename: Thomas E
authors.initials: TE
authors.lastname: Royce
authors.forename: Nicholas J
authors.initials: NJ
authors.lastname: Carriero
authors.forename: Mark B
authors.initials: MB
authors.lastname: Gerstein
mesh_terms: D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D020869:Gene Expression Profiling / Q000379:methods*; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D012815:Signal Processing, Computer-Assisted