• Journal of Biomedical Engineering Research
• /
• v.25 no.6
• /
• pp.617-621
• /
• 2004

In recent, researchers in the field of Bioinformatics need to analyze thousands of genome sequences efficiently according to introduce of new analysis methods and technologies such as genome expression microchip. This rapid growth in the field of bio-engineering needs computing resources to analyze rapidly for genome sequences, but it does not introduce the computing resources due to an enormous investment expense. The core factor of this study is integrated environment based PC-Cluster system & high speed access rate up to 155Mbps, continuous collection system for bio-information at home and abroad. The results of the study are establishment & stabilization of information and communication infrastructure, establishment & stabilization of high performance computer network up to 155Mbps, development of PC-Cluster system with 32 nodes, a parallel BLAST on Cluster system, which can provides scalable speedup in terms of response time, and development of collection & search system for bio-information.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.29-36
• /
• 2009

Sequential pattern mining, which discovers frequent subsequences as patterns in a sequence database, is an important data mining problem with broad applications. Since a sequential pattern in DNA sequences can be a motif, we studied to find sequential patterns in DNA sequences. Most previously proposed mining algorithms follow the exact matching with a sequential pattern definition. They are not able to work in noisy environments and inaccurate data in practice. Theses problems occurs frequently in DNA sequences which is a biological data. We investigated approximate matching method to deal with those cases. Our idea is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call approximated pattern. The existing PrefixSpan algorithm can successfully find sequential patterns in a long sequence. We improved the PrefixSpan algorithm to find approximate sequential patterns. The experimental results showed that the number of repeats from the proposed method was 5 times more than that of PrefixSpan when the pattern length is 4.

• Journal of Life Science
• /
• v.20 no.3
• /
• pp.411-415
• /
• 2010

Anisakis simplex is one of the parasitic nematodes, and has a complex life cycle in crustaceans, fish, squid or whale. When people eat under-processed or raw fish, it causes anisakidosis and also plays a critical role in inducing serious allergic reactions in humans. However, no web-based database on A. simplex at the level of DNA or protein has been so far reported. In this context, we constructed a web-based database for Anisakis research. To build up the web-based database for Anisakis research, we proceeded with the following measures: First, sequences of order Ascaridida were downloaded and translated into the multifasta format which was stored as database for stand-alone BLAST. Second, all of the nucleotide and EST sequences were clustered and assembled. And EST sequences were translated into amino acid sequences for Nuclear Localization Signal prediction. In addition, we added the vector, E. coli, and repeat sequences into the database to confirm a potential contamination. The web-based database gave us several advantages. Only data that agrees with the nucleotide sequences directly related with the order Ascaridida can be found and retrieved when searching BLAST. It is also very convenient to confirm contamination when making the cDNA or genomic library from Anisakis. Furthermore, BLAST results on the Anisakis sequence information can be quickly accessed. Taken together, the Web-based database on A. simplex will be valuable in developing species specific PCR markers and in studying SNP in A. simplex-related researches in the future.

• Journal of Plant Biotechnology
• /
• v.29 no.3
• /
• pp.161-170
• /
• 2002

For the hairy root of Panax ginseng, we have got mass spectrums from MALDI/TOF/MS analysis and Tandem mass spectrums from ESI/Q-TOF/MS analysis. While mass spectrum provides the molecular weights of peptide fragments digested by protease such as trypsin, tandem mass spectrum produces amino acid sequence of digested peptides. Each amino acid sequences can be a query sequence in BLAST search to identify proteins. For the specimens of animals or plants of which genome sequences were known, we can easily identify expressed proteins from mass spectrums with high accuracy. However, for the other specimens such as ginseng, it is difficult to identify proteins with accuracy since all the protein sequences are not available yet. Here we compared the mass spectrums and the peptide amino acid sequences with ginseng expressed sequence tag (EST) DB. The matched EST sequence was used as a query in BLAST search for protein identification. They could offer the correct protein information by the sequence alignment with EST sequences. 90% of peptide sequences of ESI/Q-TOF/MS are matched with EST sequences. Comparing 68% matches of the same sequences with the nr database of NCBI, we got more matches by 22% from ginseng EST sequence search. In case of peptide mass fingerprinting from MALDI/TOF/MS, only about 19% (9 proteins of 47 spots) among peptide matches from nr DB were correlated with ginseng EST DB. From these results, we suggest that amino acid sequencing using tandem mass spectrum analysis may be necessary for protein identification in ginseng proteome analysis.

• KOGO NEWS
• /
• v.3 no.2
• /
• pp.7.2-7.2
• /
• 2003

• Journal of Sericultural and Entomological Science
• /
• v.51 no.2
• /
• pp.137-141
• /
• 2013

In this study, nucleotide sequence structures of intergenic transcribed spacer (ITS) 1, complete 5.8S ribosomal RNA gene and ITS 2 region were analyzed to identify three Peruvian entomopathogenic fungal isolates. The isolates had highly conserved sequence region in 5.8S rRNA gene and unique sequences in ITS 1 and 2 region among them. 5.8S rRNA gene regions were highly conserved and showed high homoloies among tested isolates. In contrast, ITS region showed species-specific sequence region, resulting in inter-genus differencies. Scanning electron microscopic images of these isolates supported the result of ITS-based identification. From these result, Peruvian entomopathogenic fungal isolate J270, J278, were identified as Beauveria bassiana and J271 was identified as Lecanicillium attenuatum.

