Learn More
Given two genomic maps G 1 and G 2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G 1 and G 2 such that the resultant subsequences, denoted as G * 1 and G * 2 , can be partitioned into the same set of maximal strips, which are common substrings of length greater(More)
In addition to GA-deception, the lack of fitness differences among low-order schemata can also degrade GA's search. Therefore, a coding should present adequate superior low-order building blocks at the early stage of search. This paper aims to reveal the inherent periodicity in the search process of a genetic algorithm, and to show how to make use of this(More)
We present a novel mesh denoising and smoothing method in this paper. Our approach starts by estimating the principal curvatures and mesh saliency value for each ver-tex. Then, we calculate the uniform principal curvature of each vertex based on the weighted average of local principal curvatures. After that, we use the weighted bi-quadratic Bézier surface(More)
— A large number of analog chaos-based secure communication systems have been proposed since the early 1990s exploiting the technique of chaos synchronization. A brief survey of these chaos-based cryptosystems and of related cryptanalytic results is given. Some recently proposed countermeasures against known attacks are also introduced.
Given two genomic maps G 1 and G 2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G 1 and G 2 such that the resultant subsequences, denoted as G * 1 and G * 2 , can be partitioned into the same set of maximal substrings of length greater than or equal to two. Such(More)