• Title/Summary/Keyword: 염색체 교차

Search Result 29, Processing Time 0.031 seconds

Genetic Analysis of Caulobuter crescentus by Using Transposon Tn5 and Reverse Field Electrophoresis (Transposon Tn5 및 Reverse Field Electrophoresis를 이용한 Caulobuter crescentus의 유전자 분석 연구)

  • 구본성;버트일리
    • Microbiology and Biotechnology Letters
    • /
    • v.17 no.3
    • /
    • pp.183-187
    • /
    • 1989
  • The bacteriophage Mu and transposon Tn5 containing plasmid pJB4JI-transferred transposon Tn5 to Caulobuter crescentus. When several thousand of transposon Tn5 insertion mutants were examined, we found auxotrophic and motility mutants at frequencies of 2% and 3%, respectively. Transposition of transposon Tn5 was analyzed by the reverse field electrophoresis and Southern hybridization. The results indicated that transposon Tn5 was randomly inserted to Caulobuter crescentus chromosome but the plasmid vector, pJB4JI, was not maintained.

  • PDF

A Simple Stereo Matching Algorithm using PBIL and its Alternative (PBIL을 이용한 소형 스테레오 정합 및 대안 알고리즘)

  • Han Kyu-Phil
    • The KIPS Transactions:PartB
    • /
    • v.12B no.4 s.100
    • /
    • pp.429-436
    • /
    • 2005
  • A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

Application and Comparison of Genetic Algorithm and Harmony Search Algorithm for Optimal Cost Design of Water Distribution System (상수도 관망 최적설계에 대한 유전 알고리즘과 하모니써치 알고리즘의 적용 및 비교)

  • Hong, Ari;Lee, Ho Min;Choi, Young Hwan;Choi, Ji Ho;Kim, Joong Hoon
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2016.05a
    • /
    • pp.521-521
    • /
    • 2016
  • 상수도 관망은 수원에서 수요절점까지 물을 안정적으로 공급하는 것을 목표로 한다. 상수도 관망의 최적설계는 수리학적 제한조건 (절점의 수압, 관로의 유속)을 만족하는 범위에서 비용을 최소화하는 설계안을 얻는 것으로 Savic and Walters (1997)는 유전 알고리즘 (Genetic Algorithms, Holland 1975)을 적용한 상수도 관망 설계 프로그램인 GANET를 제안하였고, Maier et al. (1996)은 개미군집알고리즘 (Ant Colony Optimization Algorithm, Dorigo et al. 1996)을 상수도 관망 최적설계에 적용한 후 그 결과가 유전 알고리즘에 비해 우수함을 증명하는 등 상수도 관망 최적설계에 관한 연구가 활발히 진행되어 오고 있다. 유전알고리즘은 선택, 교차, 돌연변이의 반복계산 과정을 통하여 최적해를 찾는 최적화 기법이다. 이 과정에서 결정변수는 유전자 (Gene)의 집합으로 표현되며, 염색체 (Chromosome) 내에서 근접한 유전 인자들은 일종의 Building Block을 형성하게 된다. Building Block은 좋은 해를 갖는 유전 인자를 높은 확률로 보관하여 지역해에 빠질 가능성을 줄이는 반면, 유전형 (Genotype)이 표현형 (Phenotype)을 충분히 모방하여 표현하지 못한 경우 오히려 최적해의 탐색을 방해할 수 있다는 한계점을 갖는다. 유전 알고리즘을 상수도 관망 최적설계에 적용하였을 때에도 이 한계점은 여실히 드러난다. 관로의 관경을 결정변수로 설정한 후 유전형으로 표현하였을 때, 관망도 상에서 근접하지 않은 두 관로가 염색체 내에서 연속으로 나열된다면 두 관로 간의 연관성이 실제보다 크게 고려되기 때문이다. 한편, 하모니써치 (Harmony Search, Geem et al. 2001) 알고리즘은 즉흥 연주 (Improvisation)를 통해 최상의 화음을 만들어내는 현상으로부터 착안하여 만들어진 최적화기법으로 연산 기법은 무작위선택, 기억회상, 피치조정 등으로 구성되어 있으며, 결정변수에 해당하는 연주자가 독립적으로 행동하며 해를 탐색한다는 점에서 유전알고리즘과 큰 차이를 갖는다. 본 연구에서는 유전알고리즘의 Building Block에 의해 발생하는 오류를 개선하고자, 상수도 관망 최적설계 연구에 많이 사용되는 Hanoi 관망 (Fujiwara and Khang 1990) 관로의 정렬 순서를 여러 가지 기준으로 설정하여 관망데이터를 구축한 후 하모니써치와 유전 알고리즘을 적용하여 최적화를 수행하였고 그 결과를 비교하였다. 그 결과 유전 알고리즘과 달리 하모니써치 알고리즘의 경우, 관로의 나열 순서와 상관없이 우수한 최적해 탐색 결과를 보이는 것을 확인할 수 있었다.

  • PDF