• Microbiology and Biotechnology Letters
• /
• v.26 no.1
• /
• pp.23-33
• /
• 1998

The entire sequence of a 4,214,810 bp genome of the Bacillus subtilis 168 has been determined by an international project, and the completion has been announced on July 19, 1997. For the sequencing project an international consortium was established and 25 European, 7 Japanese laboratories, 2 biotechnology companies, and our laboratory participated in the project. Within this framework we determined the complete nucleotide sequence of a 53,289 bp fragment upstream of the odhA gene (181 $^{\circ}$) of the B. subtilis 168 chromosome. On the basis of the published DNA sequences of the B. subtilis sspC and odhA genes, we obtained genomic fragments by plasmid rescue and long-range PCR. The sequenced fragment contains 56 putative open reading frames (designated yojA-yolI and 9 known genes (sspC, cge cluster, orfE5, orfRMl and odhA), in which we found many interesting features. In addition, the entire nucleotide sequence of a 53,289 bp region enabled us to revise the current genetic map of this region.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1217-1228
• /
• 2005

Recently, since DNA computing has been widely studied for various applications, DNA sequence design which is the most basic and important step for DNA computing has been highlighted. In previous works, DNA sequence design has been formulated as a multi-objective optimization task, and solved by elitist non-dominated sorting genetic algorithm (NSGA-II). However, NSGA-II needed lots of computational time. Therefore, we use an $\varepsilon$- multiobjective evolutionarv algorithm ($\varepsilon$-MOEA) to overcome the drawbacks of NSGA-II in this paper. To compare the performance of two algorithms in detail, we apply both algorithms to the DTLZ2 benchmark function. $\varepsilon$-MOEA outperformed NSGA-II in both convergence and diversity, $70\%$ and $73\%$ respectively. Especially, $\varepsilon$-MOEA finds optimal solutions using small computational time. Based on these results, we redesign the DNA sequences generated by the previous DNA sequence design tools and the DNA sequences for the 7-travelling salesman problem (TSP). The experimental results show that $\varepsilon$-MOEA outperforms the most cases. Especially, for 7-TSP, $\varepsilon$-MOEA achieves the comparative results two tines faster while finding $22\%$ improved diversity and $92\%$ improved convergence in final solutions using the same time.

• Journal of Life Science
• /
• v.24 no.6
• /
• pp.626-632
• /
• 2014

The genetic structure and phylogenetic relationship were investigated in Korean red spotted grouper populations using the nucleotide sequence polymorphisms of the mitochondrial DNA (mtDNA) cytochrome c oxidase subunit I (COI) gene. The COI gene was sequenced showed 99.1-99.8% identity with the EF607565 sequence previously reported. A total of twenty haplotypes were found, and the Korean population showed nineteen haplotypes. Among those, Hap_03 and Hap_08 showed Jeju-do and China-specific COI sequences, respectively. However, Hap_07 had twelve COI sequences from South Korea and records from Hong Kong and Taiwan. Neighbor-joining (NJ) trees constructed from the phylogenetic analyses based on the polymorphisms of the COI haplotypes showed a monophyletic branching pattern within the genus Epinephelus. This indicated that the red spotted grouper populations had evolved from common maternal ancestors. In addition, the Hap_08, which had the COI sequence recorded only from China Sea, was found in the middle of the NJ tree nearby Hap_07 and showed a close relationship with Hap_07. This indicates that Chinese red spotted grouper is also maternally related to other populations in East Asia. Consequently, East Asian red spotted grouper populations are maternally related, as well as sharing the same evolutionary history, and are still affected by the East Asian ocean current (Kuroshio). These findings help to explain the genetic structure and phylogenetic relationship of red spotted grouper and also contribute to research on artificial breeding and industrialization.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.4
• /
• pp.224-231
• /
• 2019

The current paper was conducted to unravel the influence of affect induction as a background emotion in the process of cognitive task to judge the degree of sequence in groups with or without anxiety symptoms. Four types of affect induction and two sequential task types were used as within-subject variables, and two types of college students groups classified under the Beck Anxiety Inventory (BAI) as a between-subject variable were selected to determine reaction times involving sequential judgment among the lexical relevance information. DmDx5 was used to present a series of stimuli and elicit a response from subjects. Repeated measured ANOVA analyses revealed that reaction times and error rates were significantly larger with anxiety participants compared to the normal group regardless of affect and task types. Within-subject variable effects found that specific affect type (sorrow condition) and number-related task type showed a more rapid response compared to other affect types and magnitude-related task type, respectively. In sum, these findings confirmed the difference in tendency with reaction time and error rates that varied as a function of accompanying affect types as well as anxiety level and task types suggesting the that underlying background affect plays a major role in processing affect-cognitive association tasks.