• Title/Summary/Keyword: random walk plot

Search Result 2, Processing Time 0.021 seconds

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

Development of Workbench for Analysis and Visualization of Whole Genome Sequence (전유전체(Whole gerlome) 서열 분석과 가시화를 위한 워크벤치 개발)

  • Choe, Jeong-Hyeon;Jin, Hui-Jeong;Kim, Cheol-Min;Jang, Cheol-Hun;Jo, Hwan-Gyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.387-398
    • /
    • 2002
  • As whole genome sequences of many organisms have been revealed by small-scale genome projects, the intensive research on individual genes and their functions has been performed. However on-memory algorithms are inefficient to analysis of whole genome sequences, since the size of individual whole genome is from several million base pairs to hundreds billion base pairs. In order to effectively manipulate the huge sequence data, it is necessary to use the indexed data structure for external memory. In this paper, we introduce a workbench system for analysis and visualization of whole genome sequence using string B-tree that is suitable for analysis of huge data. This system consists of two parts : analysis query part and visualization part. Query system supports various transactions such as sequence search, k-occurrence, and k-mer analysis. Visualization system helps biological scientist to easily understand whole structure and specificity by many kinds of visualization such as whole genome sequence, annotation, CGR (Chaos Game Representation), k-mer, and RWP (Random Walk Plot). One can find the relations among organisms, predict the genes in a genome, and research on the function of junk DNA using our workbench.