• Plant Resources
• /
• v.8 no.1
• /
• pp.1-8
• /
• 2005

A type 3 metallothionein cDNA (PMT3a) from ozone-treated Populus alba${\times}$Populus glandulosa cDNA library has been isolated and characterized. A PMT3a cDNA is 459 nucleotides long and has an open reading frame of 201 bp with a deduced amino acid sequence of 66 residues (pI 4.94). The deduced amino acid sequence of PMT3a matched to the previously reported metallothionein genes. The deduced amino acid sequence of PMT3a showed the $86\%$ identity with P. balsamifera ${\times}$P. deltoides. Expression of PMT3a by the RT-PCR was increased 60 min than 30 min after drought treatment. The ozone treated poplar increased at 30 min in the early time and then decreased at 60 min.

• Korean Journal of Cognitive Science
• /
• v.14 no.2
• /
• pp.15-25
• /
• 2003

The Monkey and Banana Problem is an example commonly used for illustrating simple problem solving. It can be solved by conventional approaches, but this requires a procedural aspect when inferences are processed, and this fact works as a limitation condition in solving complex problems. However, if we use DNA computing methods which are naturally able to realize massive parallel processing. the Monkey and Banana Problem can be solved effectively without weakening the fundamental aims above. In this paper, we design a method of representing the problem using DNA molecules, and show that various solutions are generated through computer-simulations based on the design. The simulation results are obviously interesting in that these are contrary to the fact that the Prolog program for the Monkey and Banana Problem, which was implemented from the conventional point of view, gives us only one optimal solution. That is, DNA computing overcomes the limitations of conventional approaches.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.37-46
• /
• 2010

A Suffix Tree is an efficient data structure that exposes the internal structure of a string and allows efficient solutions to a wide range of complex string problems, in particular, in the area of computational biology. However, as the biological information explodes, it is impossible to construct the suffix trees in main memory. We should find an efficient technique to construct the trees in a secondary storage. In this paper, we present a method for constructing a suffix tree in a disk for large set of DNA strings using new index scheme. We also show a typical application example with a suffix tree in the disk.

• Korean Journal of Plant Resources
• /
• v.18 no.2
• /
• pp.240-245
• /
• 2005

A cDNA clone homologous to glutathione S-transferase gene was isolated and characterized from Codonopsis lanceolata(ClGST). The ClGST is 761 nucleotides long and has an open reading frame of 522 bp with a deduced amino acid sequence of 173 residues. The ClGST shows meaning homology to A. thaliana(AAC63629) $71\%$, C. chinense(CAI51314) $73\%$, E. esula(AAE65767) $75\%$, H. muticus(CAA55039) $70\%$, N. plumbaginifolia(CAA96431) $77\%$, S. commersonii(AAB65163).

• Journal of Plant Biotechnology
• /
• v.45 no.1
• /
• pp.9-16
• /
• 2018

The advent of available DNA barcoding technology has been extensively adopted to assist in the reference to differentiate the origin of various medicinal plants species. However, this technology is still far behind the curve of technological advances to be applied in a practical manner in the market to authenticate the counterfeit components or detect the contamination in the admixtures of medicinal plant species. Recently, a high resolution melting curve analysis technique was combined with the procedure of DNA barcoding (Bar-HRM) to accomplish this purpose. In this review, we tried to summarize the current development and bottleneck of processing related to the Bar-HRM technology for the practical application of medicinal plant species' differentiation in a viable global market. Although several successful results have been reported, there are still many obstacles to be resolved, such as limited number of DNA barcodes and single nucleotide polymorphisms, in particular, only one DNA barcode, internal transcribed sequence (ITS) of ribosomal DNA has been reported in the available nuclear genome. In addition, too few cases have been reported about the identification of counterfeit or contamination with processed medicinal plant products, in particular specifically the case of technology based infusion, jam and jelly products and components in which it is noted that DNA can be thereby degraded during the processing of these products and components.

• The KIPS Transactions:PartD
• /
• v.17D no.3
• /
• pp.175-184
• /
• 2010

