• 제목/요약/키워드: Mapping sequence

검색결과 352건 처리시간 0.03초

Agouti Gene의 Human Homologue의 Molecular Structure와 Chromosomal Mapping

  • Heajoon Y. Kwon;Scott J. Bultman;Christiane Loffler;Chen, Wen-Ji;Paul J. Furdon;John G. Powell;Usala, Anton-Lewis;William Wilkison;Ingo Hansman
    • 한국응용약물학회:학술대회논문집
    • /
    • 한국응용약물학회 1996년도 제4회 추계심포지움
    • /
    • pp.55-64
    • /
    • 1996
  • mouse chromesome2에 있는 agouti locus는 정상적으로는 털색깔을 조절하는 gene이다. mouse agouti gene은 최근에 cloning 되었고 131 amino acid peptide와 consensus signal peptide를 encode한다고 보고되었다. 이 논문에서 interspecies-DNA hybridization approach를 이용하여 mouse agouti gene의 human homologue를 cloning 하였다. Sequence analysis 결과, 이는 mouse gene에 85% 유사하였고 consensus signal peptide sequence 를 포함하는 132 amino acid를 coding하였다. somatic-cell hybrid mapping pannel과 Fluorescence-in-situ hybridization에 의한 chromosomal mapping을 한 결과, agouti gene은 MODY (maturity onset diabetes of the young), myeloid leukemia locus 등이 위치한 human chromosome 20q 11.2에 mapping 되었다. 성인 tissue로부터 추출한 RNA를 이용한 발현연구에 의하면 human agouti gene은 adipose tissue와 teatis에 발현되었다.

  • PDF

WEAK AND STRONG CONVERGENCE THEOREMS FOR A SYSTEM OF MIXED EQUILIBRIUM PROBLEMS AND A NONEXPANSIVE MAPPING IN HILBERT SPACES

  • Plubtieng, Somyot;Sombut, Kamonrat
    • 대한수학회보
    • /
    • 제50권2호
    • /
    • pp.375-388
    • /
    • 2013
  • In this paper, we introduce an iterative sequence for finding solution of a system of mixed equilibrium problems and the set of fixed points of a nonexpansive mapping in Hilbert spaces. Then, the weak and strong convergence theorems are proved under some parameters controlling conditions. Moreover, we apply our result to fixed point problems, system of equilibrium problems, general system of variational inequalities, mixed equilibrium problem, equilibrium problem and variational inequality.

ITERATIVE METHODS FOR GENERALIZED EQUILIBRIUM PROBLEMS AND NONEXPANSIVE MAPPINGS

  • Cho, Sun-Young;Kang, Shin-Min;Qin, Xiaolong
    • 대한수학회논문집
    • /
    • 제26권1호
    • /
    • pp.51-65
    • /
    • 2011
  • In this paper, a composite iterative process is introduced for a generalized equilibrium problem and a pair of nonexpansive mappings. It is proved that the sequence generated in the purposed composite iterative process converges strongly to a common element of the solution set of a generalized equilibrium problem and of the common xed point of a pair of nonexpansive mappings.

A MODIFIED PROXIMAL POINT ALGORITHM FOR SOLVING A CLASS OF VARIATIONAL INCLUSIONS IN BANACH SPACES

  • LIU, YING
    • Journal of applied mathematics & informatics
    • /
    • 제33권3_4호
    • /
    • pp.401-415
    • /
    • 2015
  • In this paper, we propose a modified proximal point algorithm which consists of a resolvent operator technique step followed by a generalized projection onto a moving half-space for approximating a solution of a variational inclusion involving a maximal monotone mapping and a monotone, bounded and continuous operator in Banach spaces. The weak convergence of the iterative sequence generated by the algorithm is also proved.

SOME CONVERGENCE THEOREMS FOR MAPPINGS OF ASYMPTOTICALLY QUASI-NONEXPANSIVE TYPE IN BANACH SPACES

  • Chang, Shih-sen;Yuying Zhou
    • Journal of applied mathematics & informatics
    • /
    • 제12권1_2호
    • /
    • pp.119-127
    • /
    • 2003
  • The purpose of this paper is to study the necessary and sufficient conditions for the sequences of Ishikawa iterative sequences with mixed errors of asymptotically quasi-nonexpansive type mappings in Banach spaces to converge to a fixed point in Banach spaces. The results presented in this paper extend and improve the corresponding results of[l-4, 7-9].

Digital Sequence CPLD Technology Mapping Algorithm

  • Youn, Choong-Mo
    • Journal of information and communication convergence engineering
    • /
    • 제5권2호
    • /
    • pp.131-135
    • /
    • 2007
  • In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

