• Title/Summary/Keyword: sequence data

Search Result 3,108, Processing Time 0.031 seconds

A data management system for microbial genome projects

  • Ki-Bong Kim;Hyeweon Nam;Hwajung Seo and Kiejung Park
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2000.11a
    • /
    • pp.83-85
    • /
    • 2000
  • A lot of microbial genome sequencing projects is being done in many genome centers around the world, since the first genome, Haemophilus influenzae, was sequenced in 1995. The deluge of microbial genome sequence data demands new and highly automatic data flow system in order for genome researchers to manage and analyze their own bulky sequence data from low-level to high-level. In such an aspect, we developed the automatic data management system for microbial genome projects, which consists mainly of local database, analysis programs, and user-friendly interface. We designed and implemented the local database for large-scale sequencing projects, which makes systematic and consistent data management and retrieval possible and is tightly coupled with analysis programs and web-based user interface, That is, parsing and storage of the results of analysis programs in local database is possible and user can retrieve the data in any level of data process by means of web-based graphical user interface. Contig assembly, homology search, and ORF prediction, which are essential in genome projects, make analysis programs in our system. All but Contig assembly program are open as public domain. These programs are connected with each other by means of a lot of utility programs. As a result, this system will maximize the efficiency in cost and time in genome research.

  • PDF

A Study on Functional Structure in Conversation of Family Therapy (가족치료 대화의 구조와 기능에 대한 대화분석적 연구)

  • Cho, Yong-Gil;Yu, Myung-Yee;Park, Tai-Young
    • Korean Journal of Social Welfare
    • /
    • v.60 no.4
    • /
    • pp.253-276
    • /
    • 2008
  • This study investigated dialog sequence prototype that was the structure of communication, which could be shown in family counseling conversation between therapists and clients. The study was intended to review the process stages of family counseling through literature review, and divided functional phases into 'atmosphere formation phase', 'family evaluation phase', 'persuasion phase of cognitive change', 'confirmation phase of change experience', and 'termination phase'. The study selected two family therapists and 30 clients for research objects. They allowed data collections for the study after the explanation about the research objects. The transcribers were trained by the consent of transcription, which used particular symbol for verbal and nonverbal contents in conversation. The transcribed data were analyzed by dialog grammar, one of the linguistic dialog analysis method developed by Hundsnurscher(1994). This study described and explained dialog sequence prototype that displayed in conversation between family therapist and client through the total sessions in family therapy. The study found three types of dialog sequence prototype in 'atmosphere formation phase', eight types in 'family evaluation phase', nine types in 'persuasion phase of cognitive change', eight types in 'confirmation phase of change experience', and eight types of 'termination phase'. Even if the dialog sequence prototype mentioned above cannot be applied to the process of family therapy at its face value, these findings may contribute to beginners in counseling and graduate students majoring family therapy to do practice in counseling. The research has a limitation in which the study investigated dialog sequence prototype of conversation in two persons. Future research needs to include dialog sequence prototype of conversation among more than three persons. Specifically, when a family therapist do family counseling, he/she treats more than three family members as usual. Therefore, the researchers hope that future study investigates dialog sequence prototype between therapist and client, client and client, among therapist, client and other family members.

  • PDF

Gated Recurrent Unit Architecture for Context-Aware Recommendations with improved Similarity Measures

  • Kala, K.U.;Nandhini, M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.538-561
    • /
    • 2020
  • Recommender Systems (RecSys) have a major role in e-commerce for recommending products, which they may like for every user and thus improve their business aspects. Although many types of RecSyss are there in the research field, the state of the art RecSys has focused on finding the user similarity based on sequence (e.g. purchase history, movie-watching history) analyzing and prediction techniques like Recurrent Neural Network in Deep learning. That is RecSys has considered as a sequence prediction problem. However, evaluation of similarities among the customers is challenging while considering temporal aspects, context and multi-component ratings of the item-records in the customer sequences. For addressing this issue, we are proposing a Deep Learning based model which learns customer similarity directly from the sequence to sequence similarity as well as item to item similarity by considering all features of the item, contexts, and rating components using Dynamic Temporal Warping(DTW) distance measure for dynamic temporal matching and 2D-GRU (Two Dimensional-Gated Recurrent Unit) architecture. This will overcome the limitation of non-linearity in the time dimension while measuring the similarity, and the find patterns more accurately and speedily from temporal and spatial contexts. Experiment on the real world movie data set LDOS-CoMoDa demonstrates the efficacy and promising utility of the proposed personalized RecSys architecture.

