An algorithm for computing the error sequence of $$p^{n}$$ p n -periodic binary sequences.
Miao TangPublished in: Appl. Algebra Eng. Commun. Comput. (2014)
Keyphrases
- preprocessing
- learning algorithm
- k means
- sequence alignment
- long sequences
- input data
- computational complexity
- sequence matching
- error bounds
- computational cost
- worst case
- high accuracy
- linear complexity
- times faster
- detection algorithm
- optimization algorithm
- experimental evaluation
- dynamic programming
- np hard
- significant improvement
- equal length
- search algorithm
- theoretical analysis
- segmentation algorithm
- cost function
- non binary
- error function
- pseudorandom
- arbitrary length
- hamming distance
- matching algorithm
- lower bound
- optimal solution