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

Rapid large-scale oligonucleotide selection for microarrays.

Sven Rahmann1

  • 1Computational Molecular Biology, MPI for Molecular Genetics, Dept. of Mathematics and Computer Science, Free University of Berlin, Berlin, Germany. Sven.Rahmann@molgen.mpg.de

Proceedings. IEEE Computer Society Bioinformatics Conference
|April 20, 2005
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

Epitope prediction algorithms for peptide-based vaccine design.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
Same journal

Keynote address: the role of algorithmic research in computational genomics.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
Same journal

Stepping up the pace of discovery: the genomes to life program.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
Same journal

Prokaryote phylogeny without sequence alignment: from avoidance signature to composition distance.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
Same journal

Efficient reconstruction of phylogenetic networks with constrained recombination.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
Same journal

A new approach for gene annotation using unambiguous sequence joining.

Proceedings. IEEE Computer Society Bioinformatics Conference·2006
See all related articles

This study introduces a novel algorithm for large-scale oligonucleotide probe selection for microarrays, utilizing the longest common substring for enhanced specificity. The method efficiently designs custom oligos for any genome, accelerating genomic research.

Area of Science:

  • Genomics
  • Bioinformatics
  • Molecular Biology

Background:

  • Microarray experiments require specific oligonucleotide probes for accurate gene expression analysis.
  • Current methods for large-scale probe selection can be time-consuming and computationally intensive.
  • Designing custom oligos with specific characteristics presents a significant challenge.

Purpose of the Study:

  • To develop the first algorithm for large-scale oligonucleotide probe selection for microarray experiments.
  • To improve the efficiency and specificity of candidate oligo identification.
  • To facilitate the design of custom oligos for any sequenced genome.

Main Methods:

  • Developed a novel algorithm utilizing suffix arrays with additional information for efficient oligo selection.

Related Experiment Videos

  • Employed the longest common substring as a key measure of oligo specificity.
  • Introduced 'master sequences' to manage constraints like oligo length, melting temperature, and self-complementarity separately.

    • Main Results:

    • The algorithm enables large-scale oligonucleotide probe selection, with human gene oligos identified within 50 hours.
    • The method demonstrates high efficiency in both memory usage and running time.
    • Successfully ranks candidate oligos based on their specificity.

    Conclusions:

    • This algorithm represents a significant advancement in designing custom oligonucleotide probes for microarray applications.
    • The approach enhances the feasibility of on-site chip synthesis and accelerates genomic research.
    • Custom oligo design is now more accessible for any sequenced genome.