• 대한수학회보
• /
• 제55권3호
• /
• pp.921-935
• /
• 2018

In this study we determine the structure of m-adic residue codes over the non-chain ring $F_q[v]/(v^2-v)$ and present some promising examples of such codes that have optimal parameters with respect to Griesmer Bound. Further, we show that the generators of m-adic residue codes serve as a natural and suitable application for generating reversible DNA codes via a special automorphism and sets over $F_{4^{2k}}[v]/(v^2-v)$.

• 정보처리학회논문지B
• /
• 제10B권7호
• /
• pp.769-776
• /
• 2003

MCP(Maximal Clique Problem)를 해결하기 위해 DNA 컴퓨팅이 사용되고 있다. 그러나 현재의 DNA 컴퓨팅을 MCP에 적용하였을 때, 정점과 간선을 효율적으로 표현할 수 없으며 제한 효소의 잘못된 사용으로 인하여 해를 찾을 수 없는 문제점을 가지고 있다. 본 논문에서는 MCP의 문제점을 해결하기 위해 DNA 컴퓨팅 기법에 DNA 코딩 방법을 적용한 ACO(Algorithm for Code Optimization)를 제안한다. 우리는 ACO를 MCP에 적용하였고, 그 결과 ACO는 Adleman의 DNA 컴퓨팅 알고리즘 보다 가변길이의 DNA 코드를 표현할 수 있으며, 불필요한 정점을 제거한 코드를 생성할 수 있었다. 또한 ACO는 Adleman의 DNA 컴퓨팅 알고리즘 보다 탐색 시간과 생물학적 오류율을 15% 정도 줄임으로써 4배 정도 많은 최종해를 얻을 수 있었다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권4호
• /
• pp.387-393
• /
• 2004

DNA 컴퓨팅은 생체 분자들의 막대한 병렬성을 정보 처리 기술에 적용한 기술로, Np-complete문제를 해결하기 위하여 사용되고 있다. 하지만 DNA 컴퓨팅 기술만으로 NP-complete 문제를 해결할 경우에는 해를 찾지 못하거나 많은 시간이 걸리는 문제점이 있다. 본 논문에서는 DNA 코딩 방법을 적용하여 DNA 서열을 효율적으로 표현하고, 반응횟수 만큼 합성과 분리 과정을 거쳐 코드를 생성하는 ACO(Algorithm for Code Optimization)를 제안했다. 그리고 ACO를 NP-complete 문제 중의 하나인 Hamiltonian Path Problem에 적용하였다. 그 결과 ACO는 Adleman의 DNA 컴퓨팅 알고리즘 보다 가변길이의 DNA 코드를 효율적으로 표현할 수 있다는 것을 확인하였다. 또 한 ACO는 Adleman의 DNA 컴퓨팅 알고리즘 보다 탐색 시간과 생물학적 오류율을 50%정도 줄일 수 있었으며, 빠른 시간 내에 정확한 경로를 탐색할 수 있었다.

• 한국지능시스템학회논문지
• /
• 제14권1호
• /
• pp.105-111
• /
• 2004

Traveling Salesman Problem(TSP)을 해결하기 위해 DNA 컴퓨팅이 사용되고 있다. 그러나 현재의 DNA 컴퓨팅을, TSP에 적용하였을 때, 정점과 정점사이의 가중치를 효율적으로 표현할 수 없다. 본 논문에서는 TSP의 정점과 정점 사이의 가중치를 효율적으로 표현하기 위해 DNA 컴퓨팅 기법에 DNA 코딩방법을 적용한 ACO(Algorithm for Code Optimization)를 제안한다. 우리는 ACO를 TSP에 적용하였고, 그 결과 ACO 는 Adleman의 DNA 컴퓨팅 알고리즘보다 가변길이의 DNA 코드와 간선의 가중치를 효율적으로 표현할 수 있었다. 또한 ACO 는 Adleman의 DNA 컴퓨팅 알고리즘 보다 탐색 시간과 생물학적 오류율을 50% 정도 줄일 수 있었으며, 빠른 시간 내에 최단경로를 탐색할 수 있었다.

• 한국동물학회지
• /
• 제35권2호
• /
• pp.203-210
• /
• 1992

Hsp70, a 70 kDa protein, is the maior protein expressed when cells are heat-shocked. A cDNA library from mouse ID13 cells was screened with the human hsp70 gene as a probe, and a positive clone was obtained. The positive clone was subcloned into puc19 and the precise restriction was obtained. The CDNA was sequenced by the Sanger's dideoxv termination method. Single open reading frame that codes for a protein of 70 kDa was found. The DNA sequence of the cloned mouse DNA shows great homology (66-90%) with other mouse hsp70 genes and somewhat less homology (50",) with E. coli hsp70 gene (dnak). With the exception of one amino acid, the protein sequence deduced from the CDNA is identical to the mouse that shock cognate protein 70 (hsc70) that is constitutivelv expressed at normal temperature. The result suggests that the cloned CDNA encodes a hsc70 family rather than a heatinducible family.mily.

