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

Fast large scale oligonucleotide selection using the longest common factor approach.

Sven Rahmann1

  • 1Max-Planck-Institute for Molecular Genetics, Ihnestrasse 63-73, D-14195 Berlin, Germany. Sven.Rahmann@molgen.mpg.de

Journal of Bioinformatics and Computational Biology
|August 4, 2004
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

Integrated flexible DNA methylation-chromatin segmentation modeling enhances epigenomic state annotation.

Nucleic acids research·2026
Same author

Cleanifier: contamination removal from microbial sequences using spaced seeds of a human pangenome index.

Bioinformatics (Oxford, England)·2025
Same author

Sustainable data analysis with Snakemake.

F1000Research·2025
Same author

Activation of NF-κB Signaling by Optogenetic Clustering of IKKα and β.

Advanced biology·2025
Same author

Swiftly identifying strongly unique k-mers.

Algorithms for molecular biology : AMB·2025
Same author

A comprehensive review and evaluation of species richness estimation.

Briefings in bioinformatics·2025
Same journal

CNV-ECOD: A copy number variation detection method based on ECOD algorithm using next-generation sequencing data.

Journal of bioinformatics and computational biology·2026
Same journal

ReinVar: A model-free paradigm-based reinforcement learning approach to detect copy number variation.

Journal of bioinformatics and computational biology·2026
Same journal

When pipelines run but coordinates fail: A simple spatial specificity check for false locality in post-GWAS analysis.

Journal of bioinformatics and computational biology·2026
Same journal

Comparative benchmarking of template-based, evolutionary-diffusion, and generative language models for IsPETase structure prediction.

Journal of bioinformatics and computational biology·2026
Same journal

Trap spaces as labelled ideals of SCC posets: A structural-functional theory of reachability in asynchronous boolean networks.

Journal of bioinformatics and computational biology·2026
Same journal

Erratum - DDINet: Drug-drug interaction prediction network based on multi-molecular fingerprint features and multi-head attention centered weighted autoencoder.

Journal of bioinformatics and computational biology·2026
See all related articles

This study introduces a rapid method for selecting oligonucleotide probes for large-scale microarray experiments, significantly accelerating the design process for DNA 25-mers. The new approach utilizes longest common substring analysis for enhanced specificity and efficiency in probe selection.

Area of Science:

  • Genomics
  • Bioinformatics
  • Molecular Biology

Background:

  • Microarray experiments require specific oligonucleotide probes for accurate gene expression analysis.
  • Current methods for designing these probes can be time-consuming, limiting large-scale applications.
  • The demand for custom oligonucleotide design is increasing with advancements in genomic sequencing and on-site chip synthesis.

Purpose of the Study:

  • To develop a fast and scalable method for selecting oligonucleotide probes for microarray experiments.
  • To improve the efficiency of identifying reliable DNA 25-mers for genomic applications.
  • To enable custom oligo design for any sequenced genome.

Main Methods:

  • Utilized the longest common substring as a specificity measure for candidate oligonucleotide probes.

Related Experiment Videos

  • Developed a space- and time-efficient algorithm based on suffix arrays to compute matching statistics.
  • Incorporated constraints like oligo length, melting temperature, and self-complementarity in a postprocessing stage.

    • Main Results:

    • Achieved a speedup of one to two orders of magnitude in probe selection compared to previous methods.
    • Enabled reliable oligo selection for human genes within four days.
    • Demonstrated the feasibility of designing custom oligos for any sequenced genome.

    Conclusions:

    • The developed method offers a significant advancement in the speed and scale of oligonucleotide probe design.
    • This approach facilitates the integration of custom oligo design with emerging on-site chip synthesis technologies.
    • The method provides a robust solution for large-scale genomic research and diagnostics.