Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sequence Alignment Algorithm for Statistical Similarity Assessment

Published 7 Jun 2021 in eess.SP | (2106.04349v1)

Abstract: This paper presents a new approach to statistical similarity assessment based on sequence alignment. The algorithm performs mutual matching of two random sequences by successively searching for common elements and by applying sequence breaks to matchless elements in the function of exponential cost. As a result, sequences varying significantly generate a high-cost alignment, while for low-cost sequences the introduced interruptions allow inferring the nature of sequences dependence. The most important advantage of the algorithm is an easy interpretation of the obtained results based on two parameters: stretch ratio and stretch cost. The operation of the method has been simulation tested and verified with the use of real data obtained from hardware random number generators. The proposed solution ensures simple implementation enabling the integration of hardware solutions, and operation based on only two sequences of any length predisposes the method to online testing.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.