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

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.

Microbial Phylogeny

Microbial Phylogeny

Understanding the evolutionary relationships among microorganisms is fundamental to microbial ecology and taxonomy. Phylogenetic trees are essential tools for inferring these relationships, relying primarily on comparative analyses of molecular sequences such as DNA, RNA, or proteins. In microbial studies, these trees typically depict the evolutionary paths of diverse bacterial and archaeal species by mapping genetic differences accumulated over time.Phylogenetic trees are composed of tips,...

Genome-wide Association Studies-GWAS

Genome-wide Association Studies-GWAS

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

Modern Molecular Taxonomy

Modern Molecular Taxonomy

Advancements in molecular biology have revolutionized the identification and characterization of bacteria, with multiple methods leveraging DNA sequencing for enhanced precision. As sequencing technologies improve and costs decline, these approaches are increasingly used in clinical, environmental, and evolutionary studies.Multilocus Sequence Typing (MLST) examines several housekeeping genes, essential chromosomal genes encoding cellular functions, to distinguish strains. Approximately...

You might also read

Related Articles

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

Sort by

Same author

Enabling Intelligent IoTs for Histopathology Image Analysis Using Convolutional Neural Networks.

Micromachines·2022

Same author

Systems-Based Approach for Optimization of Assembly-Free Bacterial MLST Mapping.

Life (Basel, Switzerland)·2022

Same author

A consensus-based ensemble approach to improve transcriptome assembly.

BMC bioinformatics·2021

Same author

Maize Tassel Detection From UAV Imagery Using Deep Learning.

Frontiers in robotics and AI·2021

Same author

ProkEvo: an automated, reproducible, and scalable framework for high-throughput bacterial population genomics analyses.

PeerJ·2021

Same author

Gene Gangs of the Chloroviruses: Conserved Clusters of Collinear Monocistronic Genes.

Viruses·2018

Same journal

In silico analysis, annotation and characterisation of putative ESTs from Sorghum bicolor associated with heat stress.

International journal of bioinformatics research and applications·2015

Same journal

Docking analysis of gallic acid derivatives as HIV-1 protease inhibitors.

International journal of bioinformatics research and applications·2015

Same journal

Automatic segmentation of Potyviridae family polyproteins.

International journal of bioinformatics research and applications·2015

Same journal

Neural network and rough set hybrid scheme for prediction of missing associations.

International journal of bioinformatics research and applications·2015

Same journal

On the interconnection of stable protein complexes: inter-complex hubs and their conservation in Saccharomyces cerevisiae and Homo sapiens networks.

International journal of bioinformatics research and applications·2015

Same journal

Diversity and evolution of the envelope gene of dengue virus type 1 circulating in India in recent times.

International journal of bioinformatics research and applications·2015

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 8, 2026

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

Multiple genome alignment based on longest path in directed acyclic graphs.

Fangrui Ma¹, Jitender S Deogun

¹The Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, USA. fangrui.ma@gmail.com

International Journal of Bioinformatics Research and Applications

|October 14, 2010

Summary

This summary is machine-generated.

This study introduces an efficient algorithm for multiple genome sequence alignment using a novel graph-based approach. The method accurately aligns sequences and outperforms existing tools, offering flexibility for various alignment needs.

More Related Videos

Comprehensive Workflow for the Genome-wide Identification and Expression Meta-analysis of the ATL E3 Ubiquitin Ligase Gene Family in Grapevine

Comprehensive Workflow for the Genome-wide Identification and Expression Meta-analysis of the ATL E3 Ubiquitin Ligase Gene Family in Grapevine

Published on: December 22, 2017

A Pathway Association Study Tool for GWAS Analyses of Metabolic Pathway Information

A Pathway Association Study Tool for GWAS Analyses of Metabolic Pathway Information

Published on: July 1, 2020

Related Experiment Videos

Last Updated: Jun 8, 2026

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

Comprehensive Workflow for the Genome-wide Identification and Expression Meta-analysis of the ATL E3 Ubiquitin Ligase Gene Family in Grapevine

Comprehensive Workflow for the Genome-wide Identification and Expression Meta-analysis of the ATL E3 Ubiquitin Ligase Gene Family in Grapevine

Published on: December 22, 2017

A Pathway Association Study Tool for GWAS Analyses of Metabolic Pathway Information

A Pathway Association Study Tool for GWAS Analyses of Metabolic Pathway Information

Published on: July 1, 2020

Area of Science:

Bioinformatics
Computational Biology
Genomics

Background:

Multiple genome sequence alignment is crucial for understanding evolutionary relationships and functional similarities.
Existing algorithms face challenges with speed, accuracy, and handling complex alignments like overlapping matches.

Purpose of the Study:

To develop a simple, efficient, and flexible algorithm for multiple genome sequence alignment.
To improve upon the speed and accuracy of current alignment tools.

Main Methods:

Transforming Maximal Unique Matches (MUMs) into a multi-bipartite diagram.
Converting the diagram into a Directed Acyclic Graph (DAG).
Reducing alignment to finding the longest path in the DAG, solvable in linear time.

Main Results:

The algorithm correctly identifies genome sequence alignments.
Demonstrated faster performance compared to MGA and EMAGEN.
Successfully handles alignments with overlapping MUMs.
Offers both weighted and unweighted alignment options.

Conclusions:

The proposed graph-based algorithm provides an efficient and accurate solution for multiple genome sequence alignment.
The algorithm's flexibility makes it adaptable to diverse alignment requirements.
This method represents a significant advancement in computational genomics tools.