• Title/Summary/Keyword: Coding Sequence

Search Result 863, Processing Time 0.027 seconds

High Efficiency Retroviral Vectors with Improved Safety

  • Yu, Seung-Shin;Kim, Jong-Mook;Kim, Sunyoung
    • Toxicological Research
    • /
    • v.17
    • /
    • pp.157-166
    • /
    • 2001
  • Almost all currently available retroviral vectors based on murine leukemia virus (MLV) contain one or more viral coding sequences. Because these sequences are also present in the packaging genome, it has been suggested that homologous recombination may occur between the same nucleotide sequence in the packaging genome and the vector, resulting in the production of replication competent retrovirus (RCR). Up until now, it has been difficult to completely remove viral coding sequences since some were thought to be involved in the optimum function of the retroviral vector. For example, the gag coding sequence present in almost all available retroviral vectors has been believed to be necessary for efficient viral packaging, while the pol coding sequence present in the highly efficient vector MFG has been thought to be involved in achieving the high levels of gene expression. However, we have now developed a series of retroviral vectors that are absent of any retroviral coding sequences but produce even higher levels of gene expression without compromising viral titer. In these vectors, the intron and exon sequences from heterologous cellular or viral genes are present. When compared to the well known MLV-based vectors, some of these newly developed vectors have been shown to produce significantly higher levels of gene expression for a longer period. In an experimental system that can maximize the production of RCR, our newly constructed vectors produced an absence of RCR. These vectors should prove to be safer than other currently available retroviral vectors containing one or more viral coding sequences.

  • PDF

