A novel alignment-free DNA sequence similarity analysis approach based on top-k n-gram match-up

Delibaş E., Arslan A., Şeker A., Diri B.

JOURNAL OF MOLECULAR GRAPHICS & MODELLING, vol.100, 2020 (SCI-Expanded) identifier identifier identifier

  • Publication Type: Article / Article
  • Volume: 100
  • Publication Date: 2020
  • Doi Number: 10.1016/j.jmgm.2020.107693
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Applied Science & Technology Source, BIOSIS, Biotechnology Research Abstracts, Chemical Abstracts Core, Chimica, Compendex, Computer & Applied Sciences, EMBASE, INSPEC, MEDLINE
  • Yıldız Technical University Affiliated: Yes


DNA sequence similarity analysis is an essential task in computational biology and bioinformatics. In nearly all research that explores evolutionary relationships, gene function analysis, protein structure prediction and sequence retrieving, it is necessary to perform similarity calculations. As an alternative to alignment-based sequence comparison methods, which result in high computational cost, alignment-free methods have emerged that calculate similarity by digitizing the sequence in a different space. In this paper, we proposed an alignment-free DNA sequence similarity analysis method based on top-k n-gram matches, with the prediction that common repeating DNA subsections indicate high similarity between DNA sequences. In our method, we determined DNA sequence similarities by measuring similarity among feature vectors created according to top-k n-gram match-up scores without the use of similarity functions. We applied the similarity calculation for three different DNA data sets of different lengths. The phylogenetic relationships revealed by our method show that our trees coincide almost completely with the results of the MEGA software, which is based on sequence alignment. Our findings show that a certain number of frequently recurring common sequence patterns have the power to characterize DNA sequences. (C) 2020 Elsevier Inc. All rights reserved.