• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1272-1274
• /
• 2003

In this paper, we present a new algorithm for high dimensional data reduction based on wavelet decomposition and Genetic Algorithm (GA). Comparative results show the superiority of our algorithm for dimensionality reduction and accuracy improvement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.174-177
• /
• 2016

Wireless network-on-chip (WNoC) can alleviate critical path problem of existing typical NoCs by integrating radio-frequency module on router. In this paper, core-connection-aware genetic algorithm-based core and WIR mapping methodology at small world WNoC is presented. The methodology could optimize the critical path between cores with heavy communication. The 33% of average latency improvement is achieved compared to random mapping methodology.

• Asian-Australasian Journal of Animal Sciences
• /
• v.16 no.4
• /
• pp.473-480
• /
• 2003

In order to control the genetic background noise in QTL mapping, cofactor markers were incorporated in single marker analysis (SMACO) and interval mapping (CIM). A simulation was performed to see how effective the cofactors were by the number of QTL, the number and the type of markers, and the marker spacing. The results of QTL mapping for the simulated data showed that the use of cofactors was slightly effective when detecting a single QTL. On the other hand, a considerable improvement was observed when dealing with more than one QTL. Genetic background noise was efficiently absorbed with linked markers rather than unlinked markers. Furthermore, the efficiency was different in QTL mapping depending on the type of linked markers. Well-chosen markers in both SMACO and CIM made the range of linkage position for a significant QTL narrow and the estimates of QTL effects accurate. Generally, 3 to 5 cofactors offered accurate results. Over-fitting was a problem with many regressor variables when the heritability was small. Various marker spacing from 4 to 20 cM did not change greatly the detection of multiple QTLs, but they were less efficient when the marker spacing exceeded 30 cM. Likelihood ratio increased with a large heritability, and the threshold heritability for QTL detection was between 0.30 and 0.05.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.65 no.1
• /
• pp.1-21
• /
• 2020

Association mapping is widely used in rice and other crops to identify genes underlying important agronomic traits. Most association mapping studies use diversity panels comprising accessions with various geographical origins to exploit their wide genetic variation. While locally adapted breeding lines are rarely used in association mapping owing to limited genetic diversity, genes/alleles identified from elite germplasm are practically valuable as they can be directly utilized in breeding programs. In this study, we analyzed genetic diversity of 179 rice varieties (161 japonica and 18 Tongil-type) released in Korea from 1970 to 2006 using 192 microsatellite markers evenly distributed across the genome. The 161 japonica rice varieties were genetically very close to each other with limited diversity as they were developed mainly through elite-by-elite crosses to meet the specific local demands for high quality japonica rice in Korea. Despite the narrow genetic background, abundant phenotypic variation was observed in heading time, culm length, and amylose and protein content in the 161 japonica rice varieties. Using these varieties in association mapping, we identified six, seven, ten, and four loci significantly associated with heading time, culm length, and amylose and protein content, respectively. The sums of allelic effects of these loci showed highly significant positive correlation with the observed phenotypic values for each trait, indicating that the allelic variation at these loci can be useful when designing cross combinations and predicting progeny performance in local breeding programs.

• The Plant Pathology Journal
• /
• v.18 no.5
• /
• pp.266-270
• /
• 2002

Inbred lines of Chinese cabbage KU-101 (resistant line against Plasmodiophora brassicae race race 6) and CS-113 (susceptible line) were crossed and their progeny lines F$_1$, BC$_1$F$_1$, F$_2$, and F$_3$ were produced for the construction of the genetic linkage map of R brassicae race 6-resistant Brassica campestris ssp. pekinensis genome. Restriction fragment length polymorphism (RFLP) was applied to compare between parents and their f$_2$ progenies with a total of 192 probes and 5 restriction enzymes. The constructed RFLP map covered 1,104 cM with a mean distance between genetic marker of 8.0 cM, and produced 10 linkage groups having 121 genetic loci. The loci of P. brassicae race 6 (CR6)-resistant Brassica genome were determined by interval mapping of quan-titative trait loci (QTL), which resulted from bioassay using the same race of the fungi in P3 population. Resistant loci were estimated in numbers 1 (Gl) and 3 (G3) linkage groups. In the regression test, Gl had a value of4.8 logarithm of odd (LOD) score, while C3 had values of 4.2-7.2. Given these results, the location of the CR6-resistant loci within the Brassica genome map can now be addressed.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.20 no.2
• /
• pp.37-43
• /
• 2010