High Efficiency Retroviral Vectors with Improved Safety

  • Yu, Seung-Shin;Kim, Jong-Mook;Kim, Sun-Young
    • Proceedings of the Korean Society for Applied Microbiology Conference
    • /
    • 2000.10a
    • /
    • pp.31-50
    • /
    • 2000
  • Almost all currently available retroviral vectors based on murine leukemia virus (MLV) contain one or more viral coding sequences Because these sequences are also present in the packaging genome, it has been suggested that homologous recombination may occur between the same nucleotide sequence in the packaging genome and the vector, resulting in the production of replication competent retrovirus (RCR). Up until now, it has been difficult to completely remove viral coding sequences since some were thought to be involved in the optimum function of the retroviral vector. For example, the gag coding sequence present in almost all available retroviral vectors has been believed to be necessary for efficient viral packaging, while the pol coding sequence present in the highly efficient vector MFG has been thought to be involved in achieving the high levels of gene e(pression. However, we have now developed a series of reroviral vectors that are absent of any retroviral coding sequences but produce even higher levels of gene expression without compromising viral titer. In these vectors the intron and exon sequences from heterologous cellular or viral genes are present, When compared to the well blown MLV-based vectors, some of these newly developed vectors have been shown to produce significantly higher levels of gene expression for a longer period. In an experimental system that can maximize the production of RCR, our newly constructed vectors produced an absence of RCR. These vectors should prove to be safer than other currently available retroviral vectors containing one or more viral coding sequences

  • PDF

A New Details Extraction Technique for Video Sequence Using Morphological Laplacian (수리형태학적 Laplacian 연산을 이용한 새로운 동영상 Detail 추출 기법)

  • 김희준;어진우
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.911-914
    • /
    • 1998
  • In this paper, the importance of including small image features at the initial levels of a progressive second generation video coding scheme is presented. It is shown that a number of meaningful small features called details shouuld be coded in order to match their perceptual significance to the human visual system. We propose a method for extracting, perceptually selecting and coding of visual details in a video sequence using morphological laplacian operator and modified post-it transform is very efficient for improving quality of the reconstructed images.

  • PDF

AN EFFICIENT TRELLIS EXCITATION SPEECH CODING AT 4.8 KBPS (효율적인 4.8 KBPS Trellis Exicitation 음성부호화방식)

  • 강상원
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06c
    • /
    • pp.210-213
    • /
    • 1994
  • In this paper, we present a combination of trellis coded vector quantization and code-excited linear prediction coding, termed trellis excitation coding, for an efficient 4.8 kbps speech coding system. A training sequence-based algorithm is developed for designing an otimized codebook subject to the TEC structure. Also, we discuss the trellis symbol release rules that avoid excessive encoding delay. Finally, simulation results for the TEC coder are given at bit rate of 4.8 kbps.

  • PDF

DCT-based Embedded Image Sequence Coding and Bit Allocation Scheme (DCT 기반 임베디드 동영상 부호화 및 최적 비트 배분의 기법)

  • Cheong, Cha-Keon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.575-584
    • /
    • 2002
  • This paper presents a novel DCT-based embedded zero-tree coding and optimal bit allocation algorithm for image sequence coding. In order to fully utilize the structure of the conventional standard coding algorithm and improve the coding efficiency, motion estimation and compensation(ME/MC)-DCT hybrid coding structure and a modified zero-tree coding algorithm are applied. After the rearrangement DCT coefficients into pyramidal structure according to their significance on the decoded image quality, the modified embedded zero-tree coding is performed on layered coefficients. Moreover, for a given overall bit rates, a new optimal bit control scheme is proposed to achieve the best decoded image quality in the consecutive frames. The rate control scheme can also provide the equal quality of decoded image with the control of bit rate and distortion for each frame. The various simulation results are provided to evaluate the coding performance of the proposed scheme.

3D volumetric medical image coding using unbalanced tree structure (불균형 트리 구조를 이용한 3차원 의료 영상 압축)

  • Kim Young-Seop
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.4
    • /
    • pp.567-574
    • /
    • 2006
  • This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and 16 coding unit size. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. Then the encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with I(5,3)filter performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

  • PDF

Mining and analysis of microsatellites in human coronavirus genomes using the in-house built Java pipeline

  • Umang, Umang;Bharti, Pawan Kumar;Husain, Akhtar
    • Genomics & Informatics
    • /
    • v.20 no.3
    • /
    • pp.35.1-35.9
    • /
    • 2022
  • Microsatellites or simple sequence repeats are motifs of 1 to 6 nucleotides in length present in both coding and non-coding regions of DNA. These are found widely distributed in the whole genome of prokaryotes, eukaryotes, bacteria, and viruses and are used as molecular markers in studying DNA variations, gene regulation, genetic diversity and evolutionary studies, etc. However, in vitro microsatellite identification proves to be time-consuming and expensive. Therefore, the present research has been focused on using an in-house built java pipeline to identify, analyse, design primers and find related statistics of perfect and compound microsatellites in the seven complete genome sequences of coronavirus, including the genome of coronavirus disease 2019, where the host is Homo sapiens. Based on search criteria among seven genomic sequences, it was revealed that the total number of perfect simple sequence repeats (SSRs) found to be in the range of 76 to 118 and compound SSRs from 01 to10, thus reflecting the low conversion of perfect simple sequence to compound repeats. Furthermore, the incidence of SSRs was insignificant but positively correlated with genome size (R2 = 0.45, p > 0.05), with simple sequence repeats relative abundance (R2 = 0.18, p > 0.05) and relative density (R2 = 0.23, p > 0.05). Dinucleotide repeats were the most abundant in the coding region of the genome, followed by tri, mono, and tetra. This comparative study would help us understand the evolutionary relationship, genetic diversity, and hypervariability in minimal time and cost.

Multi-Description Image Compression Coding Algorithm Based on Depth Learning

  • Yong Zhang;Guoteng Hui;Lei Zhang
    • Journal of Information Processing Systems
    • /
    • v.19 no.2
    • /
    • pp.232-239
    • /
    • 2023
  • Aiming at the poor compression quality of traditional image compression coding (ICC) algorithm, a multi-description ICC algorithm based on depth learning is put forward in this study. In this study, first an image compression algorithm was designed based on multi-description coding theory. Image compression samples were collected, and the measurement matrix was calculated. Then, it processed the multi-description ICC sample set by using the convolutional self-coding neural system in depth learning. Compressing the wavelet coefficients after coding and synthesizing the multi-description image band sparse matrix obtained the multi-description ICC sequence. Averaging the multi-description image coding data in accordance with the effective single point's position could finally realize the compression coding of multi-description images. According to experimental results, the designed algorithm consumes less time for image compression, and exhibits better image compression quality and better image reconstruction effect.

An image sequence coding using motion-compensated transform technique based on the sub-band decomposition (움직임 보상 기법과 분할 대역 기법을 사용한 동영상 부호화 기법)

  • Paek, Hoon;Kim, Rin-Chul;Lee, Sang-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.1
    • /
    • pp.1-16
    • /
    • 1996
  • In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.

  • PDF

Scalable Stereoscopic Video Coding for Heterogeneous Environments (이질적인 환경을 위한 스케러블 스테레오 영상 부호화)

  • 오세찬;이영호;우운택
    • Journal of Broadcast Engineering
    • /
    • v.9 no.3
    • /
    • pp.225-235
    • /
    • 2004
  • In this paper, we propose a new stereoscopic video coding approach for heterogeneous consumer devices by exploiting the concept of spatio-temporal scalability. The proposed method uses MPEG-2 standard for coding the left or main sequence and an enhanced compatible coding scheme for predicting the P- and B-type of frames of the right or auxiliary sequence. The enhanced compatible coding scheme predicts matching block by interpolating both two forward and backward motion predicted macroblocks and disparity predicted macroblock. To provide flexible stereo video service, we define both a temporally scalable layer and a spatially scalable layer for each eye-view. The experimental results show the efficiency of proposed coding scheme by comparison with already known methods and the advantages of disparity estimation in terms of scalability overhead. According to the experimental results, we expect the proposed functionalities will play a key role in establishing highly flexible stereo video service for ubiquitous computing environment where devices and network connections are heterogeneous.