Author:
Sarkar Bimal Kumar,Sharma Ashish Ranjan,Bhattacharya Manojit,Sharma Garima,Lee Sang-Soo,Chakraborty Chiranjib
Abstract
AbstractWe describe a novel algorithm for information recovery from DNA sequences by using a digital filter. This work proposes a three-part algorithm to decide the k-mer or q-gram word density. Employing a finite impulse response digital filter, one can calculate the sequence's k-mer or q-gram word density. Further principal component analysis is used on word density distribution to analyze the dissimilarity between sequences. A dissimilarity matrix is thus formed and shows the appearance of cluster formation. This cluster formation is constructed based on the alignment-free sequence method. Furthermore, the clusters are used to build phylogenetic relations. The cluster algorithm is in good agreement with alignment-based algorithms. The present algorithm is simple and requires less time for computation than other currently available algorithms. We tested the algorithm using beta hemoglobin coding sequences (HBB) of 10 different species and 18 primate mitochondria genome (mtDNA) sequences.
Publisher
Springer Science and Business Media LLC
Reference61 articles.
1. Kauffman, S. A. The origins of order: Self-organization and selection in evolution (Oxford University Press, 1993).
2. Eigen, M. & Winkler-Oswatitsch, R. Steps towards life: a perspective on evolution Vol. 387 (Oxford University Press, 1992).
3. Vinga, S. & Almeida, J. Alignment-free sequence comparison—a review. Bioinformatics 19, 513–523 (2003).
4. Reinert, G., Chew, D., Sun, F. & Waterman, M. S. Alignment-free sequence comparison (I): statistics and power. J. Comput. Biol. 16, 1615–1634 (2009).
5. Domazet-Lošo, M. & Haubold, B. Alignment-free detection of local similarity among viral and bacterial genomes. Bioinformatics 27, 1466–1472 (2011).
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献