DNA Sequence Visualization with k-convex Hull (k-convex hull을 이용한 DNA 염기 배열의 가시화)

  • Kim, Min Ah;Lee, Eun Jeong;Cho, Hwan Gyu
    • Journal of the Korea Computer Graphics Society
    • /
    • v.2 no.2
    • /
    • pp.61-68
    • /
    • 1996
  • In this paper we propose a new visualization technique to characterize qualitative information of a large DNA sequence. While a long DNA sequence has huge information, it is not easy to obtain genetic information from the DNA sequence. We transform DNA sequences into a polygon to compute their homology in image domain rather than text domain. Our program visualizes DNA sequences with colored random walk plots and simplify them k-convex hulls. A random walk plot represents DNA sequence as a curve in a plane. A k-convex hull simplifies a random work plot by removing some parts of its insignificant information. This technique gives a biologist an insight to detect and classify DNA sequences with easy. Experiments with real genome data proves our approach gives a good visual forms for long DNA sequences for homology analysis.

  • PDF

A Minimum Sequence Matching Scheme for Efficient XPath Processing

  • Seo, Dong-Min;Yeo, Myung-Ho;Kim, Myoung-Ho;Yoo, Jae-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.5
    • /
    • pp.492-506
    • /
    • 2009
  • Index structures that are based on sequence matching for XPath processing such as ViST, PRIX and LCS-TRIM have recently been proposed to reduce the search time of XML documents. However, ViST can cause a lot of unnecessary computation and I/O when processing structural joint queries because its numbering scheme is not optimized. PRIX and LCS-TRIM require much processing time for matching XML data trees and queries. In this paper, we propose a novel index structure that solves the problems of ViST and improves the performance of PRIX and LCS-TRIM. Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of a single path or of a branching path including wild-cards ('*' and '//' ).

Spatial-Temporal Moving Sequence Pattern Mining (시공간 이동 시퀀스 패턴 마이닝 기법)

  • Han, Seon-Young;Yong, Hwan-Seung
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.3
    • /
    • pp.599-617
    • /
    • 2006
  • Recently many LBS(Location Based Service) systems are issued in mobile computing systems. Spatial-Temporal Moving Sequence Pattern Mining is a new mining method that mines user moving patterns from user moving path histories in a sensor network environment. The frequent pattern mining is related to the items which customers buy. But on the other hand, our mining method concerns users' moving sequence paths. In this paper, we consider the sequence of moving paths so we handle the repetition of moving paths. Also, we consider the duration that user spends on the location. We proposed new Apriori_msp based on the Apriori algorithm and evaluated its performance results.

Survey on Nucleotide Encoding Techniques and SVM Kernel Design for Human Splice Site Prediction

  • Bari, A.T.M. Golam;Reaz, Mst. Rokeya;Choi, Ho-Jin;Jeong, Byeong-Soo
    • Interdisciplinary Bio Central
    • /
    • v.4 no.4
    • /
    • pp.14.1-14.6
    • /
    • 2012
  • Splice site prediction in DNA sequence is a basic search problem for finding exon/intron and intron/exon boundaries. Removing introns and then joining the exons together forms the mRNA sequence. These sequences are the input of the translation process. It is a necessary step in the central dogma of molecular biology. The main task of splice site prediction is to find out the exact GT and AG ended sequences. Then it identifies the true and false GT and AG ended sequences among those candidate sequences. In this paper, we survey research works on splice site prediction based on support vector machine (SVM). The basic difference between these research works is nucleotide encoding technique and SVM kernel selection. Some methods encode the DNA sequence in a sparse way whereas others encode in a probabilistic manner. The encoded sequences serve as input of SVM. The task of SVM is to classify them using its learning model. The accuracy of classification largely depends on the proper kernel selection for sequence data as well as a selection of kernel parameter. We observe each encoding technique and classify them according to their similarity. Then we discuss about kernel and their parameter selection. Our survey paper provides a basic understanding of encoding approaches and proper kernel selection of SVM for splice site prediction.

