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

Search research articles

Related Experiment Videos

GAME: a simple and efficient whole genome alignment method using maximal exact match filtering.

Jeong-Hyeon Choi¹, Hwan-Gue Cho, Sun Kim

¹School of Informatics, Indiana University, Bloomington, IN 47408, USA. jeochoi@indiana.edu

Computational Biology and Chemistry

|June 28, 2005

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by

Same author

Validation of a 2-Gene Blood Test for Kawasaki Disease in Febrile Children.

JAMA network open·2026

Same author

Deep learning for predicting patient drug response by transferring gene-level and cell-level knowledge to tumors.

NPJ precision oncology·2026

Same author

Effects of Maternal Tetramethyl Bisphenol F Exposure on Neurodevelopment and Behavior in Mouse Offspring.

International journal of molecular sciences·2026

Same author

Enacted practices and developmental experiences of senior medical student tutors in a structured peer tutoring program.

Korean journal of medical education·2026

Same author

EnsDTI: Predicting Drug-Target Interaction With Mixture-of-Experts and Confidence Assessment.

IEEE transactions on computational biology and bioinformatics·2026

Same author

Transcriptome Transformer: improving patient survival prediction via multitask learning of transcriptomic and clinical features.

Briefings in bioinformatics·2025

Same journal

Mining negative sequential patterns to improve viral genomic feature representation and classification.

Computational biology and chemistry·2026

Same journal

Integrative in silico analysis identifies functionally and regulatively relevant nsSNPs in the TRIB3 gene.

Computational biology and chemistry·2026

Same journal

MARS: Multi-anchor reasoning for reliable toxicity prediction under distribution shift.

Computational biology and chemistry·2026

Same journal

Zadeh-based fuzzy analysis of carreau tri-hybrid nanofluid hemodynamics in a straight artery with irregular triangular stenosis.

Computational biology and chemistry·2026

Same journal

Exploring C<sub>6</sub>N<sub>6</sub> as an effective drug delivery carrier for anticancer drugs mercaptopurine and thiotepa: A DFT and MD approach.

Computational biology and chemistry·2026

Same journal

Role of Artificial Intelligence in bioinformatics: Revolutionizing molecular docking and DNA tokenization.

Computational biology and chemistry·2026

See all related articles

This study introduces GAME, a whole genome alignment method using maximal exact matches (MEMs). It efficiently filters anchors to accurately align large genomes with minimal memory and processing power.

Area of Science:

Genomics
Bioinformatics
Computational Biology

Background:

Whole genome alignment is crucial for comparative genomics.
Maximal Exact Matches (MEMs) are useful anchors but can increase false positives with shorter lengths.
Existing algorithms often require significant computational resources.

Purpose of the Study:

To develop a simple, efficient, and accurate whole genome alignment method.
To address the challenge of increased false positives in MEM-based alignment.
To create an algorithm that requires less memory and fewer parallel processors.

Main Methods:

Utilized Maximal Exact Match (MEM) anchors for genome alignment.
Developed a novel anchor filtering scheme based on match extension criteria (percent identity and length).

Related Experiment Videos

Incorporated a translation technique to enhance alignment quality and speed.

Main Results:

The GAME algorithm demonstrates competitive performance against established methods like BLAST, BLASTZ, PatternHunter, and MUMmer.
Successfully aligned large whole genomes, such as Arabidopsis thaliana, efficiently.
Showcased scalability through experiments aligning microbial genomes and A. thaliana chromosomes.

Conclusions:

GAME provides a computationally efficient and accurate solution for whole genome alignment.
The filtering scheme effectively manages MEM anchor challenges, reducing false positives.
The algorithm is suitable for aligning large genomes without extensive computational resources.