• Title/Summary/Keyword: permutation

Search Result 418, Processing Time 0.025 seconds

DNA Marker Mining of BMS1167 Microsatellite Locus in Hanwoo Chromosome 17

  • Lee, Jea-Young;Lee, Yong-Won;Kwon, Jae-Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.325-333
    • /
    • 2006
  • We describe tests for detecting and locating quantitative traits loci (QTL) for traits in Hanwoo. Lod scores and a permutation test have been described. From results of a permutation test to detect QTL, we select major DNA markers of BMS1167 microsatellite locus in Hanwoo chromosome 17 for further analysis. K-means clustering analysis applied to four traits and eight DNA markers in BMS1167 resulted in three cluster groups. We conclude that the major DNA markers of BMS1167 microsatellite locus in Hanwoo chromosome 17 are markers 100bp, 108bp and 110bp.

  • PDF

Consistency Test in the House of Quality using Permutation Test (순열검정을 이용한 품질의 집의 일관성 검정)

  • Kim, Kyungmee O.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.1
    • /
    • pp.42-48
    • /
    • 2008
  • The house of quality (HOQ) involves subjective and ambiguous information typically through a likert scale, It isimportant to validate consistency of such input in the HOQ before rating the fmal importance of technicalrequirements, Previously, a methodology was developed to test the consistency of relationship strengths in theHOQ between roof matrix and relationship matrix. We described disadvantages of the previous method andpropose a new approach based on the permutation test. Advantages of the proposed method are illustrated withan example.

AN OPTIMAL ALGORITHM FOR FINDING DETH-FIRST SPANNING TREE ON PERMUTATION GRAPHS

  • Mondal, Sukumar;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.3
    • /
    • pp.727-734
    • /
    • 1999
  • Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

Method-Free Permutation Predictor Hypothesis Tests in Sufficient Dimension Reduction

  • Lee, Kyungjin;Oh, Suji;Yoo, Jae Keun
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.4
    • /
    • pp.291-300
    • /
    • 2013
  • In this paper, we propose method-free permutation predictor hypothesis tests in the context of sufficient dimension reduction. Different from an existing method-free bootstrap approach, predictor hypotheses are evaluated based on p-values; therefore, usual statistical practitioners should have a potential preference. Numerical studies validate the developed theories, and real data application is provided.

A Major DNA Marker Mining of BMS941 Microsatellite Locus in Hanwoo Chromosome 17

  • Lee, Jea-Young;Lee, Yong-Won
    • Journal of the Korean Data and Information Science Society
    • /
    • v.16 no.4
    • /
    • pp.913-921
    • /
    • 2005
  • We describe tests for detecting and locating quantitative traits loci (QTL) for traits in Hanwoo. Lod scores and a permutation test have been described. From results of a permutation test to detect QTL, we select major DNA markers of BMS941 microsatellite locus in Hanwoo chromosome 17 for further analysis. K-means clustering analysis applied to four traits and eight DNA markers in BMS941 resulted in three cluster groups. We conclude that the major DNA markers of BMS941 microsatellite locus in Hanwoo chromosome 17 are markers 80bp, 85bp 90bp and 105bp.

  • PDF

AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS

  • SAHA ANITA;PAL MADHUMANGAL;PAL TAPAN K.
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.77-92
    • /
    • 2005
  • An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH

  • Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.1
    • /
    • pp.141-152
    • /
    • 1998
  • Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.

PERMUTATION POLYNOMIALS OF THE TYPE $1 + X + CDOTS + X^K$

  • Kim, Kyung-Hee;Lee, June-Bok;Park, Young-H
    • Journal of the Korean Mathematical Society
    • /
    • v.33 no.1
    • /
    • pp.81-87
    • /
    • 1996
  • Let $F_q$ denote the finite field of order $q = p^n$, p a prime. A polynomial $f \in F_q[x]$ is called a permutation polynomial over $F_q$ if f induces a 1-1 map of $F_q$ onto itself.

  • PDF

WEIGHTED PROJECTIVE LINES WITH WEIGHT PERMUTATION

  • Han, Lina;Wang, Xintian
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.219-236
    • /
    • 2021
  • Let �� be a weighted projective line defined over the algebraic closure $k={\bar{\mathbb{F}}}_q$ of the finite field ��q and σ be a weight permutation of ��. By folding the category coh-�� of coherent sheaves on �� in terms of the Frobenius twist functor induced by σ, we obtain an ��q-category, denoted by coh-(��, σ; q). We then prove that coh-(��, σ; q) is derived equivalent to the valued canonical algebra associated with (��, σ).

Canonical Correlation: Permutation Tests and Regression

  • Yoo, Jae-Keun;Kim, Hee-Youn;Um, Hye-Yeon
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.3
    • /
    • pp.471-478
    • /
    • 2012
  • In this paper, we present a permutation test to select the number of pairs of canonical variates in canonical correlation analysis. The existing chi-squared test is known to be limited to normality in use. We compare the existing test with the proposed permutation test and study their asymptotic behaviors through numerical studies. In addition, we connect canonical correlation analysis to regression and we we show that certain inferences in regression can be done through canonical correlation analysis. A regression analysis of real data through canonical correlation analysis is illustrated.