• Title/Summary/Keyword: unexpressed gene

Search Result 3, Processing Time 0.016 seconds

A Genetic Algorithm for a Large-Scaled Maximal Covering Problem (대규모 Maximal Covering 문제 해결을 위한 유전 알고리즘)

  • 박태진;황준하;류광렬
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.5
    • /
    • pp.570-576
    • /
    • 2004
  • It is very difficult to efficiently solve a large-scaled maximal covering problem(MCP) by a genetic algorithm. In this paper, we present new crossover and mutation operators specially designed for genetic algorithms to solve large-scaled MCPs efficiently. We also introduce a novel genetic algorithm employing unexpressed genes. Unexpressed genes are the genes which are not expressed and thus do not affect the evaluation of the individuals. These genes play the role of reserving information susceptible to be lost by the application of genetic operations but is suspected to be potentially useful in later generations. The genetic algorithm employing unexpressed genes enjoys the advantage of being able to maintain diversity of the population and thus can search more efficiently to solve large-scaled MCPs. Experiments with large-scaled real MCP data has shown that our genetic algorithm employing unexpressed genes significantly outperforms tabu search which is one of the popularly used local neighborhood search algorithms for optimization.

A Genetic Algorithm for the Maximal Covering Problem (유전 알고리즘을 이용한 Maximal Covering 문제의 해결)

  • 박태진;이용환;류광렬
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.502-509
    • /
    • 2002
  • Maximal Covering 문제(MCP)란 행렬 상에서 n개의 열(column) 중 p개를 선택하여 m개의 행(row)중 최대한 많은 행을 cover하는 문제로 정의된다. 본 논문에서는 MCP를 유전 알고리즘(Genetic Algorithm)으로 해결하기 위해 문제에 적합하게 설계된 교차 연산자(crossover operator)와 비발현 유전인잔(unexpressed gene)를 가진 새로운 염색체 구조를 제시한다. 해결하고자 하는 대상 MCP의 규모가 매우 큰 경우 전통적인 임의교차(random crossover) 방법으로는 좋은 결과를 얻기가 힘들다. 따라서 본 연구에서는 그리디 교차(greedy crossover) 방법을 제시하여 문제를 해결한다. 그러나 이러한 그리디 교차를 사용하더라도 조기 수렴 등의 문제로 인해 타부 탐색 등의 이웃해 탐색 방법에 비해 그리 좋은 결과를 얻기가 힘들다. 본 논문은 이러한 조기 수렴 문제를 해결하고 다른 이웃에 탐색 방법보다 더 좋은 결과를 얻기 위해 비발현 유전인자(unexpressed gene)를 가진 염색체를 도입하여 해결함을 특징으로 한다. 비발현 유전인자는 교차 과정에서 자식 염색체의 유전인자로 전달되지 않은 정보 중 나중에라도 유용할 가능성이 보이는 정보를 보존하는 역할을 하여 조기 수렴 문제를 해결하는데 도움을 주어 보다 나은 결과를 얻을 수 있게 해준다. 대규모 MCP를 해결하는 실험에서 새로운 비발현 유전인자를 적용한 유전 알고리즘이 기존의 유전 알고리즘뿐만 아니라 다른 탐색 기법에 비해 더욱 좋은 성능을 보여줌을 확인하였다.

  • PDF

Transcriptional Activity of Plasmodium Subtilisin-like Protease 2 (Pf-Sub2)5' Untranslated Regions and Its Interaction with Hepatocyte Growth Factor

  • Liao, Shunyao;Liu, Yunqiang;Jung, Suk-Yul;Cho, Pyo-Yun;Zheng, Bing;Park, Hyun
    • Parasites, Hosts and Diseases
    • /
    • v.48 no.4
    • /
    • pp.291-295
    • /
    • 2010
  • The onset, severity, and ultimate outcome of malaria infection are influenced by parasite-expressed virulence factors and individual host responses to these determinants, In both humans and mice, liver injury is involved after parasite entry, which persists until the erythrocyte stage after infection with the fatal strain Plasmodium falciparum (Pf), Hepatocyte growth factor (HGF) has strong anti-apoptotic effects in various kinds of cells, and also has diverse metabolic functions. In this work, Pf-subtilisin-like protease 2 (Pf-Sub2) 5' untranslated region (UTR) was analyzed and its transcriptional activity was estimated by luciferase expression. Fourteen TATA boxes were observed but only one Oct-1 and c-Myb were done. In addition, host HGF interaction with Pf-Sub2 was evaluated by co-transfection of HGF- and Pf-Sub2-cloned vector. Interestingly, -1,422/+12 UTR exhibited the strongest luciferase activity but -329 to + 12 UTR did not exhibit luciferase activity. Moreover, as compared with the control of unexpressed HGF, the HGF protein suppressed luciferase expression driven by the 5' untranslated region of the Pf-Sub2 promoter. Taken together, it is suggested that HGF controls and interacts with the promoter region of the Pf-Sub2 gene.