Transcription level of the ars-1 promoter of Neurospora crassa (Neurospora crassa ars-1 프로모터의 발현율 조사)

  • 이병욱;구상호
    • Journal of Life Science
    • /
    • v.13 no.2
    • /
    • pp.191-196
    • /
    • 2003
  • The ars gene of the Neurospora crassa encodes arylsulfatase and is expressed under sulfur limitation. An ars-1 promoter(Pars) translationally-fused to a lacZ gene was transformed into the N. crassa RLM 35-35, a his-3 inl strain and integrated into the his-S locus by a single crossover homologous recombination. $\beta$-galactosidase specific activity was measured from mycelia grown in sulfur-limited Vogel's medium. Enzyme activity reached its maximum at 14 hour after the shift to derepressing condition. When activity from homokaryon generated by microconidiation was measured, it was 17% a higher than that from heterokaryon.

Emotion-based Video Scene Retrieval using Interactive Genetic Algorithm (대화형 유전자 알고리즘을 이용한 감성기반 비디오 장면 검색)

  • Yoo Hun-Woo;Cho Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.514-528
    • /
    • 2004
  • An emotion-based video scene retrieval algorithm is proposed in this paper. First, abrupt/gradual shot boundaries are detected in the video clip representing a specific story Then, five video features such as 'average color histogram' 'average brightness', 'average edge histogram', 'average shot duration', and 'gradual change rate' are extracted from each of the videos and mapping between these features and the emotional space that user has in mind is achieved by an interactive genetic algorithm. Once the proposed algorithm has selected videos that contain the corresponding emotion from initial population of videos, feature vectors from the selected videos are regarded as chromosomes and a genetic crossover is applied over them. Next, new chromosomes after crossover and feature vectors in the database videos are compared based on the similarity function to obtain the most similar videos as solutions of the next generation. By iterating above procedures, new population of videos that user has in mind are retrieved. In order to show the validity of the proposed method, six example categories such as 'action', 'excitement', 'suspense', 'quietness', 'relaxation', 'happiness' are used as emotions for experiments. Over 300 commercial videos, retrieval results show 70% effectiveness in average.

Review of osteochondroma: involved in temporomandibular joint (측두하악관절에 발생한 골연골종에 대한 고찰)

  • Lee, Gi-Ho;Song, Young-Gyun
    • Journal of Dental Rehabilitation and Applied Science
    • /
    • v.30 no.1
    • /
    • pp.28-35
    • /
    • 2014
  • Osteochondroma is the most common benign bone tumor. The majority of osteochondromas (85%) present as solitary, nonhereditary lesions. In general, osteochondroma has no symptoms,however, facial asymmetry, malocclusion, crossbite and mouth opening can be occurred in case of temporomandibular joint involved. Radiologic analyses are indispensable element to diagnose osteochondroma and pathogenetic analysis showed that hereditary multiple osteochondromas are caused by mutations in either of two genes: exostosis(multiple)-1 (EXT1), which is located on chromosome 8q24.11 - q24.13 or exostosis(multiple)-2 (EXT2), which is located on chromosome 11p11 - 12. Recently, reduced mRNA of EXT1 was described in nonhereditary osteochondromas. The treatment of choice for osteochondroma is surgical unless the skeleton is still immature. Surgery associated with orthodontic treatment can be a valid approach to minimize facial asymmetry and malocclusion in case of temporomandibular with osteochondroma.

