• Aug 09, 2018 News![CFP] The annual meeting of IJFCC Editorial Board, ICCTD 2019, will be held in Prague, Czech Republic during March 2-4, 2019.   [Click]
  • Aug 09, 2018 News!IJFCC Vol. 6, No. 1-No. 3 has been indexed by EI (Inspec).   [Click]
  • Dec 24, 2018 News!The papers published in Vol.7, No.1-No.2 have all received dois from Crossref.
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Cherry L. Chan
    • Abstracting/ Indexing: Google Scholar,  Crossref, Electronic Journals LibraryEI (INSPEC, IET), etc.
    • E-mail:  ijfcc@ejournal.net 
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2015 Vol.4(3): 165-169 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2015.V4.377

Efficient Sequence Comparison Using Binary Codes

Hossein Kamel Rahimi
Abstract—In this paper, we propose an efficient way of finding the exact distance in sequence comparison by using Huffman coding method for alphabets with uniform symbol probabilities. The approach is proposed as a refinement for word pair comparison in D2 statistics, though it can readily be generalised. Two given sequences with identical lengths are encoded to Huffman binary codes by which we are able to calculate Hamming Distance using binary operations efficiently. This method is applied on D2 statistics to compare k-tuples faster than its original version. The evaluation on emprical sequences showed that the method is faster than original D2; especially, when re-using the encoded sequences which resulted in better performance.

Index Terms—Performance, experimentation, string and sequence processing, huffman encoding, hamming distance, D2 statistics, string comparison, binary codes, bitwise operation.

The author is with the Faculty of Science and Engineering, Queensland University of Technology, Australia (e-mail: H.Kamelrahimi@qut.edu.au, David.Poxon@qut.edu.au).


Cite: Hossein Kamel Rahimi, "Efficient Sequence Comparison Using Binary Codes," International Journal of Future Computer and Communication vol. 4, no. 3, pp. 165-169, 2015.

Copyright © 2008-2018. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net