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

Algorithms and software for support of gene identification experiments

S H Sze1, M A Roytberg, M S Gelfand

  • 1Department of Computer Science, University of Southern California, Los Angeles 90089-1113, USA.

Bioinformatics (Oxford, England)
|April 1, 1998
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

Strong-field ionization in particle-in-cell simulations.

Physical review. E·2025
Same author

Fastq-dupaway: a fast and memory-efficient tool for deduplication of single- and paired-end NGS data.

Scientific reports·2025
Same author

Integration of HiMoRNA and RNAChrom: Validation of the Functional Role of Long Non-coding RNAs in the Epigenetic Regulation of Human Genes Using RNA-Chromatin Interactome Data.

Acta naturae·2025
Same author

Multiplicity of electron- and photon-seeded electromagnetic showers at multipetawatt laser facilities.

Physical review. E·2025
Same author

ProAD - A database of rotary ion-translocating ATPases in prokaryotic genomes.

Frontiers in molecular biosciences·2025
Same author

Towards practical applications in quantum computational biology.

Nature computational science·2024
Same journal

Probabilistic RNA designability via interpretable ensemble approximation and dynamic decomposition.

Bioinformatics (Oxford, England)·2026
Same journal

Quantifying domain-specific relevance of computational biology Wikipedia articles using TF-IDF and cosine similarity.

Bioinformatics (Oxford, England)·2026
Same journal

GATSBI: improving context-aware protein embeddings through biologically motivated data splits.

Bioinformatics (Oxford, England)·2026
Same journal

BiMba: using Vision Mamba to predict protein sites that bind other proteins.

Bioinformatics (Oxford, England)·2026
Same journal

ProMeta: a meta-learning framework for robust disease diagnosis and prediction from plasma proteomics.

Bioinformatics (Oxford, England)·2026
Same journal

Is a Win-Win possible? Achieving pareto-optimal privacy-utility balance in fine-tuned genome language model embeddings against embedding reconstruction attacks.

Bioinformatics (Oxford, England)·2026
See all related articles

This study introduces a novel algorithm for accurate experimental gene identification, bypassing unreliable gene prediction. The method efficiently designs PCR primers, reducing experimental effort and improving gene discovery for disease research.

Area of Science:

  • Genomics
  • Molecular Biology
  • Bioinformatics

Background:

  • Gene prediction algorithms often err, hindering accurate gene annotation.
  • Biologists rely on time-consuming experimental methods for gene identification due to prediction inaccuracies.
  • Current methods for designing PCR primers for gene identification are often based on unreliable predictions, leading to wasted experimental efforts.

Purpose of the Study:

  • To develop a simple and reliable algorithm for experimental gene identification that bypasses the gene prediction step.
  • To enable accurate gene identification using a reduced number of PCR primers.
  • To provide tools for mutation analysis and cDNA library screening.

Main Methods:

  • A novel algorithm is proposed to identify short genomic regions likely to overlap with gene exons.

Related Experiment Videos

  • The algorithm is enhanced to find segments suitable for PCR primers for selective amplification in cDNA libraries.
  • The approach is extended to generate PCR primers for uniform coverage of translated regions for RT-PCR and mRNA sequencing.

    • Main Results:

    • The algorithm achieves accurate gene identification with a minimal set of PCR primers.
    • Predictions from the algorithm facilitate exon amplification for preliminary mutation analysis.
    • The developed primers enable efficient screening of cDNA libraries and RT-PCR for gene discovery.

    Conclusions:

    • The proposed algorithm offers a reliable and efficient method for experimental gene identification.
    • This approach significantly reduces the experimental effort and cost associated with gene discovery.
    • The algorithm provides a valuable tool for identifying disease-related genes and characterizing unknown mRNA.