This paper addresses the biometric template security issue. Follow out previous work on class distribution transform, the proposed scheme selects the distinguish points automatical...
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n = k≥0 ak2k and the number of non-zero digits is ...
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...