• Title, Summary, Keyword: 염기 단편

Search Result 115, Processing Time 0.061 seconds

Development of Contig Assembly Program for Nucleotide Sequencing (염기서열 해독작업을 위한 핵산 단편 조립 프로그램의 개발)

  • 이동훈
    • Korean Journal of Microbiology
    • /
    • v.35 no.2
    • /
    • pp.121-127
    • /
    • 1999
  • An effective computer program for assembling fragments in DNA sequencing has been developed. The program, called SeqEditor (Sequence Editor), is usable on the pcrsonal computer systems of MS-Widows which is the mosl popular operating system in Korea. It c'm recd several sequence file formats such as GenBak, FASTA, and ASCII. In the SeqEditor program, a dynamic programming algorihm is applied to compute the maximalscoring overlapping alignment between each pjlr of fragments. A novel feature of the program is that SeqEdilor implemnents interaclive operation with a graphical user interface. The performance lests of the prograln 011 fragmen1 data from 16s and 18s rDNA sequencing pi-ojects produced saiisIactory results. This program may be useful to a person who has work of time with large-scale DNA sequencing projects.

  • PDF

Development of an X-window Program, XFAP, for Assembling Contigs from DNA Fragment Data (DNA 염기 서열로부터 contig 구성을 위한 프로그램 XFAP의 개발)

  • Lee, Byung-Uk;Park, Kie-Jung;Kim, Seung-Moak
    • Korean Journal of Microbiology
    • /
    • v.34 no.1_2
    • /
    • pp.58-63
    • /
    • 1998
  • Fragment assembly problem is to reconstruct DNA sequence contigs from a collection of fragment sequences. We have developed an efficient X-window program, XFAP, for assembling DNA fragments. In the XFAP, the dimer frequency comparison method is used to quickly eliminate pairs of fragments that can not overlap. This method takes advantage of the difference of dimer frequencies within the minimum acceptable overlap length in each fragment pair. Hirschberg algorithm is applied to compute the maximal-scoring overlapping alignment in linear space. The perfomance of XFAP was tested on a set of DNA fragment sequences extracted from long DNA sequences of GenBank by a fragmentation program and showed a great improvement in execution time, especially as the number of fragments increases.

  • PDF

Fragment Combination From DNA Sequence Data Using Fuzzy Reasoning Method (퍼지 추론기법을 이용한 DNA 염기 서열의 단편결합)

  • Kim, Kwang-Baek;Park, Hyun-Jung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2329-2334
    • /
    • 2006
  • In this paper, we proposed a method complementing failure of combining DNA fragments, defect of conventional contig assembly programs. In the proposed method, very long DNA sequence data are made into a prototype of fragment of about 700 bases that can be analyzed by automatic sequence analyzer at one time, and then matching ratio is calculated by comparing a standard prototype with 3 fragmented clones of about 700 bases generated by the PCR method. In this process, the time for calculation of matching ratio is reduced by Compute Agreement algorithm. Two candidates of combined fragments of every prototype are extracted by the degree of overlapping of calculated fragment pairs, and then degree of combination is decided using a fuzzy reasoning method that utilizes the matching ratios of each extracted fragment, and A, C, G, T membership degrees of each DNA sequence, and previous frequencies of each A, C, G, T. In this paper. DNA sequence combination is completed by the iteration of the process to combine decided optimal test fragments until no fragment remains. For the experiments, fragments or about 700 bases were generated from each sequence of 10,000 bases and 100,000 bases extracted from 'PCC6803', complete protein genome. From the experiments by applying random notations on these fragments, we could see that the proposed method was faster than FAP program, and combination failure, defect of conventional contig assembly programs, did not occur.

