• BMB Reports
• /
• v.41 no.1
• /
• pp.29-34
• /
• 2008

The aim of this study was to determine whether single nucleotide polymorphisms (SNP) in the beef cattle adipocyte fatty-acid binding protein 3 and 4 (FABP3 and FABP4) genes are associated with carcass weight (CW) and back fat thickness (BF) of beef cattle. By direct DNA sequencing in 24 unrelated Korean native cattle, we identified 20 SNPs in FABP3 and FABP4. Among them, 10 polymorphic sites were selected for genotyping in our beef cattle. We performed SNP, haplotype and linkage disequilibrium studies on 419 Korean native cattle with the 10 SNPs in the FABP genes. Statistical analysis revealed that 220A>G (I74V) and 348+303T>C polymorphisms in FABP4 showed putative associations with BF traits (P=0.02 and 0.01, respectively). Our findings suggest that the polymorphisms in FABP4 may play a role in determining one of the important genetic factors that influence BF in beef cattle.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.207-210
• /
• 2009

According to the recent demand for materials for use in various displays and solid state lightings, new phosphors with improved performance have been pursued consistently. Multi objective genetic algorithm assisted combinatorial material search (MOGACMS) strategies have been applied to various multi-compositional inorganic systems to search for new phosphors and to optimize the properties of phosphors.

• Journal of Korean Association for Spatial Structures
• /
• v.2 no.3 s.5
• /
• pp.93-102
• /
• 2002

The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithms. The algorithm can perform both shape and topology optimum designs of trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithms. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithms were verified by applying the algorithm to optimum design examples

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.05a
• /
• pp.43-52
• /
• 2004

The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithms. The algorithm can perform both shape and topology optimum designs of trusses. The developed algerian was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithms. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithms were verified by applying the algorithm to optimum design examples

• Architectural research
• /
• v.4 no.1
• /
• pp.33-38
• /
• 2002

The objective of this study is the development of discrete optimum design algorithms which is based on the genetic algorithms. The developed algorithms was implemented in a computer program. For the optimum design, the objective function is the weight of space trusses structures and the constraints are stresses and displacements. This study solves the problem by introducing the genetic algorithms. The genetic algorithms consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed discrete optimum design algorithms was verified by applying the algorithms to optimum design examples.

• Horticultural Science & Technology
• /
• v.31 no.3
• /
• pp.322-327
• /
• 2013

The genetic diversity and phylogenetic relationships of eleven herbaceous peonies grown in Korea were analyzed by random amplified polymorphic DNA (RAPD). Twenty-four decamer RAPD primers were used in a comparative analysis of these Korean peony species. Of the 142 total RAPD fragments amplified, 124 (87.3%) were found to be polymorphic. The remaining 18 fragments were found to be monomorphic (12.7%) shared by individuals of all 11 peony species. Cluster analysis based on the presence or absence of bands was performed by Jaccard's similarity coefficient, based on Unweighted Pair Group Method with Arithmetic Averages. Genetic similarity range was 0.39 to 0.90 with a mean of 0.64. This study offered a rapid and reliable method for the estimation of variability among different peony species which could be utilized by the breeders for further improvement of the local peony species. Also, the results propose that the RAPD marker technique is a useful tool for evaluation of genetic diversity and relationship amongst different peony species.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.166-169
• /
• 1997

For parallel processing, the compiler partitions a loaded program into a set of tasks and makes a schedule for the tasks that will minimize parallel processing time for the loaded program. Building an optimal schedule for a given set of partitioned tasks of a program has known to be NP-complete. In this paper we introduce a GA(Genetic Algorithm)-based scheduling method in which a chromosome consists of two parts of a string which decide the number and order of tasks on each processor. An additional computation is used for feasibility constraint in the chromosome. By granularity theory, a partitioned program is categorized into coarse-grain or fine-grain types. There exist good heuristic algorithms for coarse-grain type partitioning. We suggested another GA adaptive to the coarse-grain type partitioning. The infeasibility of chromosome is overcome by the encoding and operators. The number of processors are decided while the GA find the minimum parallel processing time.

• Animal Systematics, Evolution and Diversity
• /
• v.26 no.1
• /
• pp.15-19
• /
• 2010

The Russian ratsnake, Elaphe schrenckii, is found in Russia, China, and Korea, and is considered to be an endangered species by the Ministry of Environment in South Korea. Due to habitat loss and use in oriental medicine, their population has been severely decimated. In South Korea, two subspecies of E. schrenckii has been defined according to body color: E. s. schrenckii (blackish) and E. s. anomala (yellow-brownish). Molecular genetic studies on Elaphe schrenckii are very scarce and the taxonomy of Elaphe schrenckii subspecies is uncertain. From the present study, we attempted to identify the genetic differences of these two subspecies using species-specific microsatellites developed from the genomic library of E. schrenckii. Nine polymorphic loci were tested on 19 individuals from E. s. schrenckii (n=10) and E. s. anomala (n=9) in South Korea. The mean number of alleles was 3.78 in E. s. schrenckii and 4.11 in E. s. anomala. The average expected heterozygosity was 0.542 and 0.511 in E. s. schrenckii and E. s. anomala, respectively. We found a lack of genetic structure between two subspecies ($F_{ST}=0.016$) and no genetic discrimination between two subspecies was found. Based on the present findings by microsatellites, two subspecies can be considered as one species, E. schrenckii. However, further investigations on taxonomical status using mitochondrial and nuclear DNA sequences need to be performed and morphological & ecological data should be revised. The genetic markers should benefit future studies of the endangered species of other Elaphe species for the study of genetic diversity and potential conservation management.

• Korean Journal of Ornithology
• /
• v.25 no.2
• /
• pp.77-81
• /
• 2018

The Korean Crested ibis Nipponia Nippon is an endangered species. A pair of Crested ibis was introduced from China in October 2008, and a successful program of artificial incubation of the species, and over 200 animals have been successfully bred through the restoration project up to 2017 at Upo ibis restoration center. We assessed genetic diversity and sex determination in the Korean Crested ibis. In total, 228 Crested ibis (115 females and 113 males) were identified. And genetic diversity measures, observed heterozygosity, expected heterozygosity, and polymorphic information content values were lower in 2017 than those in 2016. The inbreeding coefficient showed that the degree of ancestry increased in 2017. The decrease in polymorphism and increase in the degree of ancestry is thought to be due to inbreeding in such a small group. In this study provided important insight into protocols for genetic management of the breeding population of Korean Crested ibis in Korea and will help in extending the restoration program.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.05a
• /
• pp.65-69
• /
• 2001

In this paper, consider the three cases of decide for appling point a general Simple Genetic Algorithm about heuristic method(Bottom and Left Sliding) at the piece auto-nesting on the row plate. The 1st case, about only using the Simple Genetic Algorithm. The 2nd case, applied the heuristic method to the genetic operating of the Simple Genetic Algorithm. The 3rd case, applied the heuristic method to the final result of the Simple Genetic Algorirhm. The estimation of final result were proceed to developed simulation program in this research.