• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.45 no.4
• /
• pp.227-231
• /
• 2000

Small seed size is one of the major traits of soybean cultivars for sprouts with regard to high sprout yield. This study was conducted to identify quantitative trait loci (QTL) for seed size and weight in a set of F 6 seeds of 89 lines derived from a cross between 'Pureunkong', a soybean cultivar developed for sprouts and 'Jinpumkong 2', a soybean cultivar with no beany taste in seed due to the lack of lipoxygenases. The genetic map of 25 linkage groups with a total of 98 markers including RFLP, RAPD, SSR and classical markers was constructed from this F/sbu 5/-derived population and was used for QTL analysis. 'Pureunkong' was significantly smaller (P＜0.01) than 'Jinpumkong 2' in seed size and seed weight. Genetic variation was detected and transgressive segregation was common in the population for these traits. Seven DNA markers including opT14-1600 in LG A2, opF02-400 in LG B2, Satt100, opC09-700, opG04-730 and opQll-650 in LG C2, and opY07-1100 ＆ 1000 in LG(unknown) were significantly associated and accounted for 4.7 to 10.9% and 5.1 to 10.1 % of the phenotypic variation in seed size and seed weight, respectively. 'Pureunkong' alleles increased seed size and seed weight at the all four significant marker loci on the LG C2. These marker loci in LG C2 were closely linked and were presumed to be a single QTL. Overall, at least three independent QTLs from 3 linkage groups (A2, B2, and C2) were putatively involved in the control of seed size and seed weight.

• Asian-Australasian Journal of Animal Sciences
• /
• v.15 no.10
• /
• pp.1386-1390
• /
• 2002

In aiming to identify the genes or genetic regions responsible for quantitative traits, a swine reference population had been constructed using three Large White boars and seven Meishan dams as parents. Five $F_1$ males and 23 $F_1$ females were intercrossed to generate 147 $F_2$ offspring. Thirty-one microsatellite markers covering Sus scrofa chromosomes (SSC) 2, 4, 6 and 7 were genotyped for all members. Construction of genetic microsatellite maps was performed using the CRIMAP software package. The lengths of these chromosomes were longer than MARC maps. They were 158.6cM, 180.3cM, 197.3cM and 171.4cM, respectively. A two modified orders of markers were observed for SSC6 and SSC7. The female map on SSC6 was shorter than male map, and the contrary was on SSC 2, 4 and 7.

• Molecules and Cells
• /
• v.26 no.3
• /
• pp.250-257
• /
• 2008

Microsatellites or simple sequence repeats (SSR) are widely distributed in eukaryotic genomes and are informative genetic markers. Despite many advantages of SSR markers such as a high degree of allelic polymorphisms, co-dominant inheritance, multi-allelism, and genome-wide coverage in various plant species, they also have shortcomings such as low polymorphic rates between genetically close lines, especially in Capsicum annuum. We developed an alternative technique to SSR by normalizing and alternating anchored primers in random amplified microsatellite polymorphisms (RAMP). This technique, designated reverse random amplified microsatellite polymorphism (rRAMP), allows the detection of nucleotide variation in the 3' region flanking an SSR using normalized anchored and random primer combinations. The reproducibility and frequency of polymorphic loci in rRAMP was vigorously enhanced by translocation of the 5' anchor of repeat sequences to the 3' end position and selective use of moderate arbitrary primers. In our study, the PCR banding pattern of rRAMP was highly dependent on the frequency of repeat motifs and primer combinations with random primers. Linkage analysis showed that rRAMP markers were well scattered on an intra-specific pepper map. Based on these results, we suggest that this technique is useful for studying genetic diversity, molecular fingerprinting, and rapidly constructing molecular maps for diverse plant species.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.1-9
• /
• 2009

In recent years, a film restoration has gained increasing attention by many researchers, to support multimedia service of high quality. In general, an old film is degraded by dust, scratch, flick, and so on. Among these, the common factors are scratch and blotch, so that many researchers have been investigated to restore these degradations. However, the methods in literature have one major limitation: A method is working well in dealing with scratches, however it is poorly working in processing the blotches. The goal of this work is to develop a robust technique to restore images degraded by both scratches and blotches. For this, we use MRF-MAP (Markov random field - maximum a posteriori) framework, so that the restoration problem is considered as the minimization problem of the posteriori energy function. As the minimization is one of complex combinatorial problem, we use distributed genetic algorithms (DGAs) that effectively deal with combinatorial problems. To asses the validity of the proposed method, it was tested on natural old films and artificially degraded films, and the results were compared with other methods. Then, the results show that the proposed method is superior to other methods.

• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.646-655
• /
• 2009

This paper presents a new search strategy based on models of evolution in order to solve the problem of collision-free robotic path planning. We designed the robot path planning method with genetic algorithm which has become a well-known technique for optimization, intelligent search. Considering the path points as genes in a chromosome will provide a number of possible solutions on a given map. In this case, path distances that each chromosome creates can be regarded as a fitness measure for the corresponding chromosome. The effectiveness of the proposed genetic algorithm in the path planning was demonstrated by simulation. The proposed search strategy is able to use multiple and static obstacles.

• Proceedings of the KIEE Conference
• /
• 2006.10a
• /
• pp.145-146
• /
• 2006