Next Generation Sequencing and Bioinformatics (차세대 염기서열 분석기법과 생물정보학)

  • Kim, Ki-Bong
    • Journal of Life Science
    • /
    • v.25 no.3
    • /
    • pp.357-367
    • /
    • 2015
  • With the ongoing development of next-generation sequencing (NGS) platforms and advancements in the latest bioinformatics tools at an unprecedented pace, the ultimate goal of sequencing the human genome for less than $1,000 can be feasible in the near future. The rapid technological advances in NGS have brought about increasing demands for statistical methods and bioinformatics tools for the analysis and management of NGS data. Even in the early stages of the commercial availability of NGS platforms, a large number of applications or tools already existed for analyzing, interpreting, and visualizing NGS data. However, the availability of this plethora of NGS data presents a significant challenge for storage, analyses, and data management. Intrinsically, the analysis of NGS data includes the alignment of sequence reads to a reference, base-calling, and/or polymorphism detection, de novo assembly from paired or unpaired reads, structural variant detection, and genome browsing. While the NGS technologies have allowed a massive increase in available raw sequence data, a number of new informatics challenges and difficulties must be addressed to improve the current state and fulfill the promise of genome research. This review aims to provide an overview of major NGS technologies and bioinformatics tools for NGS data analyses.

Cloning of Gene Fragment having Homology with the Polypetide Chymotrypsin Inhibitor from the Potato Proteinase Inhibitor II Gene and Its Expression in E. coli. (감자 단백질 분해효소 억제제-II 유전자로부터의 폴리펩타이드 카이모트립신 저해제와 homology가 있는 유전자단편의 클로닝 및 대장균에서의 발현)

  • Jung, Jin;Park, Sang-Gyu
    • Applied Biological Chemistry
    • /
    • v.38 no.5
    • /
    • pp.382-386
    • /
    • 1995
  • The potato proteinase inhibitor II (PI-II) protein contains chymotrypsin and trypsin inhibitory site. Among several PI-II genes isolated from genomic library, amino acid sequence deduced from PI-IIT gene has 84% identity with that of the polypeptide chymotrypsin inhibitor (PCI). Therefore a gene fragment having homology with the PCI was cloned into a vector using polymerase chain reaction(PCR) from the potato proteinase inhibitor IIT gene. Two different primers were utilized for cloning; primer A contains NdeI restriction site and 30 nucleotides, which has AUG N-terminal methionine codon, primer B contains BclI restriction site and 28 nucleotides, which has TAG translation stop codon. After PCR, about 160 bp-long DNA fragment was cloned into pRT146, derivative of pUC118, and sequenced. The sequenced NdeI/BclI fragment was moved to pET3a, containing bacteriophage T7 promoter and terminator. The expressed proteins in E. coli BL2l(DE3) were determined on a polyacrylamide gel containing sodium dodecyl sulfate. The expected size of protein deduced from the sequenced gene fragment is about 6,500 dalton whose size was similar to the IPTG-induced protein (6,000 dalton) on a gel. However the expression level was much lower than expected.

  • PDF

Expression of in vitro-tested ribozyme against cucumber mosaic virus RNA in tobacco plant (시험관내에서 합성한 오이모자이크 바이러스 RNA단편을 성공적으로 절단한 ribozyme의 식물체내의 발현)

  • Park, Sang-Gyu
    • Applied Biological Chemistry
    • /
    • v.39 no.5
    • /
    • pp.355-360
    • /
    • 1996
  • In vitro-tested ribozyme against synthesized cucumber mosaic virus (CMV) RNA (Agric. Chem. & Biotech. 37:56-63(1994)) was expressed in tobacco plant to develop virus resistant plants. The ribozyme sequence was linked to cauliflower mosaic virus 35S promoter and nopaline synthase(nos) terminator and this chimeric 35S-ribozyme-nos gene was sequenced. The sequenced chimeric gene was transferred to Agrobacterium tumefaciens LBA4404 using tri-parental mating system. The E. coli HB101 containing chimeric gene was incubated with E. coli HB101(pRK2073) as a helper and Agrobacterium tumefaciens LBA4404. Then Agrobacterium cells containing the ribozyme construct was cocultivated with tobacco leaf pieces. Ten different plants were regenerated from kanamycin containing MS medium. The presence of the ribozyme construct in the transgenic tobacco plants was confirmed by polymerase chain reaction (PCR). Seven different transgenic plants in ten different kanamycin resistant plants showed the expected size (570 base pairs) of 35S-ribozyme-nos gene fragment. Total RNAs were isolated from four different transgenic plants and separated on a 1% agarose gel containing formamide. Northern hybridization with 35S-ribozyme-nos gene fragment as a probe indicated that ribozyme transcripts may be degraded tv nuclease. Therefore, nuclease-resistant ribozymes are needed for the development of virus-resistant transgenic plants using ribozymes.

  • PDF

