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

Next-generation Sequencing03:00

Next-generation Sequencing

87.9K
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....
87.9K
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

5.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...
5.8K
Sanger Sequencing01:57

Sanger Sequencing

800.8K
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...
800.8K
Genome Annotation and Assembly03:36

Genome Annotation and Assembly

16.7K
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.
16.7K
Gene Duplication and Divergence02:37

Gene Duplication and Divergence

6.8K
The seminal work of Ohno in 1970 popularized the idea of gene duplication and divergence. DNA sequence comparison studies reveal that a large portion of the genes in bacteria, archaebacteria, and eukaryotes was  generated by gene duplication and divergence, indicating its critical role in evolution.
The duplicated copies of the gene are called Paralogs. Paralogs with similar sequences and functions form a gene family. Across several species, a large number of gene families are...
6.8K
Complementary DNA01:44

Complementary DNA

27.7K
Overview
27.7K

You might also read

Related Articles

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

Sort by
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

Fast Hashing of Spaced Seeds with DuoHash.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

USTAR-CR: Efficient and Compact Compression of <i>k</i>-Mer Sets Through Colored de Bruijn Graphs.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

MISSH: Fast Hashing of Multiple Spaced Seeds.

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

Enhanced Compression of <i>k</i>-Mer Sets with Counters via de Bruijn Graphs.

Journal of computational biology : a journal of computational molecular cell biology·2024
Same author

ClassGraph: Improving Metagenomic Read Classification with Overlap Graphs.

Journal of computational biology : a journal of computational molecular cell biology·2023
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

Related Experiment Video

Updated: May 2, 2026

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma
08:53

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma

Published on: June 10, 2017

9.3K

Parallel continuous flow: a parallel suffix tree construction tool for whole genomes.

Matteo Comin1, Montse Farreras

  • 11 Department of Information Engineering, University of Padova , Padova, Italy .

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 7, 2014
PubMed
Summary
This summary is machine-generated.

We developed parallel continuous flow (PCF), a new method for constructing suffix trees for large genomes. PCF efficiently indexes massive datasets like the human genome, enabling faster bioinformatics analyses.

More Related Videos

G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome
06:40

G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome

Published on: March 22, 2018

5.0K
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.1K

Related Experiment Videos

Last Updated: May 2, 2026

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma
08:53

Flow-sorting and Exome Sequencing of the Reed-Sternberg Cells of Classical Hodgkin Lymphoma

Published on: June 10, 2017

9.3K
G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome
06:40

G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome

Published on: March 22, 2018

5.0K
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.1K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Modern sequencing technologies generate massive biological sequence data.
  • Analyzing large genomic datasets requires efficient indexing and querying methods.
  • Existing suffix tree construction methods struggle with very long sequences.

Purpose of the Study:

  • To present a novel parallel suffix tree construction method suitable for very long genomes.
  • To demonstrate the scalability and efficiency of the proposed method.
  • To enable faster analysis of large-scale genomic data.

Main Methods:

  • Parallel Continuous Flow (PCF) algorithm for suffix tree construction.
  • Implementation tested on the entire human genome (approximately 3GB).
  • Evaluation of performance and scalability with varying numbers of processors.

Main Results:

  • PCF successfully constructed the suffix tree for the entire human genome.
  • The method demonstrated graceful scalability as input genome size increased.
  • Achieved 90% efficiency with 36 processors and 55% with 172 processors.
  • Indexed the human genome in 7 minutes using 172 processors.

Conclusions:

  • Parallel Continuous Flow (PCF) is an efficient and scalable method for suffix tree construction.
  • PCF is well-suited for handling the massive datasets generated by modern sequencing technologies.
  • This method facilitates rapid querying of multiple genomes, advancing bioinformatics research.