Satoshi Mizuta

Learn More
We calculate the relic abundance of Higgsino-dominant lightest su-perparticles, taking account of coannihilations with the superparticles which are almost degenerate with the lightest one. We show that their relic abundance is reduced drastically by the coannihilation processes and hence they are cosmologically of no interest. The lightest superparticle(More)
When the GUT relation on gaugino masses is relaxed, the mass and composition of the lightest neutralino are different from those in the GUT case. We discuss its phenomenological implications on the relic abundance of the neutralinos and on superparticle searches. In particular, we focus on the case where the neutral component of Winos dominates the lightest(More)
Genomes contain various types of repetitive sequences. They may be used as probes for seeking genome rearrangements because they are rather free from the natural selection if they are located in the intergenic regions. In this study, we searched for tandem repeats (TRs) in 44 prokaryotic genomes by the color-coding method and sought the signs of genome(More)
We explored the possibilities of whole-genome duplication (WGD) in prokaryotic species, where we performed statistical analyses of the configurations of the central angles between homologous tandem repeats (TRs) on the circular chromosomes. At first, we detected TRs on their chromosomes and identified equivalent tandem repeat pairs (ETRPs); here, an ETRP is(More)
This paper demonstrates that the probability of the occurrence of uphill moves in temperature parallel simulated annealing is so small that the effects of parallelization might be lost when the number of processing nodes is small. A modification in the probability of solution exchange between the processes is one tactic to recover the parallelization(More)
Graphical representation of DNA sequences is one of the most popular techniques for alignment-free sequence comparison. Here, we propose a new method for the feature extraction of DNA sequences represented by binary images, by estimating the similarity between DNA sequences using the frequency histograms of local bitmap patterns of images. Our method shows(More)
Accompanied with the rapid increase of the amount of data registered in the databases of biological sequences, the need for a fast method of sequence comparison applicable to sequences of large size is also increasing. In general, alignment is used for sequence comparison. However, the alignment may not be appropriate for comparison of sequences of large(More)
A method for designing and training neural networks using genetic algorithms is proposed, with the aim of getting the optimal structure of the network and the optimized parameter set simultaneously. For this purpose, a fitness function depending on both the output errors and sim-pleness in the structure of the network is introduced. The validity of this(More)