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

Computing highly specific and mismatch tolerant oligomers efficiently.

Tomoyuki Yamada1, Shinichi Morishita

  • 1Department of Computational Biology, University of Tokyo, Tokyo, Japan. yamada@gi.k.u-tokyo.ac.jp

Proceedings. IEEE Computer Society Bioinformatics Conference
|February 3, 2006
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

Complete sequencing of medaka genomes reveals the architecture of centromeric satellites, giant mobile elements, and sex chromosomes.

Genome research·2026
Same author

Quantifying the Impact of Discrepancies Between Actual and Recorded Blood Sampling Times on Bayesian Forecasting for Area Under the Concentration-Time Curve Estimation of Vancomycin.

Basic & clinical pharmacology & toxicology·2026
Same author

Characterizing clinical patterns and associated factors of zinc-induced copper deficiency: Insights from large-scale pharmacovigilance databases.

Clinical nutrition ESPEN·2026
Same author

Accessing medically relevant complex regions with a pangenome graph of 20 near-complete Japanese haplotypes.

Nature communications·2026
Same author

Saturation Genome Editing Targeting <i>KRAS</i> Mutations in HCT 116 Colon Carcinoma Cells for Pooled SNV Functional Profiling in Diploid Cancer Model.

Current issues in molecular biology·2026
Same author

Recurrent Cytopathic Effects and Prolonged Viral Shedding in an Immunocompromised Patient With Malignant Lymphoma Treated With Rituximab and Bendamustine: A Case of Coronavirus Disease 2019 Relapse.

Clinical case reports·2026
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 an efficient algorithm for evaluating oligomer specificity using mismatch tolerance, significantly improving upon existing methods for genomic marker design. The new approach enhances the identification of qualified oligomers for applications like DNA microarrays.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Genome sequencing and large biological databases enable the design of specific oligomers for genomic markers, PCR primers, and DNA microarrays.
  • Evaluating oligomer specificity is crucial, with mismatch tolerance being a key metric for longer sequences.
  • Exact mismatch tolerance calculation is computationally intensive and impractical for large-scale analysis.

Purpose of the Study:

  • To develop an efficient method for checking if an oligomer meets a specified mismatch tolerance threshold.
  • To provide a practical solution for assessing oligomer specificity in genomic applications.
  • To enable the efficient computation of qualified oligomers for the human genome.

Main Methods:

  • A novel dynamic programming algorithm leveraging suffix and height arrays.

Related Experiment Videos

  • Efficient computation of a dense list of oligo-markers for the human genome.
  • Comparison of the new algorithm's performance against Abrahamson's algorithm.

    • Main Results:

    • The algorithm significantly outperforms Abrahamson's algorithm, running orders of magnitude faster.
    • Successfully enumerated 63% to approximately 79% of qualified oligomers for the human genome.
    • Demonstrated the algorithm's effectiveness in practical genomic applications.

    Conclusions:

    • The developed dynamic programming algorithm provides an efficient and practical solution for assessing oligomer mismatch tolerance.
    • This method accelerates the design and identification of highly specific oligomers for genomic applications.
    • The algorithm's speed and accuracy offer substantial improvements for large-scale genomic data analysis.