본 논문은 부분방전(PD: Partial Discharge)의 패턴인식 확률 극대화를 목적으로 신경망(NN: Neural Network) 파라미터 중에서 은닉층 뉴런의 수, 모멘텀(momentum)의 Step size와 Decay rate 를 최적화하기 위하여 유전 알고리즘(GA: Genetic Algonthm)을 적응하였다. 실험적 연구의 대상으로서, GIS(Gas Insulated Switchgear)사고의 주요 원인으로 보고되어있는 결함들을 인위적으로 모의한 16개 Test cell을 이용하여 부분방전을 발생시켰다. 부분방전 신호는 본 연구팀이 개발한 센서를 이용하여 검출되어 데이터베이스가 구축되어 그로부터 추출된 학습 데이터들의 학습에 다음과 같은 5가지 신경망 모델이 적응되었다: Multilayer Perception (MLP), Jordan-Elman Network (JEN), Recurrent Network (RN), Self-Organizing Feature Map (SOFM), Time-Lag Recurrent Network (TLRN). 유전 알고리즘 적용 효율성을 분석하기 위하여 동일한 데이터를 이용하여 다음과 같은 두 가지 방법을 적용한 결과를 상호 비교하였다. 우선 상기 선택된 모델만 적용하였고 다근 하나는 상기 모델과 Genetic Algorithm이 동시에 적용되었다. 모든 모델에 대하여 학습오차와 패턴 분류 확률을 비교한 결과, 유전 알고리즘 적응 시 부분방전 패턴인식 확률이 향상되었음이 확인되어 향후 신뢰성 있는 GIS 부분방전 진단기술에 활용될 수 있을 것으로 사료된다.

• Journal of Plant Biotechnology
• /
• v.39 no.1
• /
• pp.33-48
• /
• 2012

As a scientific curiosity to understand the structure and the function of crops and experimental efforts to apply it to plant breeding, genetic maps have been constructed in various crops. Especially, in the case of Brassica crop, genetic mapping has been accelerated since genetic information of model plant $Arabidopsis$ was available. As a result, the whole $B.$ $rapa$ genome (A genome) sequencing has recently been done. The genome sequences offer opportunities to develop molecular markers for genetic analysis in $Brassica$ crops. RFLP markers are widely used as the basis for genetic map construction, but detection system is inefficiency. The technical efficiency and analysis speed of the PCR-based markers become more preferable for many form of $Brassica$ genome study. The massive sequence informative markers such as SSR, SNP and InDels are also available to increase the density of markers for high-resolution genetic analysis. The high density maps are invaluable resources for QTLs analysis, marker assisted selection (MAS), map-based cloning and comparative analysis within $Brassica$ as well as related crop species. Additionally, the advents of new technology, next-generation technique, have served as a momentum for molecular breeding. Here we summarize genetic and genomic resources and suggest their applications for the molecular breeding in $Brassica$ crop.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.49 no.5
• /
• pp.423-428
• /
• 2004

Soybean seeds contain high amounts of isoflavones that display biological effects and isoflavone content of soybean seed can vary by year, environment, and genotype. Objective of this study was to identify quantitative trait loci that underlie isoflavone content in soybean seeds. The study involved 85 $F_2$ populations derived from Korean soybean cultivar 'Kwangkyo' and wild type soybean 'IT182305' for QTL analysis associated with isoflavone content. Isoflavone content of seeds was determined by HPLC. The genetic map of 33 linkage groups with 207 markers was constructed. The linkage map spanned 2,607.5 cM across all 33 linkage groups. The average linkage distance between pair of markers among all linkage groups was 12.6 cM in Kosambi map units. Isoflavone content in $F_2$ generations varied in a fashion that suggested a continuous, polygenic inheritance. Eleven markers (4 RAPD, 3 SSR, 4 AFLP) were significantly associated with isoflavone content. Only two markers, Satt419 and CTCGAG3 had F-tests that were significant at P<0.01 in $F_2$ generation for isoflavone content. Interval mapping using the $F_2$ data revealed only two putative QTLs for isoflavone content. The peak QTL region on linkage group 3, which was near OPAG03c, explained $14\%$ variation for isoflavone content. The peak QTL region on linkage group 5, which was located near OPN14 accounted for $35.3\%$ variation for isoflavone content. Using both Map-Maker-QTL $(LOD{\geq}2.0)$ and single-factor analysis $(P{\leq}0.05)$, one marker, CTCGAG3 in linkage group 3 was associated with QTLs for isoflavone content. This information would then be used in identification of QTLs for isoflavone content with precision

• Molecular & Cellular Toxicology
• /
• v.3 no.2
• /
• pp.98-106
• /
• 2007

Genotoxic stress triggers a variety of biological responses including the transcriptional activation of genes regulating DNA repair, cell survival and cell death. In this study, we investigated to examine gene expression profiles and genotoxic response in TK6 cells treated with DNA damaging agents MNNG (N-methyl-N'-nitrosoguanidine) and hydrogen peroxide $(H_2O_2)$. We extracted total RNA in three independent experiments and hybridized cRNA probes with oligo DNA chip (Applied Biosystems Human Genome Survey Microarray). We analyzed raw signal data with R program and AVADIS software and identified a number of deregulated genes with more than 1.5 log-scale fold change and statistical significancy. We indentified 14 genes including G protein alpha 12 showing deregulation by MNNG. The deregulated genes by MNNG represent the biological pathway regarding MAP kinase signaling pathway. Hydrogen peroxide altered 188 genes including sulfiredoxins. These results show that MNNG and $H_2O_2$ have both uniquely regulated genes that provide the potential to serve as biomarkers of exposure to DNA damaging agents.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.