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

22.0K
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.
22.0K
Next-generation Sequencing03:00

Next-generation Sequencing

101.5K
The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
101.5K
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
Sanger Sequencing01:57

Sanger Sequencing

779.0K
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...
779.0K
Genomic DNA in Eukaryotes00:58

Genomic DNA in Eukaryotes

54.2K
Eukaryotes have large genomes compared to prokaryotes. To fit their genomes into a cell, eukaryotic DNA is packaged extraordinarily tightly inside the nucleus. To achieve this, DNA is tightly wound around proteins called histones, which are packaged into nucleosomes that are joined by linker DNA and coil into chromatin fibers. Additional fibrous proteins further compact the chromatin, which is recognizable as chromosomes during certain phases of cell division.
54.2K
Genome Copying Errors02:46

Genome Copying Errors

5.5K
DNA replication is a well-evolved process that copies millions of base pairs with high fidelity during each cell division. Occasionally a wrong base or a long stretch of wrong bases may get added to the daughter strands. If the errors are left unchecked, cells might accumulate several mutations that might endanger their  survival. Therefore, the copying errors are checked and repaired at three levels.
5.5K

You might also read

Related Articles

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

Sort by
Same author

IIC-DTI: A Contrastive Learning Enhanced Inter-Intra Molecular Fusing Framework for Drug-Target Interaction Prediction.

Interdisciplinary sciences, computational life sciences·2026
Same author

Graph convolution network based on meta-paths and mutual information for drug-target interaction prediction.

BMC bioinformatics·2025
Same author

The study of the variation of mineral distribution and relative concentration on varieties of oat using synchrotron-based X-ray fluorescence imaging.

Food research international (Ottawa, Ont.)·2025
Same author

Predicting miRNA-Drug Interactions Based on Multi-source Feature Fusion of Heterogeneous Network.

Interdisciplinary sciences, computational life sciences·2025
Same author

Low-Count PET Image Reconstruction With Generalized Sparsity Priors via Unrolled Deep Networks.

IEEE journal of biomedical and health informatics·2025
Same author

Unraveling bladder cancer-related circRNA biomarkers: a hybrid model combining deep learning and statistics.

Health information science and systems·2025
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026
Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026
Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026
Same journal

Primer Design through Submodular Function Estimation.

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

Related Experiment Video

Updated: Apr 4, 2026

Novel Sequence Discovery by Subtractive Genomics
09:40

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

9.3K

EPGA2: memory-efficient de novo assembler.

Junwei Luo1, Jianxin Wang2, Weilong Li2

  • 1School of Information Science and Engineering, Central South University, ChangSha, 410083, China, College of Computer Science and Technology, Henan Polytechnic University, JiaoZuo, 454000, China.

Bioinformatics (Oxford, England)
|August 29, 2015
PubMed
Summary
This summary is machine-generated.

EPGA2 is a new genome assembly algorithm designed for low memory usage. It improves assembly results by using memory-efficient tools and parallel processing, making it practical for researchers with limited computing resources.

More Related Videos

An Experimental and Bioinformatics Protocol for RNA-seq Analyses of Photoperiodic Diapause in the Asian Tiger Mosquito, Aedes albopictus
12:10

An Experimental and Bioinformatics Protocol for RNA-seq Analyses of Photoperiodic Diapause in the Asian Tiger Mosquito, Aedes albopictus

Published on: November 30, 2014

14.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

6.0K

Related Experiment Videos

Last Updated: Apr 4, 2026

Novel Sequence Discovery by Subtractive Genomics
09:40

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

9.3K
An Experimental and Bioinformatics Protocol for RNA-seq Analyses of Photoperiodic Diapause in the Asian Tiger Mosquito, Aedes albopictus
12:10

An Experimental and Bioinformatics Protocol for RNA-seq Analyses of Photoperiodic Diapause in the Asian Tiger Mosquito, Aedes albopictus

Published on: November 30, 2014

14.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

6.0K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • High-throughput sequencing generates vast amounts of data, demanding significant computational resources for genome assembly.
  • Existing genome assembly software often requires large memory capacities, limiting accessibility for researchers with constrained computing environments.

Purpose of the Study:

  • To present EPGA2, an updated genome assembly algorithm designed for efficient operation in low-memory environments.
  • To improve the practicality of genome assembly software for researchers facing limitations in computing resources.

Main Methods:

  • EPGA2 utilizes a memory-efficient DSK for K-mer counting.
  • The algorithm employs a revised BCALM for De Bruijn Graph construction.
  • EPGA2 incorporates parallel processing for Contigs Merging and includes an Errors Correction module.

Main Results:

  • EPGA2 demonstrates improved genome assembly results with reduced peak memory usage.
  • The integration of memory-efficient modules and parallelization enhances the algorithm's performance.
  • Experimental results confirm the utility of EPGA2's enhancements for practical genome assembly.

Conclusions:

  • EPGA2 offers a viable solution for genome assembly in memory-constrained settings.
  • The algorithm's design facilitates broader application of genome assembly techniques.
  • EPGA2 represents a significant advancement in efficient genome assembly software.