Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

An efficient pseudomedian filter for tiling microrrays.

Thomas E Royce1, Nicholas J Carriero, Mark B Gerstein

  • 1Interdepartmental Program in Computational Biology and Bioinformatics, Yale University, New Haven, CT 06520, USA. thomas.royce@yale.edu <thomas.royce@yale.edu>

BMC Bioinformatics
|June 9, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Large-scale, spatially resolved panoramic CRISPR screening in native tissue environments using Perturb-DBiT.

Nature biotechnology·2026
Same author

An expanded registry of candidate cis-regulatory elements.

Nature·2026
Same author

DNA shape and epigenomics distinguish the mechanistic origin of human genomic structural variations.

Nucleic acids research·2025
Same author

Machine-learning models based on histological images from healthy donors identify imageQTLs and predict chronological age.

Proceedings of the National Academy of Sciences of the United States of America·2025
Same author

Aerosol-based exposure to opportunistic pathogens originating from hospital sink drains.

American journal of infection control·2025
Same author

Machine Learning Models Based on Histological Images from Healthy Donors Identify ImageQTLs and Predict Chronological Age.

bioRxiv : the preprint server for biology·2025
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Efficient algorithms significantly speed up tiling microarray data analysis by reducing pseudomedian calculations. This advancement addresses computational bottlenecks, enabling faster and more complex functional genomics studies.

Area of Science:

  • Functional genomics
  • Bioinformatics
  • Computational biology

Background:

  • Tiling microarrays are crucial for functional genomics, enabling tasks like transcript identification and DNA methylation detection.
  • Increasing feature densities in tiling arrays necessitate more efficient data analysis methods.
  • Current pseudomedian calculations for sliding window analysis have a high time complexity (O(n2logn)), creating computational bottlenecks.

Purpose of the Study:

  • To reduce the computational complexity of sliding window pseudomedian calculations in tiling microarray analysis.
  • To improve the efficiency and scalability of data analysis for high-resolution tiling array experiments.

Main Methods:

  • Implemented Monahan's HLQEST algorithm to reduce pseudomedian computation to O(nlogn).

Related Experiment Videos

  • Utilized skip lists to efficiently maintain sorted data in overlapping windows, further reducing computation.
  • Analyzed time complexity and benchmarked performance on synthetic datasets.

    • Main Results:

    • The HLQEST algorithm reduced smoothing procedure runtime by nearly 90% on a representative dataset.
    • The use of skip lists provided an additional 43% reduction in computation time.
    • Demonstrated favorable scaling properties of the implemented algorithms.

    Conclusions:

    • Developed efficient algorithms that significantly decrease computation time for tiling microarray analyses.
    • These optimized methods facilitate faster standard analyses and enable more complex, iterative analyses.
    • Provided source code and executables for wider adoption and further research.