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 Concept Videos

Modern Molecular Taxonomy01:29

Modern Molecular Taxonomy

837
Advancements in molecular biology have revolutionized the identification and characterization of bacteria, with multiple methods leveraging DNA sequencing for enhanced precision. As sequencing technologies improve and costs decline, these approaches are increasingly used in clinical, environmental, and evolutionary studies.Multilocus Sequence Typing (MLST) examines several housekeeping genes, essential chromosomal genes encoding cellular functions, to distinguish strains. Approximately...
837
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

407
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
407
RACE - Rapid Amplification of cDNA Ends02:35

RACE - Rapid Amplification of cDNA Ends

7.6K
Rapid Amplification of cDNA Ends, or RACE, is one of the most effective methods to obtain a full-length cDNA from an mRNA sequence between a known internal region to the unknown sequence at the 5’ or 3’ end. The unknown region is cloned in the cDNA by a gene-specific primer that binds the known end, and a hybrid primer that attaches a predefined anchor sequence to the unknown end of the cDNA. The sequence in between is amplified by PCR with an anchor primer and a gene-specific...
7.6K
DNA Isolation01:24

DNA Isolation

46.7K
DNA isolation protocols can be fast and straightforward or complex and time-consuming depending on the type and quality of DNA required for further processing. For example, plasmid DNA extraction is a bit more complicated than genomic DNA extraction because of the need for an appropriate lysis method to separate plasmid DNA from gDNA during isolation. However, for specific applications, such as long-range DNA sequencing that require a good yield of high- quality DNA samples, we need to follow...
46.7K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Panaln: indexing pangenome for read alignment.

Bioinformatics (Oxford, England)·2025
Same author

An efficient Burrows-Wheeler transform-based aligner for short read mapping.

Computational biology and chemistry·2024
Same author

Temporal Output Discrepancy for Loss Estimation-Based Active Learning.

IEEE transactions on neural networks and learning systems·2022
Same author

CIndex: compressed indexes for fast retrieval of FASTQ files.

Bioinformatics (Oxford, England)·2021
Same author

Learning Causal Structures Based on Divide and Conquer.

IEEE transactions on cybernetics·2020
Same author

Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections.

IEEE/ACM transactions on computational biology and bioinformatics·2020
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Apr 4, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
07:55

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

10.8K

An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.

Qiang Yu, Hongwei Huo, Jeffrey Scott Vitter

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |September 11, 2015
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces StemFinder for motif stem search (MSS) on large biological sequence alphabets. StemFinder efficiently finds minimal motif stem sets, improving upon existing methods for discovering significant sequence segments.

    More Related Videos

    Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
    07:08

    Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

    Published on: July 14, 2015

    7.8K
    Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
    08:21

    Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids

    Published on: April 13, 2022

    3.2K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
    07:55

    Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

    Published on: May 31, 2011

    10.8K
    Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
    07:08

    Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

    Published on: July 14, 2015

    7.8K
    Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
    08:21

    Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids

    Published on: April 13, 2022

    3.2K

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Genomics

    Background:

    • Planted motif search (PMS) is crucial for identifying significant segments in biological sequences.
    • Existing PMS methods have limitations when dealing with large alphabets.
    • Motif stem search (MSS) addresses PMS challenges on large alphabets using wildcard-containing strings.

    Purpose of the Study:

    • To precisely represent motif stems using regular expressions.
    • To develop a method for generating non-redundant motif stems.
    • To propose an efficient exact algorithm, StemFinder, for solving the MSS problem.

    Main Methods:

    • Utilized regular expressions for enhanced motif stem representation.
    • Developed a novel algorithm for generating all possible motif stems without redundant wildcards.
    • Implemented StemFinder, an exact algorithm for motif stem search.

    Main Results:

    • StemFinder significantly outperforms previous MSS algorithms in speed.
    • StemFinder reports a smaller set of stems, representing a more concise superset of motifs.
    • The algorithm effectively handles large alphabets in motif discovery.

    Conclusions:

    • StemFinder provides an efficient and precise solution for motif stem search on large alphabets.
    • The developed method improves the discovery of significant segments in biological sequences.
    • StemFinder offers a valuable tool for bioinformatics research, available at http://sites.google.com/site/feqond/stemfinder.