This paper presents a recursive algorithm of combinational optimization to blindly recover transmitted sequences of any length. The recursive algorithm is obtained by using a moving window with a ...

Sequence-Reconstruction-Algorithm Overview This project implements a solution for reconstructing sequences based on a given set of rules and operations. The program reads input data, processes it ...

In this article a new algorithm for the design of stationary input sequences for system identification is presented. The stationary input signal is generated by optimizing an approximation of a scalar ...

Memory efficient version of the algorithm (using Divide and Conquer) is expected to generate the sequence alignment with lesser memory utilization when compared to Dynamic programming version. However ...

This paper proposes an efficient parallel algorithm for an important class of dynamic programming problems that includes Viterbi, Needleman–Wunsch, Smith–Waterman, and Longest Common Subsequence. In ...