개선된 다이나믹 프로그래밍과 품질 정보 및 퍼지 추론 기법을 이용한 DNA 염기 서열 배치 알고리즘

  • Lee, Seung-Hwan;Park, Choong-Shik;Kim, Kwang-Baek
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • /
    • pp.341-350
    • /
    • 2007
  • DNA 염기 서열 배치 알고리즘은 분자 생물학 분야에서 단백질과 핵산 서열들의 분석에서 중요한 방법이다. 생물학적인 염기 서열들은 그들 사이의 유사성과 차이점을 나타내기 위해 정렬된다. 본 논문에서는 기존의 DNA 염기 서열 배치 방법을 개선하기 위하여 DP(Dynamic Programming) 알고리즘의 비용증가( O (nm) ) 문제를 해결하는 Quadrant 방법과 품질 정보 및 퍼지 추론시스템(fuzzy inference system)을 적용한 DNA 염기 서열 배치 알고리즘을 제안한다. 본 논문에서 제안한 DNA 염기 서열 배치 알고리즘은 Quadrant 방법을 적용하여 Needleman-Wunsch의 DP 기반 알고리즘에서의 행렬 생성 단계에서 발생하는 불필요한 정렬 계산을 제거하여 전체 수행 시간을 단축하고, 각 DNA 염기 서열 단편 각각의 길이 차이와 낮은 품질의 DNA 염기 빈도를 퍼지 추론 시스템에 적용하여 지능적으로 갭 비용(gap cost)을 동적으로 조정한다. 제안된 알고리즘의 성능 평가를 위해 NCBI (National Center for Biotechnology Information)의 실제 유전체 데이터로 성능을 분석한 결과, 제안된 알고리즘이 기존의 품질정보만을 이용한 알고리즘보다 개선된 것을 확인하였다.

  • PDF

Isolation and Identification of ura5 Gene in Entomopathogenic Fungus, Metarhizium anisopoliae (살충성곰팡이 Metarhizium anisopliae의 ura5 유전자의 분리동정)

  • Park, In-Cheol;Lee, Dong-Kyu;Kang, Sun-Cheol;Hwang, Cher-Won
    • Applied Biological Chemistry
    • /
    • v.40 no.1
    • /
    • pp.30-33
    • /
    • 1997
  • About 250 bp ura5 gene (Orotate phosphoribosyl transferase) fragment was cloned from genomic DNA of entomopathogenic fungus Metarhizium anisopliae by using PCR method. Entire nucleotide sequences of cloned DNA fragment were determined and analysed as compared with other fungus ura5 genes. The amino acid sequence deduced from the nucleotide sequence showed 85.5% homology to ura5 protein of Trichoderma reesei. Using this 250 bp PCR fragment we have isolated full ura5 gene of M. anisopliae by genomic Southern hybridization and the isolated 4.4 kb DNA fragments were mapped by restrictional enzyme.

  • PDF

A DNA Sequence Alignment Algorithm Using Quality Information and a Fuzzy Inference Method (품질 정보와 퍼지 추론 기법을 이용한 DNA 염기 서열 배치 알고리즘)

  • Kim, Kwang-Baek
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.2
    • /
    • pp.55-68
    • /
    • 2007
  • DNA sequence alignment algorithms in computational molecular biology have been improved by diverse methods. In this paper, we proposed a DNA sequence alignment algorithm utilizing quality information and a fuzzy inference method utilizing characteristics of DNA sequence fragments and a fuzzy logic system in order to improve conventional DNA sequence alignment methods using DNA sequence quality information. In conventional algorithms, DNA sequence alignment scores were calculated by the global sequence alignment algorithm proposed by Needleman-Wunsch applying quality information of each DNA fragment. However, there may be errors in the process for calculating DNA sequence alignment scores in case of low quality of DNA fragment tips, because overall DNA sequence quality information are used. In the proposed method, exact DNA sequence alignment can be achieved in spite of low quality of DNA fragment tips by improvement of conventional algorithms using quality information. And also, mapping score parameters used to calculate DNA sequence alignment scores, are dynamically adjusted by the fuzzy logic system utilizing lengths of DNA fragments and frequencies of low quality DNA bases in the fragments. From the experiments by applying real genome data of NCBI (National Center for Biotechnology Information), we could see that the proposed method was more efficient than conventional algorithms using quality information in DNA sequence alignment.

  • PDF