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

Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

7.1K
Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
7.1K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

376
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...
376
Modern Molecular Taxonomy01:29

Modern Molecular Taxonomy

804
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...
804
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.3K
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.3K
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

13.4K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
13.4K

You might also read

Related Articles

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

Sort by
Same author

Publisher Correction: Tumor transcriptional state predicts survival in immune-checkpoint-blockade-treated glioblastoma.

Nature cancer·2026
Same author

Predicting VNN resistance in European sea bass using machine learning on high dimensional low sample size data.

Frontiers in bioinformatics·2026
Same author

Reference-free k-mer based dissimilarity measures for metagenomes comparison.

Frontiers in bioinformatics·2026
Same author

Quantum ensembling methods for healthcare and life science.

Briefings in bioinformatics·2026
Same author

Tumor transcriptional state predicts survival in immune-checkpoint-blockade-treated glioblastoma.

Nature cancer·2026
Same author

Fast Hashing of Spaced Seeds with DuoHash.

Journal of computational biology : a journal of computational molecular cell biology·2026
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: Mar 8, 2026

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling
08:04

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling

Published on: October 8, 2019

9.2K

Efficient Algorithms for Sequence Analysis with Entropic Profiles.

Cinzia Pizzi, Mattia Ornamenti, Simone Spangaro

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |January 24, 2017
    PubMed
    Summary
    This summary is machine-generated.

    We developed faster algorithms to compute entropic profiles, which measure sequence predictability and identify conserved DNA regions. These new methods analyze longer sequences with greater resolution than existing approaches.

    More Related Videos

    Investigating Protein Sequence-structure-dynamics Relationships with Bio3D-web
    09:51

    Investigating Protein Sequence-structure-dynamics Relationships with Bio3D-web

    Published on: July 16, 2017

    16.2K
    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    36.2K

    Related Experiment Videos

    Last Updated: Mar 8, 2026

    DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling
    08:04

    DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling

    Published on: October 8, 2019

    9.2K
    Investigating Protein Sequence-structure-dynamics Relationships with Bio3D-web
    09:51

    Investigating Protein Sequence-structure-dynamics Relationships with Bio3D-web

    Published on: July 16, 2017

    16.2K
    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    36.2K

    Area of Science:

    • Bioinformatics
    • Information Theory
    • Computational Biology

    Background:

    • Entropy quantifies sequence predictability and repetitiveness.
    • Entropic profiles reveal subword under/over-representation and conserved DNA regions.
    • Current algorithms for entropic profile computation face limitations in speed and sequence length analysis.

    Purpose of the Study:

    • To develop efficient algorithms for computing entropic profiles.
    • To improve the analysis of DNA sequence conservation and predictability.
    • To enable the study of longer sequences at higher resolutions.

    Main Methods:

    • Linear time algorithms for entropic profile computation.
    • Utilized suffix-based data structures: truncated suffix tree (TST) and enhanced suffix array (ESA).
    • Extensive experimental validation of proposed algorithms.

    Main Results:

    • Achieved faster computation of entropic profiles compared to state-of-the-art methods.
    • Enabled analysis of significantly longer DNA sequences.
    • Maintained high resolution in sequence analysis.

    Conclusions:

    • The proposed linear time algorithms offer a significant advancement in entropic profile computation.
    • These algorithms enhance the capability to study DNA sequence properties and conservation.
    • The methods provide a more scalable and efficient approach for bioinformatics analyses.