• Journal of Life Science
• /
• v.7 no.3
• /
• pp.167-171
• /
• 1997

As an initial effort to elucidate RNA: protein binding in a way to regulate translation initiation and phosphorylation, a cDNA encoding a double-stranded RNA binding factor (RBFII)was isolated from Hela ZAPII cDNA library by affinity screening using [$\alpha$$^{-32}$P] UMP-labeled HIV Rev-responsive element(RRE) RNA. The nucleotide sequence of RBF (or TRBP) cDNA except the 5’end. At the 5’end, This common ORF was fused in-frame to N-terminal residues of Lac-Z through a unique 138 nt sequence encoding 46residues in the case of RBFII and a 63 nt sequence encoding 21 residuces in the case of RBFI. The context of ATG appearing first in the sequences suggests that both these cDNA inserts are incomplete at the 5’end.

• Clinical and Experimental Pediatrics
• /
• v.53 no.4
• /
• pp.519-524
• /
• 2010

Purpose : To determine the efficacy of the N-terminal fragment of B-type natriuretic peptide (NT-proBNP) as a useful diagnostic method in children with incomplete Kawasaki disease (KD). Methods : Ninety-six patients who were diagnosed as having KD between January 2008 and June 2009 were enrolled in the study. American Heart Association recommendations for diagnosis were used, and patients were divided into the complete KD and incomplete KD groups. Blood tests including NT-proBNP were performed on admission day. Nineteen patients who had other febrile diseases other than KD were enrolled as control. Results : Thirty-three patients (34%) had incomplete KD. Change in the lips and oral cavity and conjunctivitis were the most common clinical features, but their frequency was lower than complete KD (76% vs 98%, 76% vs 90%). Patients with incomplete KD exhibited significantly higher NT-proBNP level than that of control ($1,407.7{\pm}1633.5pg/mL$ vs $126.2{\pm}135.5pg/mL$, $P$<0.001). An NT-proBNP cutoff value of 158 pg/mL provided a sensitivity of 81% and a specificity of 74% for diagnosis of incomplete KD. Conclusion : NT-proBNP assay can be clinically useful for the diagnosis of incomplete KD, if the patient has persistent fever, change in the lips and oral cavity, and conjunctivitis, and if the patient with those symptoms is suspected to have incomplete KD.

• Korean Journal Plant Pathology
• /
• v.12 no.2
• /
• pp.176-181
• /
• 1996

Aster yomena로부터 분리한 오이 모자이크 바이러스(cucumber mosaic virus) (CMV-As)의 RNA4로부터 완전한 길이의 cDNA를 합성하고 그 전체적인 염기서열(1,043 nt`s)을 결정하였다. CMV-As RNA4는 73개의 염기로 구성된 5`말단의 leader 부위, 657개의 염기로 구성된 외피단백질(coat protein) 유전자 부위 및 312개의 염기로 구성된 3` 말단의 비번역 부위로 구성되어 있음을 확인하였다. 외피단백질 유전자 부위의 염기서열을 다른 계통의 CMV와 비교해 볼 때 그 염기서열이 보전적으로 존재하고 있으나 그 외의 부분은 다양함을 확인하였다. 특히 3` 말단부위의 61개의 염기로 구성된 부위(959-1019)는 다른 계통의 CMV에서는 상당히 유사하지만 CMV-As도 다른 CMV처럼 tRNA와 유사한 구조를 역시 형성함을 확인하였다. CMV-As의 RNA4 염기서열을 다른 계통의 CMV와 비교할 때 CMV-I17F와 가장 유사하였으며(91.9%) S형의 CMV-M과는 가장 낮은 동일성을 보였다(71.1%). 외와 같은 염기성열의 비교 결과와 EcoRI 제한효소 인식부위의 존재로 미루어 CMV-As는 WT형으로 분류된다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.592-602
• /
• 1995

Non-grid and grid method are used for modeling the routing region of the automatic routing system. In this study, we develop the automatic routing system by mixing the methods of non-grid and grid to improve the speed of routing. Grid method has a demerit which decreases the automatic routing speed because it is required a lot of memory by the limitation of the size of board and grid, although the electrical and physical elements are insufficient on the PCB, But non-grid is spent gurite less memory than grid method by using a shape-based patterns. Therefore, we used the methods of non-grid and grid altogether in this paper, In the former method, it is attributed to the improvement of speed, the latter one is applied only the connection of the failed routing in the former one, and it performs the complete automatic routing. This system was developed with C＋＋language under the Windows NT environment of IBM 486DX2-66 Computer.

• Korean Journal of Animal Reproduction
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2003

This study was conducted to investigate the effect of infusion of sterile boar and their semen as pregnancy antigen factor for improvement of production in gilts. We observed 160 gilts between 7 to 8 months of age that were divided into 4 treatment groups vie. A group-epidimetomized boar, B group-no sperm semen infusion, C group-vasectomized boar, and D group-control in a completely randomized design. The number of total pigs born(NT) of A, B, C, and D groups were 10.05, 10.44, 11.63, and 9.97 pigs, respectively(P<0.05). And the NT of C g.cup was the highest among treatment. The number of live pigs born(NB) was similar to NT The NB of C group (10.70) was higher than that of A(9.12) and control(9.11)(P<0.05). However, there was not significant between B and C groups. The progesterone concentration of C group was the highest compare to other group at the 6th day after breeding. However, the progesterone concentration of C was lower than other groups after 8th day. There were not significant among cortisol of A, B, C and D groups. According of the results of this study, the infusion with vasectomized boar and semen at estrus before gestation can be improved reproductive efficiency because of more litter size in gilts.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.16-21
• /
• 2002

Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.