Abstract: This paper proposes a new algorithm for the evaluation of similarity between two sequences in quasilinear time. It describes the theoretical, practical and implementational aspects of the algorithm. The proposed method is a new approach dedicated to the computation of sequential similarity in contrast to other methods like the Jaccard Index which although designed for the computation of similarity of sets have been frequently used on sequences. The method is generalizable and applicable to any form of sequential data of a finite alphabet (binary files, DNA sequences, natural language etc.)
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
WSEAS Transactions on Information Science and Applications, ISSN / E-ISSN: 1790-0832 / 2224-3402, Volume 14, 2017, Art. #4
Ilhan Karić, Zanin Vejzović, "Quasilinear-Time Search and Comparison for Sequential Data," WSEAS Transactions on Information Science and Applications, vol. 14, pp. 26-30, 2017, DOI:
Ilhan Karić, Zanin Vejzović. Quasilinear-Time Search and Comparison for Sequential Data.
WSEAS Transactions on Information Science and Applications. 2017;14:26-30.