• 공학교육연구
• /
• 제21권3호
• /
• pp.66-75
• /
• 2018

This paper is the second part of the January 2018 issue of the Korean Society for Engineering Education, The "Equilibrium and Unbalance Analysis of Taegeuk Pattern DNA Matrix Codes," and is an extension of the paper published in the IoT Section of the 2017 Summer Conference in Jeju. In this paper, we have reviewed the history of what is life, and 5G Mobile communication: with IoT followed by recent research on influenza RNA gene mutation and DNA mutation variants, and the insights of Watson and Crick. Inspired by a single Franklin DNA X-ray diffraction photograph, they received the Nobel Prize for the Nature publication of DNA that has three patterns and regular repeatability. Professor MoonHo Lee has solved the three patterns in Diagonal, Left to Right, and Vertical matrices in a 2x2 matrix[CU; AG] and A = T = U = 30% C = G = 20%. We also proposed DNA Watch. This is the Healthcare IoT, which is seen by the DNA Watch on the wrist, the type of Tai Chi pattern of the body, and is immediately connected to the smartphone and delivered to the doctor.

• Journal of Plant Biology
• /
• 제39권3호
• /
• pp.197-202
• /
• 1996

A pollen-specific cDNA clone, LMP50, was isolated from the mature pollen cDNA library of the Easter lily. The LMP50 transcript was highly abundant in mture pollen grains but not detectable in other organs. The LMP50 cDNA clone contains 1383 nucleotides and two open reading frames. The first codes for a peptide of 15 amino acid residues. The role of this peptide is nuclear. The second encodes a protein containing 329 amino acid residues. This protein exhibited a significant homology to human tartrate-resistant acid phosphatase and porcine uteroferrin. Both of these enzymes have been suggested to play a role in iron transport. Therefore, LMP50 may act as an iron carrier protein in mature pollen grains.

• International Journal of Industrial Entomology and Biomaterials
• /
• 제4권2호
• /
• pp.101-107
• /
• 2002

We describe here the cDNA sequence and mRNA expression of a novel family of the antioxidant protein, peroxiredoxin, from the firefly, Pyracoetia ruin. The 555 bp cDNA sequence codes for a 185 amino acid protein with a calculated molecular mass of approximately 21 kDa. The deduced protein of P. rufa peroxiredoxin gene contains two conserved cysteine residues. Alignment of the deduced protein of P. rufa peroxiredoxin gene showed 71.1% protein sequenceidentity to known insect Drosophila melanogaster peroxiredoxin. Northern blot analysis revealed that the P. rufa peroxiredoxin is specifically expressed in the fat body of P. rufa larvae.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.281-287
• /
• 2021

Bioinformatics is formed with a blend of biology and informatics technologies and it employs the statistical methods and approaches for attending the concerning issues in the domains of nutrition, medical research and towards reviewing the living environment. The ceaseless growth of DNA sequencing technologies has resulted in the production of voluminous genomic data especially the DNA sequences thus calling out for increased storage and bandwidth. As of now, the bioinformatics confronts the major hurdle of management, interpretation and accurately preserving of this hefty information. Compression tends to be a beacon of hope towards resolving the aforementioned issues. Keeping the storage efficiently, a methodology has been recommended which for attending the same. In addition, there is introduction of a competent algorithm that aids in exact matching of small pattern. The DNA representation sequence is then implemented subsequently for determining 2 bases to 6 bases matching with the remaining input sequence. This process involves transforming of DNA sequence into an ASCII symbols in the first level and compress by using LZ77 compression method in the second level and after that form the grid variables with size 3 to hold the 100 characters. In the third level of compression, the compressed output is in the grid variables. Hence, the proposed algorithm S_Pattern DNA gives an average better compression ratio of 93% when compared to the existing compression algorithms for the datasets from the UCI repository.

• Ocean Science Journal
• /
• 제40권1호
• /
• pp.55-59
• /
• 2005

We cloned the complete cDNA of the ${\beta}-bubulin$ from the soft coral, Scleronephthya gracillimum $(K\ddot{u}kenthal)$ (Alcyonacea, Octocorallia, Anthozoa, Cnidaria), via the random sequencing of a cDNA library and the 5'-rapid amplification of cDNA end (RACE) technique. The full-length cDNA of the S. gracillimum ${\beta}-tubulin$ comprised 1541 bp, not including the poly $A^+$ stretch, also contained a complete open reading frame, which codes for a total of 445 amino acids. The amino acid residues 16402 appeared to be in a state of conservation in a variety of animals. Northern blot analysis clearly demonstrated that the sequence we have obtained is, indeed, the full-length cDNA of the ${\beta}-bubulin$ gene in S. gracillimum.