Learn More
We propose a hardware implementation of the Compact Genetic Algorithm (Compact GA). The design is realized using Verilog HDL, then fabricated on FPGA. Our design, though simple, runs about 1,000 times faster than the software executing on a workstation. An alternative hardware for linkage learning is also proposed in order to enhance the capability of(More)
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of solutions. In simple GA, crossover operator plays an important role in mixing BBs. However, the crossover probably disrupts the BBs because the cut point is chosen at random.(More)
In human cancers, the methylation of long interspersed nuclear element -1 (LINE-1 or L1) retrotransposons is reduced. This occurs within the context of genome wide hypomethylation, and although it is common, its role is poorly understood. L1s are widely distributed both inside and outside of genes, intragenic and intergenic, respectively. Interestingly, the(More)
Transcription start sites (TSSs) are crucial information that determines exact location of genes. However, identifying TSSs in vitro is costly and time consuming. Therefore, there are many attempts to predict TSSs in silico, but they were low in accuracy. Herein, we observed that the distribution of A/T-singletons in the whole genome can be employed to(More)
Our previous work focused on the synthesis of sequential circuits based on a partial input/output sequence. As the behavioural description of the target circuit is not known the correctness of the result can not be verified. This paper proposes a method which increases the correctness percentage of the finite-state machine (FSM) synthesis using multiple(More)
We propose a BB identification by simultaneity matrix (BISM) algorithm. The input is a set of-bit solutions denoted by S. The number of solutions is denoted by n = |S|. The output is a partition of bit positions {0,. .. , , − 1}. The BISM is composed of Simultaneity-Matrix-Construction and Fine-Valid-Partition algorithms. Algorithm SMC is outlined as(More)
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutions are composed of building blocks and the solution quality can be improved by composing building blocks. The studies of building blocks are limited to some artificial(More)