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

Genome Annotation and Assembly03:36

Genome Annotation and Assembly

19.3K
The genome refers to all of the genetic material in an organism. It can range from a few million base pairs in microbial cells to several billion base pairs in many eukaryotic organisms. Genome assembly refers to the process of taking the DNA sequencing data and putting it all back together in a correct order to create a close representation of the original genome. This is followed by the identification of functional elements on the newly assembled genome, a process called genome annotation.
19.3K
Karyotyping01:17

Karyotyping

62.4K
Overview
62.4K
Sanger Sequencing01:57

Sanger Sequencing

757.1K
DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...
757.1K

You might also read

Related Articles

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

Sort by
Same author

Polysaccharide-functionalized Nanoemulsions for Enhanced Gastric Targeting in Helicobacter pylori-induced Peptic Ulcers: An Integrative Drug-delivery Perspective.

Recent advances in anti-infective drug discovery·2026
Same author

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same author

Cannabidiol in Digital Fatigue: Neuroadaptive Mechanisms and Therapeutic Perspectives on Chronic Screen Exposure.

CNS & neurological disorders drug targets·2026
Same author

Synergistic Interplay Between Probiotic-coated Nanoparticles and Antimicrobial Peptides in Food Biochemistry: Engineering Bioremediation Agents for Heavy Metal Detoxification.

Recent advances in food, nutrition & agriculture·2026
Same author

Immunomodulatory Nanocarriers in Multiple Sclerosis: Dual Targeting of Microglia and Mitochondria for Precision Neurotherapy.

Anti-inflammatory & anti-allergy agents in medicinal chemistry·2026
Same author

Polythiophene Nanocomposites as Smart and Sustainable Materials: Advancements in Energy, Environmental, and Biomedical Technologies.

Anti-inflammatory & anti-allergy agents in medicinal chemistry·2026

Related Experiment Video

Updated: Sep 11, 2025

Optimization and Comparative Analysis of Plant Organellar DNA Enrichment Methods Suitable for Next-generation Sequencing
12:33

Optimization and Comparative Analysis of Plant Organellar DNA Enrichment Methods Suitable for Next-generation Sequencing

Published on: July 28, 2017

13.0K

On the Coverage Required for Diploid Genome Assembly.

Daanish Mahajan, Chirag Jain, Navin Kashyap

    IEEE Transactions on Computational Biology and Bioinformatics
    |August 14, 2025
    PubMed
    Summary

    Achieving a complete diploid genome assembly requires specific sequencing coverage and read lengths. Current algorithms need higher coverage than theoretically necessary due to repeat bridging challenges.

    Area of Science:

    • Genomics
    • Bioinformatics
    • Computational Biology

    Background:

    • Telomere-to-telomere genome assembly is crucial for complete sequence reconstruction.
    • Repeat content and heterozygosity significantly impact assembly feasibility.
    • The theoretical requirements for diploid genome assembly are not fully understood.

    Purpose of the Study:

    • To investigate the information-theoretic conditions for diploid genome reconstruction.
    • To analyze the coverage and read length demands of standard assembly algorithms.
    • To derive conditions for overlap graph-based assembly.

    Main Methods:

    • Information-theoretic analysis of sequencing read requirements.
    • Mathematical modeling of diploid genome reconstruction.

    More Related Videos

    Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
    12:08

    Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies

    Published on: August 20, 2021

    5.2K
    Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform
    09:30

    Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform

    Published on: August 17, 2022

    3.2K

    Related Experiment Videos

    Last Updated: Sep 11, 2025

    Optimization and Comparative Analysis of Plant Organellar DNA Enrichment Methods Suitable for Next-generation Sequencing
    12:33

    Optimization and Comparative Analysis of Plant Organellar DNA Enrichment Methods Suitable for Next-generation Sequencing

    Published on: July 28, 2017

    13.0K
    Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
    12:08

    Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies

    Published on: August 20, 2021

    5.2K
    Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform
    09:30

    Pre-Implantation Genetic Testing for Aneuploidy on a Semiconductor Based Next-Generation Sequencing Platform

    Published on: August 17, 2022

    3.2K
  • Evaluation of greedy and de-Bruijn graph assembly algorithms.

    • Main Results:

    • Identified information-theoretic lower bounds for diploid genome assembly.
    • Demonstrated that standard algorithms require higher coverage and read length than the theoretical minimum.
    • Showed that bridging double repeats increases algorithm complexity and resource needs.
    • Derived necessary conditions for overlap graph-based assembly.

    Conclusions:

    • The theoretical minimum coverage and read length for diploid genome assembly are lower than practical algorithm requirements.
    • Bridging genomic repeats is a key challenge for current assembly algorithms.
    • Further research is needed to optimize assembly algorithms for complex genomes.