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

Efficient non-unique probes selection algorithms for DNA microarray.

Ping Deng1, My T Thai, Qingkai Ma

  • 1Computer Science Department, the University of Illinois at Springfield, Springfield, IL 62703, USA. pdeng2@uis.edu

BMC Genomics
|April 17, 2008
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

Research on Fault Type Identification for Distribution Networks with Distributed Power Sources Based on Improved CNN-BiGRU.

Sensors (Basel, Switzerland)·2026
Same author

A Non-Channel Function of CFTR: Attenuating Mitochondrial Oxidative Stress and Cardiomyocyte Senescence via Stabilization by USP45.

Aging cell·2026
Same author

Integrated Multi-Omics Characterization of the Salt-Sensitive Mutant <i>sss1</i> in Soybean.

Plants (Basel, Switzerland)·2026
Same author

Manifestations and Influencing Factors of Posttraumatic Growth Among Ovarian Cancer Patients Undergoing Chemotherapy: A Qualitative Exploration.

International journal of women's health·2026
Same author

Polyphyllin B induces ferroptosis in triple-negative breast cancer by inactivating NRF2.

Frontiers in pharmacology·2026
Same author

Lipid disturbance and neuroinflammation contribute to Aflatoxin B<sub>1</sub>-linked Parkinsonism: an in vitro, in vivo, and Parkinsonism patients' integrating evidence.

Environment international·2026
Same journal

Chromosomal scale genome assembly of medicinal plant Sophora tonkinensis.

BMC genomics·2026
Same journal

Variant-specific RNA testing resolves variants of uncertain significance in exome testing.

BMC genomics·2026
Same journal

Kaiso overexpression promotes an interferon immune response in murine intestines.

BMC genomics·2026
Same journal

Genomic evidence of ecological flexibility and cross-niche CRISPR spacerome targeting phage-plasmid hybrids in Latilactobacillus curvatus.

BMC genomics·2026
Same journal

Fgf evolution in vertebrates: insights from cyclostomes.

BMC genomics·2026
Same journal

Metabolic reprogramming, oxidative stress, and mitophagy in JSRV Env-transformed BEAS-2B cells: insights from integrated transcriptomics and metabolomics.

BMC genomics·2026
See all related articles

Researchers developed algorithms to select a minimum set of non-unique probes for identifying multiple targets, even with experimental errors. This approach reduces DNA microarray costs and complexity.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Molecular Diagnostics

Background:

  • Optimizing probe selection is crucial for accurate target identification in molecular assays.
  • High similarity in target sequences often prevents the use of unique probes.
  • Non-unique probes offer a solution but require careful selection strategies.

Purpose of the Study:

  • To develop an efficient method for selecting a minimum set of non-unique probes.
  • To enable the identification of multiple targets (up to d) using these probes.
  • To ensure robust target identification in the presence of experimental errors (up to k).

Main Methods:

  • Utilized Integer Linear Programming (ILP) for probe set selection.
  • Employed d-disjunct matrices to define probe-target relationships.

Related Experiment Videos

  • Developed algorithms with a decoding complexity of O(n).

    • Main Results:

    • Proposed efficient ILP-based algorithms for minimum non-unique probe selection.
    • Demonstrated the ability to identify up to d targets with at most k errors.
    • Experimental results showed significantly faster decoding times compared to d-separable matrix methods.
    • Achieved comparable running times and solution sizes to existing methods.

    Conclusions:

    • Non-unique probes are essential when unique probes are not feasible.
    • Minimizing non-unique probe sets leads to reduced DNA microarray design costs.
    • The developed algorithms maintain decoding ability while minimizing probe sets.
    • The algorithms offer efficient target identification with error tolerance and low decoding complexity.