• Title/Summary/Keyword: gA

Search Result 67,098, Processing Time 0.081 seconds

CpG Islands Detector: a Window-based CpG Island Search Tool

  • Kim, Ki-Bong
    • Genomics & Informatics
    • /
    • v.8 no.1
    • /
    • pp.58-61
    • /
    • 2010
  • CpG is the pair of nucleotides C and G, appearing successively, in this order, along one DNA strand. It is known that due to biochemical considerations CpG is relatively rare in most DNA sequences. However, in particular subsequences, which are a few hundred to a few thousand nucleotides long, the couple CpG is more frequent. These subsequences, called CpG islands, are known to appear in biologically more significant parts of the genome. The ability to identify CpG islands along a chromosome will therefore help us spot its more significant regions of interest, such as the promoters or 'start' regions of many genes. In this respect, I developed the CpG islands search tool, CpG Islands Detector, which was implemented in JAVA to be run on any platform. The window-based graphical user interface of CpG Islands Detector may facilitate the end user to employ this tool to pinpoint CpG islands in a genomic DNA sequence. In addition, this tool can be used to highlight potential genes in genomic sequences since CpG islands are very often found in the 5' regions of vertebrate genes.

A property of surface groups

  • Moon, Myoung-Ho
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.3
    • /
    • pp.825-829
    • /
    • 1996
  • We prove that if G is the fundamental group of a closed surface or a Seifert fibered space and K is a finitely generated subgroup of G, and if for any element g in G there exists an integer $n_g$ such that $g^{n_g}$ belongs to K, then K is of finite index in G.

  • PDF

A Study on the Development of Properly Portioned Meal Sizes in the Industry Foodservice (산업체 급식의 1인 적정섭취량)

  • 조희숙
    • The Korean Journal of Food And Nutrition
    • /
    • v.12 no.1
    • /
    • pp.26-32
    • /
    • 1999
  • The purpose of this study is to set up a appropriate portion by consumed size of food in industry food-service operation. The results were summarized as follows: 51.7% of the subjects were 30 to 39 years old 83.3% of them had highschool education. They represented that taste of food intake. Individual consumption sizes for physical workers in the industry foodservice were cooked rices 238g soups 212g pot stewes 230g stir fries 40g stewes 60g fresh and boiled salad 42g kimchies 51g one course dishies 406g grills 51g meunieres 47g. Properly portioned meal sizes for physical workers based on a statistical data showed cooked rices 240∼270g soups 270g pot stewes 310g stir fries 60g stewes 75g fresh and boiled salads 76g kimchies 67g one course dishies 470g grills 80g and meunieres 50g in the foodservice industry.

  • PDF

RADIO AND RADIO ANTIPODAL LABELINGS FOR CIRCULANT GRAPHS G(4k + 2; {1, 2})

  • Nazeer, Saima;Kousar, Imrana;Nazeer, Waqas
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.1_2
    • /
    • pp.173-183
    • /
    • 2015
  • A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).

K-G-FRAMES AND STABILITY OF K-G-FRAMES IN HILBERT SPACES

  • Hua, Dingli;Huang, Yongdong
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.6
    • /
    • pp.1331-1345
    • /
    • 2016
  • A K-g-frame is a generalization of a g-frame. It can be used to reconstruct elements from the range of a bounded linear operator K in Hilbert spaces. K-g-frames have a certain advantage compared with g-frames in practical applications. In this paper, the interchangeability of two g-Bessel sequences with respect to a K-g-frame, which is different from a g-frame, is discussed. Several construction methods of K-g-frames are also proposed. Finally, by means of the methods and techniques in frame theory, several results of the stability of K-g-frames are obtained.

GROUPOID AS A COVERING SPACE

  • Park, Jong-Suh;Lee, Keon-Hee
    • Bulletin of the Korean Mathematical Society
    • /
    • v.21 no.2
    • /
    • pp.67-75
    • /
    • 1984
  • Let X be a topological space. We consider a groupoid G over X and the quotient groupoid G/N for any normal subgroupoid N of G. The concept of groupoid (topological groupoid) is a natural generalization of the group(topological group). An useful example of a groupoid over X is the foundamental groupoid .pi.X whose object group at x.mem.X is the fundamental group .pi.(X, x). It is known [5] that if X is locally simply connected, then the topology of X determines a topology on .pi.X so that is becomes a topological groupoid over X, and a covering space of the product space X*X. In this paper the concept of the locally simple connectivity of a topological space X is applied to the groupoid G over X. That concept is defined as a term '1-connected local subgroupoid' of G. Using this concept we topologize the groupoid G so that it becomes a topological groupoid over X. With this topology the connected groupoid G is a covering space of the product space X*X. Further-more, if ob(.overbar.G)=.overbar.X is a covering space of X, then the groupoid .overbar.G is also a covering space of the groupoid G. Since the fundamental groupoid .pi.X of X satisfying a certain condition has an 1-connected local subgroupoid, .pi.X can always be topologized. In this case the topology on .pi.X is the same as that of [5]. In section 4 the results on the groupoid G are generalized to the quotient groupoid G/N. For any topological groupoid G over X and normal subgroupoid N of G, the abstract quotient groupoid G/N can be given the identification topology, but with this topology G/N need not be a topological groupoid over X [4]. However the induced topology (H) on G makes G/N (with the identification topology) a topological groupoid over X. A final section is related to the covering morphism. Let G$_{1}$ and G$_{2}$ be groupoids over the sets X$_{1}$ and X$_{2}$, respectively, and .phi.:G$_{1}$.rarw.G$_{2}$ be a covering spimorphism. If X$_{2}$ is a topological space and G$_{2}$ has an 1-connected local subgroupoid, then we can topologize X$_{1}$ so that ob(.phi.):X$_{1}$.rarw.X$_{2}$ is a covering map and .phi.: G$_{1}$.rarw.G$_{2}$ is a topological covering morphism.

  • PDF

