• Title/Summary/Keyword: exact sequence

Search Result 188, Processing Time 0.035 seconds

Rapid Identification of Diaporthe citri by Gene Sequence Analysis

  • Zar Zar Soe;Yong Ho Shin;Hyun Su Kang;Mi Jin Kim;Yong Chull Jeun
    • Research in Plant Disease
    • /
    • v.29 no.2
    • /
    • pp.130-136
    • /
    • 2023
  • Citrus melanoses caused by Diaporthe citri, has been one of the serious diseases in many citrus orchards of Jeju Island. To protect melanose in citrus farms, a fast and exact diagnosis method is necessary. In this study, diseased leaves and dieback twigs were collected from a total of 49 farms within March to April in 2022. A total of 465 fungal isolates were obtained from a total of 358 isolated plant samples. Among these fungal isolates, 40 representatives of D. citri isolates which were isolated from 22 twigs and 18 leaves on 23 farms were found based on cultural characteristics on potato dextrose agar and conidial morphology. Additionally, the molecular assay was carried out and compared with those by morphological diagnosis. All isolates were identified as D. citri by analyzing the sequences at the internal transcribed spacer (ITS) rDNA region using primers of ITS1/ITS4 or at β-tubulin using primer Btdcitri-F/R. Therefore, based on the present study, where the results of morphological identification of conidial type were consistent with DNA sequence analysis of certain gene, choosing a suitable method for a fast diagnosis of citrus melanose was suggested.

A review on the development of a scan statistic and its applications (스캔 통계량의 발전 과정과 응용에 대한 고찰)

  • 김병수;김기한
    • The Korean Journal of Applied Statistics
    • /
    • v.6 no.1
    • /
    • pp.125-143
    • /
    • 1993
  • The primary objective of the paper is to review the development of approximations of the null distribution of a scan statistic and to show how these approximations were improved. Let $X_1, \cdots, X_N$ be a sequence of independent uniform random variables on an interval (0, t]. A can statistic is defined to be the maximum number of observations in a subinterval of length t $\leq$ T, when we continuously (or discretely) move the subinterval from 0 to T. A scan statistic is used to test whether certain events occur in a cluster aganist a null hypothesis of the uniformity. It is difficult to calculate the exact null distribution of a scan statistic. Several authors have suggested approximations of the null distribution of a scan statistic since Naus(1966). We conceive that a scan statistic can be used for detecting a "hot region" is defined to be a region at which the frequencies of mutations are relatively high. A "hot region" may be regarded as a generalized version of a hot spot. We leave it for a further study the concrete formulation of deteciton a "hot region" in a mutational spectrum.uot; in a mutational spectrum.

  • PDF

Estimation of Substring Selectivity in Biological Sequence Database (생물학 서열 데이타베이스에서 부분 문자열의 선적도 추정)

  • 배진욱;이석호
    • Journal of KIISE:Databases
    • /
    • v.30 no.2
    • /
    • pp.168-175
    • /
    • 2003
  • Until now, substring selectivities have been estimated by two steps. First step is to build up a count-suffix tree, which has statistical information about substrings, and second step is to estimate substring selectivity using it. However, it's actually impossible to build up a count-suffix tree from biological sequences because their lengths are too long. So, this paper proposes a novel data structure, count q-gram tree, consisting of fixed length substrings. The Count q-gram tree retains the exact counts of all substrings whose lengths are equal to or less than q and this tree is generated in 0(N) time and in site not subject to total length of all sequences, N. This paper also presents an estimation technique, k-MO. k-MO can choose overlapping length of splitted substrings from a query string, and this choice will affect accuracy of selectivity and query processing time. Experiments show k-MO can estimate very accurately.

Study on Quantification Method Based on Monte Carlo Sampling for Multiunit Probabilistic Safety Assessment Models

  • Oh, Kyemin;Han, Sang Hoon;Park, Jin Hee;Lim, Ho-Gon;Yang, Joon Eon;Heo, Gyunyoung
    • Nuclear Engineering and Technology
    • /
    • v.49 no.4
    • /
    • pp.710-720
    • /
    • 2017
  • In Korea, many nuclear power plants operate at a single site based on geographical characteristics, but the population density near the sites is higher than that in other countries. Thus, multiunit accidents are a more important consideration than in other countries and should be addressed appropriately. Currently, there are many issues related to a multiunit probabilistic safety assessment (PSA). One of them is the quantification of a multiunit PSA model. A traditional PSA uses a Boolean manipulation of the fault tree in terms of the minimal cut set. However, such methods have some limitations when rare event approximations cannot be used effectively or a very small truncation limit should be applied to identify accident sequence combinations for a multiunit site. In particular, it is well known that seismic risk in terms of core damage frequency can be overestimated because there are many events that have a high failure probability. In this study, we propose a quantification method based on a Monte Carlo approach for a multiunit PSA model. This method can consider all possible accident sequence combinations in a multiunit site and calculate a more exact value for events that have a high failure probability. An example model for six identical units at a site was also developed and quantified to confirm the applicability of the proposed method.

