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

20.4K
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.
20.4K
Comparing Copy Number Variations and SNPs02:26

Comparing Copy Number Variations and SNPs

18.5K
Sequencing of the human genome has opened up several best-kept secrets of the genome. Scientists have identified thousands of genome variations that exist within a population. These variations can be a single nucleotide or a larger chromosomal variation.
Copy number variations or CNVs are the structural variations that cover more than 1kb of DNA sequence. The single nucleotide polymorphism (SNP), on the other hand, is a single nucleotide change or a point mutation that is found in more than 1%...
18.5K
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

6.8K
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...
6.8K
Genome-wide Association Studies-GWAS01:11

Genome-wide Association Studies-GWAS

15.2K
Genome-wide association studies or GWAS are used to identify whether common SNPs are associated with certain diseases. Suppose specific SNPs are more frequently observed in individuals with a particular disease than those without the disease. In that case, those SNPs are said to be associated with the disease. Chi-square analysis is performed to check the probability of the allele likely to be associated with the disease.
GWAS does not require the identification of the target gene involved in...
15.2K
Genomics02:02

Genomics

39.5K
Genomics is the science of genomes: it is the study of all the genetic material of an organism. In humans, the genome consists of information carried in 23 pairs of chromosomes in the nucleus, as well as mitochondrial DNA. In genomics, both coding and non-coding DNA is sequenced and analyzed. Genomics allows a better understanding of all living things, their evolution, and their diversity. It has a myriad of uses: for example, to build phylogenetic trees, to improve productivity and...
39.5K
Next-generation Sequencing03:00

Next-generation Sequencing

97.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....
97.5K

You might also read

Related Articles

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

Sort by
Same author

Human donor liver viability evaluation with polarization-sensitive optical coherence tomography.

Science translational medicine·2026
Same author

Deep-learning-Assisted Photoacoustic and Ultrasound Evaluation for Pre-transplant Human Liver Graft Quality and Transplant Suitability.

medRxiv : the preprint server for health sciences·2026
Same author

Percutaneous nephrostomy guidance by a convolutional-neural-network-based optical coherence tomography endoscope.

Communications engineering·2026
Same author

Clinical relevance of mosaic variants detected by exome sequencing.

The Journal of allergy and clinical immunology·2026
Same author

Biochemical mechanism of <i>p</i> -cresol removal by <i>Thauera aminoaromatica</i> S2.

bioRxiv : the preprint server for biology·2026
Same author

Targeted deep sequencing identifies mosaicism in patients with immune dysregulation.

The Journal of allergy and clinical immunology·2026

Related Experiment Video

Updated: Jan 5, 2026

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance
04:58

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance

Published on: December 13, 2024

3.8K

Using Apache Spark on genome assembly for scalable overlap-graph reduction.

Alexander J Paul1, Dylan Lawrence2, Myoungkyu Song3

  • 1Bioinformatics and Computational Biology Program, Saint Louis University, St. Louis, MO, USA.

Human Genomics
|October 23, 2019
PubMed
Summary
This summary is machine-generated.

Scalable Overlap-graph Reduction Algorithms (SORA) offers a new approach for de novo genome assembly, efficiently processing large graphs on distributed systems and single machines. This method enhances speed and accuracy in genomic data analysis.

Keywords:
Apache sparkCloud computingGenome assemblyGraph reductionOverlap-layout-consensus

More Related Videos

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.7K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.7K

Related Experiment Videos

Last Updated: Jan 5, 2026

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance
04:58

Author Spotlight: Investigating the Role of Repetitive DNA Misregulation in Cancer Initiation and Immunotherapy Resistance

Published on: December 13, 2024

3.8K
Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.7K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.7K

Area of Science:

  • Genomics
  • Bioinformatics
  • Computational Biology

Background:

  • De novo genome assembly reconstructs a genome from overlapping DNA fragments without a reference.
  • Current high-throughput sequencing methods generate massive datasets, leading to huge overlap graphs.
  • Existing techniques face challenges with high memory requirements and parallel computation for large graphs.

Purpose of the Study:

  • To introduce an innovative algorithmic approach, Scalable Overlap-graph Reduction Algorithms (SORA), for efficient de novo genome assembly.
  • To address the computational limitations of existing genome assembly methods.

Main Methods:

  • Developed SORA, an algorithm package utilizing Apache Spark for string graph reduction.
  • Implemented SORA to perform de novo genome assembly on single machines and distributed platforms.
  • Leveraged Apache Spark's GraphX and GraphFrames for scalable graph processing.

Main Results:

  • SORA successfully processed a nearly one billion edge graph on a distributed cloud cluster.
  • Mid-to-small size graphs were processed efficiently on a single workstation.
  • Demonstrated linear-scaling performance with increased computing instances.

Conclusions:

  • SORA provides a scalable and efficient solution for de novo genome assembly.
  • The algorithm package effectively reduces computational demands for large genomic datasets.
  • SORA enables faster and more accurate genome assembly across different computing environments.