The wild silkworm, Antheraea mylitta Drury (Lepidoptera: Saturniidae) is a polyphagous silk producing insect that feeds on Terminalia arjuna, T. tomentosa and Shorea robusta and is distributed in the forest belts in different states of India. Phenotypically distinct populations of the A. mylitta are called "eco-race" or "ecotypes". Genetic improvement of this wild silkworm has not progressed much due to lack of adequate information on the factors that control the expression of most of the economically important traits. Considering the amazing technological advances taking place in molecular biology, it is envisaged that it is now possible to take greater control on these intractable traits if a combination of genetic, molecular and bioinformatics tools are used. Linkage disequilibrium (LD) mapping is one such approach that has extensively been used in both animal and plant system to identify quantitative trait loci (QTLs) for a number of economically important traits. LD mapping has a number of advantages over conventional biparental linkage mapping. Therefore, LD mapping is considered more efficient for gene discovery to meet the challenge of connecting sequence diversity with heritable phenotypic differences. However, care must be taken to avoid detection of spurious associations which may occur due to population structure and variety interrelationships. In this review, we discuss how LD mapping is suitable for the dissection of complex traits in wild silkworms (Antheraea mylitta).

• Asian-Australasian Journal of Animal Sciences
• /
• v.15 no.12
• /
• pp.1822-1830
• /
• 2002

The microsatellites are the short tandem repeats of 1 to 6 bp long monomer sequences that are repeated several times. These short tandem repeats are considered to be generated by the slipped strand mispairing. Based on the unique capability of alternating purine-pyrimidine residues to form Z-DNA, the possible role of the microsatellites in gene regulation has been proposed. The microsatellites are highly polymorphic, follow Mendelian inheritance and are evenly distributed throughout the genomes of eukaryotes. They are easy to isolate and the polymerase chain reaction based typing of the alleles can be readily automated. These properties make them the preferred markers for comparison of the genetic structure of the closely related breeds/populations; very high-resolution genetic mapping and parentage testing etc. The microsatellites have rapidly replaced the restriction fragment length polymorphism (RFLP) and the random amplified polymorphic DNA (RAPD) in most applications in the population genetics studies in most species, including the various farm animals viz. cattle, buffalo, goat, sheep and pigs etc. More and more reports are now available describing the use of microsatellites in pigs ranging from measurement of genetic variation between breeds/populations, developing high resolution genetic maps to identifying and mapping genes of biological and economic importance.

• Asian-Australasian Journal of Animal Sciences
• /
• v.12 no.7
• /
• pp.1129-1134
• /
• 1999

The rapid development of the sheep genetic linkage map over the last five years has given us the ability to follow the inheritance of chromosomal regions. Initially this powerful resource was used to find markers linked to monogenic traits but there is now increasing interest in using the genetic linkage map to define the complex of genes that control multigenic production traits. Of particular interest are those production traits that are difficult to measure and select for using classical quantitative genetic approaches. These include resistance to disease where a disease challenge (necessary for selection) poses too much risk to valuable stud animals and meat and carcass qualities which can be measured only after the animal has been slaughtered. The goal for the new millennium will be to fully characterise the genetic basis of multigenic production traits. The genetic linkage map is a vital tool required to achieve this.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.486-494
• /
• 2006

In this paper, we introduce a new solution for the load balancing problem, an important issue in parallel processing. Our heuristic load balancing technique called MGA effectively combines the benefit of both mean-field annealing (MFA) and genetic algorithms (GA). We compare the proposed MGA algorithm with other mapping algorithms (MFA, GA-l, and GA-2). A multiprocessor mapping algorithm simulation has been developed to measure performance improvement ratio of these algorithms. Our experimental results show that our new technique, the composition of heuristic mapping methods improves performance over the conventional ones, in terms of solution quality with a longer run time.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2311-2319
• /
• 1999

We present two heuristic algorithms for the task allocation problem (NP-complete problem) in parallel computing. The problem is to find an optimal mapping of multiple communicating tasks of a parallel program onto the multiple processing nodes of a distributed-memory multicomputer. The purpose of mapping these tasks into the nodes of the target architecture is the minimization of parallel execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristics are based on genetic algorithms and simulated annealing. We formulate an objective function as a total computational cost for a mapping configuration, and evaluate the performance of our heuristic algorithms. We compare the quality of solutions and times derived by the random, greedy, genetic, and annealing algorithms. Our experimental findings from a simulation study of the allocation algorithms are presented.