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

Jeong Hyeon Choi, Hwan Gue Cho, Sun Kim

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

In this paper, we present a simple and efficient whole genome alignment method using maximal exact match (MEM). The major problem with the use of MEM anchor is that the number of hits in non-homologous regions increases exponentially when shorter MEM anchors are used to detect more homologous regions. To deal with this problem, we have developed a fast and accurate anchor filtering scheme based on simple match extension with minimum percent identity and extension length criteria. Due to its simplicity and accuracy, all MEM anchors in a pair of genomes can be exhaustively tested and filtered. In addition, by incorporating the translation technique, the alignment quality and speed of our genome alignment algorithm have been further improved. As a result, our genome alignment algorithm, GAME (Genome Alignment by Match Extension), performs competitively over existing algorithms and can align large whole genomes, e.g., A. thaliana, without the requirement of typical large memory and parallel processors. This is shown using an experiment which compares the performance of BLAST, BLASTZ, PatternHunter, MUMmer and our algorithm in aligning all 45 pairs of 10 microbial genomes. The scalability of our algorithm is shown in another experiment where all pairs of five chromosomes in A. thaliana were compared.

Original languageEnglish (US)
Pages (from-to)244-253
Number of pages10
JournalComputational Biology and Chemistry
Volume29
Issue number3
DOIs
StatePublished - Jun 1 2005

Fingerprint

genome
Genome
Alignment
Filtering
Genes
alignment
Anchors
Microbial Genome
Parallel Processors
chromosomes
Chromosomes
Hits
Percent
Chromosome
Experiment
central processing units
Scalability
Simplicity
Experiments
Data storage equipment

Keywords

  • Anchor filtering
  • Maximal exact match
  • Whole genome alignment

ASJC Scopus subject areas

  • Structural Biology
  • Biochemistry
  • Organic Chemistry
  • Computational Mathematics

Cite this

GAME : A simple and efficient whole genome alignment method using maximal exact match filtering. / Choi, Jeong Hyeon; Cho, Hwan Gue; Kim, Sun.

In: Computational Biology and Chemistry, Vol. 29, No. 3, 01.06.2005, p. 244-253.

Research output: Contribution to journalArticle

@article{30c854c4206d4ffdad4fe1c63d023242,
title = "GAME: A simple and efficient whole genome alignment method using maximal exact match filtering",
abstract = "In this paper, we present a simple and efficient whole genome alignment method using maximal exact match (MEM). The major problem with the use of MEM anchor is that the number of hits in non-homologous regions increases exponentially when shorter MEM anchors are used to detect more homologous regions. To deal with this problem, we have developed a fast and accurate anchor filtering scheme based on simple match extension with minimum percent identity and extension length criteria. Due to its simplicity and accuracy, all MEM anchors in a pair of genomes can be exhaustively tested and filtered. In addition, by incorporating the translation technique, the alignment quality and speed of our genome alignment algorithm have been further improved. As a result, our genome alignment algorithm, GAME (Genome Alignment by Match Extension), performs competitively over existing algorithms and can align large whole genomes, e.g., A. thaliana, without the requirement of typical large memory and parallel processors. This is shown using an experiment which compares the performance of BLAST, BLASTZ, PatternHunter, MUMmer and our algorithm in aligning all 45 pairs of 10 microbial genomes. The scalability of our algorithm is shown in another experiment where all pairs of five chromosomes in A. thaliana were compared.",
keywords = "Anchor filtering, Maximal exact match, Whole genome alignment",
author = "Choi, {Jeong Hyeon} and Cho, {Hwan Gue} and Sun Kim",
year = "2005",
month = "6",
day = "1",
doi = "10.1016/j.compbiolchem.2005.04.004",
language = "English (US)",
volume = "29",
pages = "244--253",
journal = "Computational Biology and Chemistry",
issn = "1476-9271",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - GAME

T2 - A simple and efficient whole genome alignment method using maximal exact match filtering

AU - Choi, Jeong Hyeon

AU - Cho, Hwan Gue

AU - Kim, Sun

PY - 2005/6/1

Y1 - 2005/6/1

N2 - In this paper, we present a simple and efficient whole genome alignment method using maximal exact match (MEM). The major problem with the use of MEM anchor is that the number of hits in non-homologous regions increases exponentially when shorter MEM anchors are used to detect more homologous regions. To deal with this problem, we have developed a fast and accurate anchor filtering scheme based on simple match extension with minimum percent identity and extension length criteria. Due to its simplicity and accuracy, all MEM anchors in a pair of genomes can be exhaustively tested and filtered. In addition, by incorporating the translation technique, the alignment quality and speed of our genome alignment algorithm have been further improved. As a result, our genome alignment algorithm, GAME (Genome Alignment by Match Extension), performs competitively over existing algorithms and can align large whole genomes, e.g., A. thaliana, without the requirement of typical large memory and parallel processors. This is shown using an experiment which compares the performance of BLAST, BLASTZ, PatternHunter, MUMmer and our algorithm in aligning all 45 pairs of 10 microbial genomes. The scalability of our algorithm is shown in another experiment where all pairs of five chromosomes in A. thaliana were compared.

AB - In this paper, we present a simple and efficient whole genome alignment method using maximal exact match (MEM). The major problem with the use of MEM anchor is that the number of hits in non-homologous regions increases exponentially when shorter MEM anchors are used to detect more homologous regions. To deal with this problem, we have developed a fast and accurate anchor filtering scheme based on simple match extension with minimum percent identity and extension length criteria. Due to its simplicity and accuracy, all MEM anchors in a pair of genomes can be exhaustively tested and filtered. In addition, by incorporating the translation technique, the alignment quality and speed of our genome alignment algorithm have been further improved. As a result, our genome alignment algorithm, GAME (Genome Alignment by Match Extension), performs competitively over existing algorithms and can align large whole genomes, e.g., A. thaliana, without the requirement of typical large memory and parallel processors. This is shown using an experiment which compares the performance of BLAST, BLASTZ, PatternHunter, MUMmer and our algorithm in aligning all 45 pairs of 10 microbial genomes. The scalability of our algorithm is shown in another experiment where all pairs of five chromosomes in A. thaliana were compared.

KW - Anchor filtering

KW - Maximal exact match

KW - Whole genome alignment

UR - http://www.scopus.com/inward/record.url?scp=20444460812&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=20444460812&partnerID=8YFLogxK

U2 - 10.1016/j.compbiolchem.2005.04.004

DO - 10.1016/j.compbiolchem.2005.04.004

M3 - Article

C2 - 15979044

AN - SCOPUS:20444460812

VL - 29

SP - 244

EP - 253

JO - Computational Biology and Chemistry

JF - Computational Biology and Chemistry

SN - 1476-9271

IS - 3

ER -