ANALYSIS OF NEIGHBOR-JOINING BASED ON BOX MODEL

  • Cho, Jin-Hwan;Joe, Do-Sang;Kim, Young-Rock
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.455-470
    • /
    • 2007
  • In phylogenetic tree construction the neighbor-joining algorithm is the most well known method which constructs a trivalent tree from a pairwise distance data measured by DNA sequences. The core part of the algorithm is its cherry picking criterion based on the tree structure of each quartet. We give a generalized version of the criterion based on the exact box model of quartets, known as the tight span of a metric. We also show by experiment why neighbor-joining and the quartet consistency count method give similar performance.

Shape Optimization of Laminated Composite Shell for Various Layup Configurations (적층배열에 따른 복합재료 쉘의 형상최적화)

  • 김현철;노희열;조맹효
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.04a
    • /
    • pp.317-324
    • /
    • 2004
  • Shape design optimization of shell structure is implemented on a basis of integrated framework of geometric modeling and finite element analysis which is constructed on the geometrically exact shell theory. This shell theory enables more accurate and robust analysis for complicated shell structures, and it fits for the nature of B-spline function which Is popular modeling scheme in CAD field. Shape of laminated composite shells is optimized through genetic algorithm and sequential linear programming, because there ire numerous optima for various configurations, constraints, and searching paths. Sequential adaptation of global and local optimization makes the process more efficient. Two different optimized results of laminated composite shell structures to minimize strain energy are shown for different layup sequence.

  • PDF

The Performance of Chip Level Detection for DS/CDMA Operating in LEO Satellite Channel (저궤도 위성통신을 위한 칩레벨 DS/CDMA 시스템의 성능 평가에 관한 연구)

  • Jae-Hyung Kim;Seung-Wook Hwang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.2 no.4
    • /
    • pp.553-558
    • /
    • 1998
  • We present in this paper the ture union bound of the performance of chip level detection for coded DS/CDMA system operating in Rician fading channels such as LEO satellite mobile radio where the maximum doppler frequency is very high. The main objective of this paper is to calculate the exact doe union bound of BER performance of different performance of different quadrature detectors and to find a optimum spreading factor as a function of fade rate. The rationale of using multiple chip detection is to reduce the effective fade rate or variation. We considered chip level differential detection, chip level maximum likelihood sequence estimation, noncoherent detection and coherent detection with perfect channel state information as a reference.

  • PDF

GRAPHICALITY, C0 CONVERGENCE, AND THE CALABI HOMOMORPHISM

  • Usher, Michael
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.6
    • /
    • pp.2043-2051
    • /
    • 2017
  • Consider a sequence of compactly supported Hamiltonian diffeomorphisms ${\phi}_k$ of an exact symplectic manifold, all of which are "graphical" in the sense that their graphs are identified by a Darboux-Weinstein chart with the image of a one-form. We show by an elementary argument that if the ${\phi}_k$ $C^0$-converge to the identity, then their Calabi invariants converge to zero. This generalizes a result of Oh, in which the ambient manifold was the two-disk and an additional assumption was made on the Hamiltonians generating the ${\phi}_k$. We discuss connections to the open problem of whether the Calabi homomorphism extends to the Hamiltonian homeomorphism group. The proof is based on a relationship between the Calabi invariant of a $C^0$-small Hamiltonian diffeomorphism and the generalized phase function of its graph.

GRADED w-NOETHERIAN MODULES OVER GRADED RINGS

  • Wu, Xiaoying
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.5
    • /
    • pp.1319-1334
    • /
    • 2020
  • In this paper, we study the basic theory of the category of graded w-Noetherian modules over a graded ring R. Some elementary concepts, such as w-envelope of graded modules, graded w-Noetherian rings and so on, are introduced. It is shown that: (1) A graded domain R is graded w-Noetherian if and only if Rg𝔪 is a graded Noetherian ring for any gr-maximal w-ideal m of R, and there are only finite numbers of gr-maximal w-ideals including a for any nonzero homogeneous element a. (2) Let R be a strongly graded ring. Then R is a graded w-Noetherian ring if and only if Re is a w-Noetherian ring. (3) Let R be a graded w-Noetherian domain and let a ∈ R be a homogeneous element. Suppose 𝖕 is a minimal graded prime ideal of (a). Then the graded height of the graded prime ideal 𝖕 is at most 1.

POSTNIKOV SECTIONS AND GROUPS OF SELF PAIR HOMOTOPY EQUIVALENCES

  • Lee, Kee-Young
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.3
    • /
    • pp.393-401
    • /
    • 2004
  • In this paper, we apply the concept of the group \ulcorner(X,A) of self pair homotopy equivalences of a CW-pair (X, A) to the Postnikov system. By using a short exact sequence related to the group of self pair homotopy equivalences, we obtain the following result: for any Postnikov section X$\sub$n/ of a CW-complex X, the group \ulcorner(X$\sub$n/, A) of self pair homotopy equivalences on the pair (X$\sub$n/, X) is isomorphic to the group \ulcorner(X) of self homotopy equivalences on X. As a corollary, we have, \ulcorner(K($\pi$, n), M($\pi$, n)) ≡ \ulcorner(M($\pi$, n)) for each n$\pi$1, where K($\pi$,n) is an Eilenberg-Mclane space and M($\pi$,n) is a Moore space.