Locating-Hop Domination in Graphs

  • Canoy, Sergio R. Jr.;Salasalan, Gemma P.
    • Kyungpook Mathematical Journal
    • /
    • v.62 no.1
    • /
    • pp.193-204
    • /
    • 2022
  • A subset S of V(G), where G is a simple undirected graph, is a hop dominating set if for each v ∈ V(G)\S, there exists w ∈ S such that dG(v, w) = 2 and it is a locating-hop set if NG(v, 2) ∩ S ≠ NG(v, 2) ∩ S for any two distinct vertices u, v ∈ V(G)\S. A set S ⊆ V(G) is a locating-hop dominating set if it is both a locating-hop and a hop dominating set of G. The minimum cardinality of a locating-hop dominating set of G, denoted by 𝛄lh(G), is called the locating-hop domination number of G. In this paper, we investigate some properties of this newly defined parameter. In particular, we characterize the locating-hop dominating sets in graphs under some binary operations.

REMARKS ON THE REIDEMEISTER NUMBER OF A G-MAP

  • Cho, Sung Ki;Kweon, Dae Seop
    • Korean Journal of Mathematics
    • /
    • v.6 no.2
    • /
    • pp.165-172
    • /
    • 1998
  • For a G-map ${\phi}:X{\rightarrow}X$, we define and characterize the Reidemeister number $R_G({\phi})$ of ${\phi}$. Also, we prove that $R_G({\phi})$ is a G-homotopy invariance and we obtain a lower bound of $R_G({\phi})$.

  • PDF

A NOTE ON JANOWITZ'S HULLS OF GENERALIZED ORTHOMODULAR LATTICES

  • Park, Eun-Soon;Chung, Jin-Young
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.3
    • /
    • pp.511-519
    • /
    • 2000
  • If G is a strict generalized orthomodular lattice and H={I|I=[0, $\chi$, $\chi$$\in$G}, then H is prime ideal of the Janowitz's hull J(G) of G. If f is the janowitz's embedding, then the set of all commutatiors of f(G) equals the set of all commutators of the Janowitz's hull J(G) of G. Let L be an OML. Then L J(G) for a strict GOML G if and only if ther exists a proper nonprincipal prime ideal G in L.

  • PDF

Plasminogen Activator Inhibitor Type 1 Gene Polymorphism in Patients with Minimal Change Nephrotic Syndrome (소아 신증후군 환자에서 Plasminogen Activator Inhibitor Type 1 유전자 다형성)

  • Kim Young-Min;Hong Hyun-Kee;Kim Sung-Do;Cho Byoung-Soo
    • Childhood Kidney Diseases
    • /
    • v.8 no.1
    • /
    • pp.26-32
    • /
    • 2004
  • Purpose : Hypercoagulability is present in patients with nephrotic syndrome. Plasminogen activator inhibitor type 1(PAI-1) is a major inhibitor of plasminogen activators. PAI-1 inactivates both tissue plasminogen activator(tPA) and urokinase plasminogen activator(uPA) by rapid formation of inactive 1:1 stoichiometric complexes. Recently some studies showed that the enhanced PAI-1 expression may be involved in the intraglomerular fibrinogen/fibrinrelated antigen deposition seen in nephrotic syndrome. Methods : PAI-1 gene promoter -844(G/A) polymorphism was evaluated in 146 children with minimal change nephrotic syndrome(MCNS) and 230 control subjects. The patients with MCNS were subdivided into 85 infrequent-relapser(IR) group and 61 frequent relapser(FR) group. PCR of PAI-1 gene promoter region including -844(G/A) and RFLP using the restriction enzyme Xhol were performed for each DNA samples extracted from the groups. Results : The distribution of PAI-1 genotype in the control group was G/G 81(32.5%), A/A 42(16.9%), and G/A 126(50.6%). The distribution of PAI-1 genotypes in the IR group of MCNS was G/G 29(34.1%), A/A 15(17.7%), and G/A 41(48.2%). The distribution of PAI-1 genotype in the FR group of MCNS was G/G 17(27.9%), A/A 18(29.5%), and G/A 26(42.6%). There was a significantly increased frequency of A/A genotype(P=0.0251) in the FR group of MCNS. Conclusion : Our results indicate that the PAI-1 gene promoter A/A genotype may be associated with the FR in MCNS.

  • PDF