• 식물조직배양학회지
• /
• 제22권5호
• /
• pp.241-260
• /
• 1995

Transposons, present in the genomes of all living organisms, are genetic element that can change positions, or transpose, within the genome. Most genomes contain several kinds of transposable elements and the molecular details of the mechanisms by which these transposons move have recently been uncovered in many families of transposable elements. Transposition is brought about by an enzyme known as transposaese encoded by the autonomous transposon itself, but, in the unautonomous transposon lacking the gene encoding the transposase, movement occurs only at the presence of the enzyme encoded by the autonomous one. There are two types of transposition events, conservative and replicative transposition. In the former the transposon moves without replication, both strands of the DNA moving together from one place to the other while in the latter the transposition frequently involves DNA replication, so one copy of transposon remains at its original site as another copy insole to a new site. The insertion of transposon into a gene can prevent it expression whereas excision from the gene may restore the ability of the gene to be expressed. There are marked similarities between transposons and certain viruses having single stranded Plus (+) RNA genomes. Retrotransposons, which differ from the ordinary transposons in that they transpose via an RNA-intermediate, behave much like retroviruses and have a structure of integrated retrovial DNA when they are inserted to a new target site. An insertional mutagenesis called transposon-tagging is now being used in a number of plant species to isolate genes involved in developmental and metabolic processes which have been proven difficult to approach by the traditional methods. Attempts to device a transposon-tagging system based on the maize Ac for use in heterologous species have been made by many research workers.

• 대한전자공학회논문지TC
• /
• 제47권7호
• /
• pp.93-101
• /
• 2010

본 논문에서는 GF(2)에서의 두 생성다항식에 의해 생성된 M-sequence로 Gold-Sequence를 생성한 후, Permutation을 해줌으로써 Hadamard 행렬의 특성을 가지게 됨을 살펴보았다. M-sequence는 선형 귀환 천이 레지스터 부호 생성기(Linear feedback shift register code generator)에 의해 생성되었으며, 두 개의 M-sequence에 의해 생성된 Gold-sequence의 첫 열에 $8\times1$의 영행렬을 추가하고 Permutation을 시켜줌으로써 Hadamard 행렬의 주요 성질인 직교성(Orthogonal)과 한 행렬과 이 행렬의 Transpose시킨 행렬의 결과가 단위행렬이 되고, 역행렬은 element-wise Inverse가 되며, 고속 Jacket행렬의 성질을 만족한다. 또한 선형 귀환 축차 생성기를 통하여 생성된 M-sequence의 1행과 1열을 추가함으로써 위에서 언급한 Hadamard 행렬의 주요 성질을 만족하고 L-matrix 와 S-matrix 를 통하여 고속변환이 가능함을 보인다.

• 식물조직배양학회지
• /
• 제27권1호
• /
• pp.39-45
• /
• 2000

전위유전자 표지를 이용한 2배체 야생근연종 감자의 유용 유전자 cloning 체계를 개발하기 위하여 옥수수의 진위유전자 Ac를 조작하여 전위효소는 생산하나 이동은 불가능하도록 제작된 immobilized Ac (iAc)와 자체 이동은 불가능하나 iAc의 작용에 의해 이동이 가능한 Ds를 Agrobacterium tumefaciens를 이용한 형질전환에 의해 2배체 근연종 감자 (Solanum tuberosum Group Phureja) 계통 1.22에 도입하였다. iAc및 Ds 삽입 binary vector들을 보유하는Agrobacterium 계통들로 형질전환 처리된 1.22 기내배양신초의 잎과 줄기 절편의 경우 50mg/L 의 kanamycin이 첨가된 배지에서도 캘러스를 형성하였으며, 잎 절편으로부터 재분화신초가 획득되었다. 형질전환 처리되지 않은 1.22 신초는 100mg/L의 kanamycin이 첨가된 배지에서 전혀 발근이 되지 않았으나, 형질전환 처리에 의해 획득된 재분화 신초는 동일 배지에서 발근이 되었다. iAc와 Ds의 염기배열에 대해 특이적인 oligonucleotide primer들을 이용하여 형질전환 처리 획득 식물들로부터 추출된 DNA에 대한 PCR분석을 실시한 결과, 사용된 primer들의 iAc 와 Ds의 염기배열에 있어서의 위치에 의해 예상되는 크기의 DNA들이 형성되어 iAc 와 Ds의 1.22 genome내 도입이 확인되었다.

• 문화기술의 융합
• /
• 제8권4호
• /
• pp.415-422
• /
• 2022

이기종인 온주감귤 유전자(A=20.57, C=32.71, G=30.01, U=16.71%)와 커피 유전자(A=20.66, C=31.76, G=30.187, U=16.71%)는 95%이상이 유전자비가 동일하다. 이기종이면 일반적으로 유전자 결합이 안 되는 것으로 알려졌다. 그러나 유전자 기능적-유사성이 95%이상에서 Chargaff 룰과 Shannon Entropy 조건을 만족하면 접목이 가능하며, 새품종인 Coffrange가 된다. 우리는 DNA-RNA를 세계최초 BCJM 행렬로 풀어 미국특허 및 국제저널에 발표했다. 모든 동식물과 바이러스도 사람이 유전자와 비슷하다. 이점에 착안, 코로나-19와 인체의 유전자 특성을 풀어 영국 행렬교재에 6월 발표했다. 식물에서는 유전자 위치를 쉽게 바꾸는 기법인 BCJM-Transposon으로 처리한다. 시뮬레션에서는 행렬이 Cut & Paste와 Transpose로 성공할 수 있음을 예측했다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권3호
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• Journal of electromagnetic engineering and science
• /
• 제7권1호
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.433-446
• /
• 1999

Let G denote either of the groups $GL_2(q)$ or $SL_2(q)$. The mapping $theta$ sending a matrix to its transpose-inverse is an auto-mophism of G and therefore we can form the group $G^+$ = G.<$theta$>. In this paper conjugacy classes of elements in $G^+$ -G are found. These classes are closely related to the congruence classes of invert-ible matrices in G.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2014년도 추계학술대회
• /
• pp.10-11
• /
• 2014

In a 2-dimensional (2D) Discrete Cosine Transform (DCT) hardware, a significant fraction of the total hardware area is contributed by the combinational logic used to perform 1-dimensional (2D) transform. The size of the non-combinational logic i.e. the transpose memory is dictated by the size of the largest transform supported. Hence, the optimization of hardware area is performed mainly for 1D-transform combinational logic. This paper demonstrates the use of Multiple Constant Multiplication (MCM) algorithm to reduce the combinational logic area. Partial optimizations are also described for the cases where the direct use of MCM algorithm doesn't meet the timing constraint. Experimental results show that 46% improvement in gate count is achieved for 32 point 1D DCT transform logic after using MCM optimization.

• 대한수학회지
• /
• 제33권2호
• /
• pp.439-453
• /
• 1996

In R. McKenzie[12], it is shown that the cardinality of the lattice variety is $2^\aleph_0$ and K. Baker[1] contains the stronger result that M, the variety of all modular lattices, has $2^\aleph_0$ subvarieties. It follows that there exists a variety of modular lattices that is not finitely based. In fact, K. Baker[2] gave an example of such a variety. And it was proved by K. Baker [2] and B. Jonsson [8] that join of two finitely based lattice varieties is not always finitely based. K. Baker[2] gave an explicit example of case of nonmodular lattice variety. Then it is proposed whether the join of two finitely based varieties if finitely based under certain conditions. The answer to the question is not affirmative.

• 대한수학회보
• /
• 제53권4호
• /
• pp.1017-1031
• /
• 2016

Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.