Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Evolutionary Relationships through Genome Comparisons

Evolutionary Relationships through Genome Comparisons

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

Gene Evolution - Fast or Slow?

Gene Evolution - Fast or Slow?

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

Genome Annotation and Assembly

Genome Annotation and Assembly

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.

Phylogenetic Trees

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.

Karyotyping

Karyotyping

You might also read

Related Articles

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

Sort by

Same author

Sequence Flow: interactive web application for visualizing partial order alignments.

BMC genomics·2024

Same author

Linearization of genome sequence graphs revisited.

iScience·2021

Same author

Getting insight into the pan-genome structure with PangTree.

BMC genomics·2020

Same author

qDSB-Seq is a general method for genome-wide quantification of DNA double-strand breaks using sequencing.

Nature communications·2019

Same author

Comprehensive Mapping of Histone Modifications at DNA Double-Strand Breaks Deciphers Repair Pathway Chromatin Signatures.

Molecular cell·2018

Same author

Defective XRN3-mediated transcription termination in Arabidopsis affects the expression of protein-coding genes.

The Plant journal : for cell and molecular biology·2018

Same journal

A k-mer-based estimator of the substitution rate between repetitive sequences.

Algorithms for molecular biology : AMB·2026

Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026

Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026

Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026

Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026

Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026

See all related articles

Search research articles

Related Experiment Video

Updated: May 17, 2025

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

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

Published on: December 7, 2021

AlfaPang: alignment free algorithm for pangenome graph construction.

Adam Cicherski¹, Anna Lisiecka², Norbert Dojer³

¹Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland. a.cicherski2@uw.edu.pl.

Algorithms for Molecular Biology : AMB

|May 15, 2025

Summary

This summary is machine-generated.

AlfaPang is a new algorithm for building pangenome graphs, essential for genomics. This alignment-free method uses fewer computational resources than existing tools for large genome collections.

Keywords:

Genome alignment Pangenome Population genomics Variation graph

More Related Videos

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Novel Sequence Discovery by Subtractive Genomics

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

Related Experiment Videos

Last Updated: May 17, 2025

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

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

Published on: December 7, 2021

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Novel Sequence Discovery by Subtractive Genomics

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

Area of Science:

Genomics
Bioinformatics

Background:

Pangenome graph construction is crucial for analyzing large genome collections.
Current methods often require significant computational resources, limiting scalability.

Purpose of the Study:

To introduce AlfaPang, a novel algorithm for efficient pangenome graph construction.
To present an alignment-free approach that reduces computational demands.

Main Methods:

Developed AlfaPang, a new pangenome graph building algorithm.
Utilized a novel alignment-free strategy for graph construction.

Main Results:

AlfaPang constructs pangenome graphs efficiently.
The algorithm requires significantly fewer computational resources compared to state-of-the-art tools.
Demonstrated applicability to large genome collections.

Conclusions:

AlfaPang offers an efficient and resource-sparing alternative for pangenome graph construction.
The alignment-free approach enhances the feasibility of pangenome analysis for extensive genomic datasets.