• Jul 03, 2017 News!Good News! Since 2017, IJMLC has been indexed by Scopus!
  • Aug 15, 2017 News![CFP] 2017 the annual meeting of IJMLC Editorial Board, ACMLC 2017, will be held in Singapore, December 8-10, 2017.   [Click]
  • Sep 09, 2017 News!Vol.7, No.4 has been published with online version.   [Click]
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2015 Vol. 5(1): 78-85 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2015.V5.487

A Multiple Genome Sequence Matching Based on Skipping Tree

Zihuan Xu, Kewei Cheng, Yi Ding, Ziqiang Tian, and Hui Zhao
Abstract—In this paper, a new algorithm, skipping suffix algorithm based on a new encoded mode for genome sequence aimed at accelerating multiple genome sequence matching are proposed. By introducing binary coding, the efficiency of gene sequence alignment gets improved obviously. Besides, we decide the maximal bits to skip by constructing skipping tree. A contrastive evaluation of the computational efficiency of KMP algorithm, suffix array and skipping suffix algorithm shows that preprocess of skipping suffix algorithm is more than 12 times speedup than that of suffix array. Moreover, multiple genome sequence matching based on suffix array is more than 50 times speedup than that of KMP. In a word, skipping suffix algorithm strike balance between preprocess and search successfully which better help it fit into large-scale genetic data matching.

Index Terms—Bioinformatics, skipping tree, bit manipulation, binary search.

The authors are with School of Software Engineering, Sichuan University, 610225 Chengdu, China (e-mail: xzhflying@163.com, viviancheng1993@gmail.com, dingyidy163@163.com, imtianziqiang@gmail.com).

[PDF]

Cite: Zihuan Xu, Kewei Cheng, Yi Ding, Ziqiang Tian, and Hui Zhao, "A Multiple Genome Sequence Matching Based on Skipping Tree," International Journal of Machine Learning and Computing vol. 5, no. 1, pp. 78-85, 2015.

Copyright © 2008-2015. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net