CONVERGENCE THEOREMS OF THE ITERATIVE SEQUENCES FOR NONEXPANSIVE MAPPINGS

  • Kang, Jung-Im;Cho, Yeol-Je;Zhou, Hai-Yun
    • 대한수학회논문집
    • /
    • 제19권2호
    • /
    • pp.321-328
    • /
    • 2004
  • In this paper, we will prove the following: Let D be a nonempty of a normed linear space X and T : D -> X be a nonexpansive mapping. Let ${x_n}$ be a sequence in D and ${t_n}$, ${s_n}$ be real sequences such that (i) $0\;{\leq}\;t_n\;{\leq}\;t\;<\;1\;and\;{\sum_{n=1}}^{\infty}\;t_n\;=\;{\infty},\;(ii)\;(a)\;0\;{\leq}\;s_n\;{\leq}\;1,\;s_n\;->\;0\;as\;n\;->\;{\infty}\;and\;{\sum_{n=1}}^{\infty}\;t_ns_n\;<\;{\infty}\;or\;(b)\;s_n\;=\;s\;for\;all\;n\;{\geq}\;1\;and\;s\;{\in}\;[0,1),\;(iii)\;x_{n+1}\;=\;(1-t_n)x_n+t_nT(s_nTx_n+(1-s_n)x_n)\;for\;all\;n\;{\geq}\;1.$ Then, if the sequence {x_n} is bounded, then $lim_{n->\infty}\;$\mid$$\mid$x_n-Tx_n$\mid$$\mid$\;=\;0$. This result improves and complements a result of Deng [2]. Furthermore, we will show that certain conditions on D, X and T guarantee the weak and strong convergence of the Ishikawa iterative sequence to a fixed point of T.

Sequence Analysis and Expression of Xylanase Gene (xynY) from Alkalophilic Bacillus sp. YC-335

  • Park, Young-Seo;Yum, Do-Young;Kim, Jin-Man;Bai, Dong-Hoon
    • Journal of Microbiology and Biotechnology
    • /
    • 제3권4호
    • /
    • pp.224-231
    • /
    • 1993
  • The nucleotide sequence of the xylanase gene (xynY) from alkalophilic Bacillus sp. YC-335 was determined and analyzed. An open reading frame of 1, 062 base pairs for xynY gene was observed and encoded for a protein of 354 amino acids with a molecular weight of 38, 915. S1 nuclease mapping showed that the transcription initiation sites of the xynY gene were different in Bacillus sp. YC-335 and Escherichia coli HB101 (pYS55). S1 mapping also showed that -10 region of the xynY gene recognized by RNA polymerases of E. coli and Bacillus sp. YC-335 were TACAGT and TATGAT , respectively. A ribosome binding site sequence with the free energy of -17.0 Kcal/mol was observed 9 base pairs upstream from the unusual initiation codon, TTG. The proposed signal sequence consisted of 27 amino acids, 2 of which were basic amino acid residues and 21 were hydrophobic amino acid residues. When the amino acid sequences of xylanases were compared, Bacillus sp. YC-335 xylanase showed more than 50% homology with xylanases from B. pumilus, B. subtilis, and B. circulans.

  • PDF

Genomic Organization of Penicillium chrysogenum chs4, a Class III Chitin Synthase Gene

  • Park, Yoon-Dong;Lee, Myung-Sook;Kim, Ji-Hoon;Jun Namgung;Park, Bum-Chan;Bae, Kyung-Sook;Park, Hee-Moon
    • Journal of Microbiology
    • /
    • 제38권4호
    • /
    • pp.230-238
    • /
    • 2000
  • Class III chitin synthases in filamentous fungi are important for hyphal growth and differentiation of several filamentous fungi. A genomic clone containing the full gene encoding Chs4, a class III chitin synthase in Penicillium chrysogenum, was cloned by PCR screening and colony hybridization from the genomic library. Nucleotide sequence analysis and transcript mapping of chs4 revealed an open reading frame (ORF) that consisted of 5 exons and 4 introns and encoded a putative protein of 915 amino acids. Nucleotide sequence analysis of the 5'flanking region of the ORF revealed a potential TATA box and several binding sites for transcription activators. The putative transcription initiation site at -716 position was identified by primer extension and the expression of the chs4 during the vegetative growth was confirmed by Northern blot analysis. Amino acid sequence analysis of the Chs4 revealed at least 5 transmembrane helices and several sites for past-transnational modifications. Comparison of the amino acid sequence of Chs4 with those of other fungi showed a close relationship between P chrysogenum and genus Aspergillus.

  • PDF