Experiments and research on genes have become very convenient by using DNA chips, which provide large amounts of data from various experiments. The data provided by the DNA chips could be represented as a two dimensional matrix, in which one axis represents genes and the other represents samples. By performing an efficient and good quality clustering on such data, the classification work which follows could be more efficient and accurate. In this paper, we use a bio-inspired algorithm called the Particle Swarm Optimization algorithm to propose an efficient clustering mechanism for large amounts of DNA chip data, and show through experimental results that the clustering technique using the PSO algorithm provides a faster yet good quality result compared with other existing clustering solutions.

• Childhood Kidney Diseases
• /
• v.12 no.1
• /
• pp.11-22
• /
• 2008

Telomeres consist of tandem guanine-thymine(G-T) repeats in most eukaryotic chromosomes. Human telomeres are predominantly linear, double stranded DNA as they ended in 30-200 nucleotides(bases,b) 3'-overhangs. In DNA replication, removal of the terminal RNA primer from the lagging strand results in a 3'-overhang of uncopied DNA. This is because of bidirectional DNA replication and specificity of unidirectional DNA polymerase. After the replication, parental and daughter DNA strands have unequal lengths due to a combination of the end-replication problem and end-processing events. The gradual chromosome shortening is observed in most somatic cells and eventually leads to cellular senescence. Telomere shortening could be a molecular clock that signals the replicative senescence. The shortening of telomeric ends of human chromosomes, leading to sudden growth arrest, triggers DNA instability as biological switches. In addition, telomere dysfunction may cause chronic allograft nephropathy or kidney cancers. The renal cell carcinoma(RCC) in women may be less aggressive and have less genomic instability than in man. Younger patients with telomere dysfunction are at a higher risk for RCC than older patients. Thus, telomeres maintain the integrity of the genome and are involved in cellular aging and cancer. By studying the telomeric DNA, we may characterize the genetic determinants in diseases and discover the tools in molecular medicine.

• Animal cells and systems
• /
• v.1 no.3
• /
• pp.463-466
• /
• 1997

We have recently demonstrated, by protein and cDNA sequence analysis, that prorenin converting enzyme (PRECE) in the mouse submandibular gland is identical to the epidermal growth factor-binding protein (EGF-BP)type B. However, type A and C did not show prorenin converting activity. To demonstrate whether r-NGF is involved in prorenin processing, we have cloned cDNA of r-NGF and examined prorenin converting activity using the CHO cell expression system, Trypsin converted the 33 kDa r-NGF precursor produced in CHO cells to a two-chain form, 9.4 and 16.4 kDa polypeptide chains, which has been known as an active form of r-NGF in mouse SMG (Server and Shooter, 1976). However, the two chain forms of r-NGF did not reveal prorenin-processing activity. Thus, only PRECE is involved in prorenin processing in mouse SMG. This result shows that their substrate specificities appear to be very strict, although some kallikreins share a high degree of amino acid sequence identity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.231-235
• /
• 2004

According to revealing the DNA sequence of human and living things, it increases that a demand on a new computational processing method which utilizes DNA sequence information. In this paper we propose a classification algorithm based on negative selection of the immune system to classify DNA patterns. Negative selection is the process to determine an antigenic receptor that recognize antigens, nonself cells. The immune cells use this antigen receptor to judge whether a self or not. If one composes n group of antigenic receptor for n different patterns, they can classify into n patterns. In this paper we propose a pattern classification algorithm based on negative selection in nucleotide base level and amino acid level.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1368-1370
• /
• 1996

The Information of Edges which takes small area comparing with the total image is very important in DNA images as well as general images. DNA image is the object should be managed by computing and it's demanding information is less than general images, but the accuracy is more important In a huge DNA image processing system such as DNA Information Bank, the performance depends on the size of image. In this paper, we extract the edge information and make it as a binary image. To reduce the size of the original image, it was applied by JPEG image compression method. The compressed image is combined with edge information when they are restored. As a result, Both the image compression ratio and restoration quality are optimized without the loss of critical information.