Characterization of Korean Erwinia carotovora Strains from Potato and Chinese Cabbage

  • Seo, Sang-Tae;Koo, Jun-Hak;Hur, Jang-Hyun;Lim, Chun-Keun
    • The Plant Pathology Journal
    • /
    • v.20 no.4
    • /
    • pp.283-288
    • /
    • 2004
  • Four Erwinia carotovora strains isolated from potatoes showing blackleg symptoms and rotted Chinese cabbage were analysed by biochemical tests and sequence analysis of 16S rDNA and 16S-23S rRNA intergenic spacer (IGS) regions, and the data were compared to related E. carotovora strains. Based on the results of the biochemical tests and sequence analysis, 2 of the 4 strains were identified as E. carotovora subsp. carotovora (Ecc), whereas the rest strains were distinct from Ecc. The last two strains, HCC3 and JEJU, were biochemically similar to E, carotovora subsp. atroseptica (Eca). However, the results of sequence analysis and Eca-specific PCR assays showed that the strains were distinct from Eca. On the basis of 16S rDNA sequence analysis, HCC3 and JEJU strains were placed in E. carotovora subsp. odorifera and E. carotovora subsp. wasabiae, respectively. The results of sequence analysis and specific PCR assay for Eca indicated that Asian Eca strains were distinct from European Eca strains, although they were phenotycally homogeneous.

The Performance Analysis of IMM-MPDA Filter in Multi-lag Out of Sequence Measurement Environment (Multi-lag Out of Sequence Measurement 환경에서의 IMM-MPDA 필터 성능 분석)

  • Seo, Il-Hwan;Song, Taek-Lyul
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.8
    • /
    • pp.1476-1483
    • /
    • 2007
  • In a multi-sensor target tracking systems, the local sensors have the role of tracking the target and transferring the measurements to the fusion center. The measurements from the same target can arrive out of sequence called, the out-of-sequence measurements(OOSMs). The OOSM can arise in a form of single-lag or multi-lag throughout the transfer at the fusion center. The recursive retrodiction step was proposed to update the current state estimates with the multi-lag OOSM from the several previous papers. The real world has the possible situations that the maneuvering target informations can arrive at the fusion center with the random clutter in the possible OOSMs. In this paper, we incorporate the IMM-MPDA(Interacting Multiple Model - Most Probable Data Association) into the multi-lag OOSM update. The performance of the IMM-MPDA filter with multi-lag OOSM update is analyzed for the various clutter densities, OOSM lag numbers, and target maneuvering indexes. Simulation results show that IMM-MPDA is sufficient to be used in out of sequence environment and it is necessary to correct the current state estimates with OOSM except a very old OOSM.

Investigation on Structure and Properties of a Novel Designed Peptide with Half-Sequence Ionic Complement

  • Ruan, Li-Ping;Luo, Han-Lin;Zhang, Hang-Yu;Zhao, Xiaojun
    • Macromolecular Research
    • /
    • v.17 no.8
    • /
    • pp.597-602
    • /
    • 2009
  • Although the existing design principle of full-sequence ionic complement is convenient for the development of peptides, it greatly constrains the exploration of peptides with other possible assembly mechanisms and different yet essential functions. Herein, a novel designed half-sequence ionic complementary peptide (referred to as P9), AC-Pro-Ser-Phe-Asn-Phe-Lys-Phe-Glu-Pro-$NH_2$, is reported. When transferred from pure water to sodium chloride solution, P9 underwent a dramatic morphological transformation from globular aggregations to nanofibers. Moreover, the rheological experiment showed that the P9 could form a hydrogel with a storage modulus of about 30 Pa even at very low peptide concentration (0.5% (wt/vol)). The P9 hydrogel formed in salt solution could recover in a period of about 1,800 sec, which is faster than that in the pure water. The data suggestcd that the half-sequence, ionic complementary peptide might be worthy of further research for its special properties.