Genetic Algorithm for Node P겨ning of Neural Networks (신경망의 노드 가지치기를 위한 유전 알고리즘)

  • Heo, Gi-Su;Oh, Il-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.2
    • /
    • pp.65-74
    • /
    • 2009
  • In optimizing the neural network structure, there are two methods of the pruning scheme and the constructive scheme. In this paper we use the pruning scheme to optimize neural network structure, and the genetic algorithm to find out its optimum node pruning. In the conventional researches, the input and hidden layers were optimized separately. On the contrary we attempted to optimize the two layers simultaneously by encoding two layers in a chromosome. The offspring networks inherit the weights from the parent. For teaming, we used the existing error back-propagation algorithm. In our experiment with various databases from UCI Machine Learning Repository, we could get the optimal performance when the network size was reduced by about $8{\sim}25%$. As a result of t-test the proposed method was shown better performance, compared with other pruning and construction methods through the cross-validation.

Selection and Characterization of Horticultural Traits of Tomato leaf curl virus (TYLCV)-resistant Tomato Cultivars (토마토 황화잎말림바이러스(TYLCV) 저항성 품종 선발 및 원예특성 분석)

  • Kim, Woo-Il;Kim, Kwang-Hwan;Kim, Young-Bong;Lee, Heung-Su;Shon, Gil-Man;Park, Young-Hoon
    • Horticultural Science & Technology
    • /
    • v.31 no.3
    • /
    • pp.328-336
    • /
    • 2013
  • This study was conducted to evaluate imported tomato $F_1$ cultivars as breeding materials for the resistance to Tomato yellow leaf curl virus (TYLCV) by molecular markers and bioassay. From marker genotyping and disease evaluation of 40 $F_1$ cultivars, most of the cultivars declared as TYLCV-resistance carried heterozygous marker genotype for the TYLCV resistance genes Ty-1, Ty-3, or Ty-3a, and showed low disease rates. Whereas, 4 of 5 $F_1$ cultivars declared as intermediate resistance showed marker genotype for susceptibility and disease rates ranged 18.1-33.3%. However, the xx cultivars showed inconsistency in marker genotype and disease rate. Characterization of horticultural traits of the $F_1$ cultivars with TYLCV-resistance indicated that large-size fruit cultivars were higher in yield and similar in sugar contents and solid-acid ratio compared to a control cultivar preferred in the domestic market, although hardness remained to be a problem. On the other hand, cherry tomato cultivars showed lower yield and brix, but longer internode compared to a control cultivar, indicating that breeding for TYLCV-resistance using these cultivars will require more efforts and time compared to large-sized.

Land Use Optimization using Genetic Algorithms - Focused on Yangpyeong-eup - (유전 알고리즘을 적용한 토지이용 최적화 배분 연구 - 양평군 양평읍 일대를 대상으로 -)

  • Park, Yoonsun;Lee, Dongkun;Yoon, Eunjoo;Mo, Yongwon;Leem, Jihun
    • Journal of Environmental Impact Assessment
    • /
    • v.26 no.1
    • /
    • pp.44-56
    • /
    • 2017
  • Sustainable development is important because the ultimate objective is efficient development combining the economic, social, and environmental aspects of urban conservation. Despite Korea's rapid urbanization and economic development, the distribution of resources is inefficient, and land-use is not an exception. Land use distribution is difficult, as it requires considering a variety of purposes, whose solutions lie in a multipurpose optimization process. In this study, Yangpyeong-eup, Yangpyeong, Gyeonggi-do, is selected, as the site has ecological balance, is well-preserved, and has the potential to support population increases. Further, we have used the genetic algorithm method, as it helps to evolve solutions for complex spatial problems such as planning and distribution of land use. This study applies change to the way of mutation. With four goals and restrictions of area, spatial objectives, minimizing land use conversion, ecological conservation, maximizing economic profit, restricting area to a specific land use, and setting a fixed area, we developed an optimal planning map. No urban areas at the site needed preservation and the high urban area growth rate coincided with the optimization of purpose and maximization of economic profit. When the minimum point of the fitness score is the convergence point, we found optimization occurred approximately at 1500 generations. The results of this study can support planning at Yangpyeong-eup.ausative relationship between the perception of improving odor regulation and odor acceptance.