• Title/Summary/Keyword: Permutation Method

Search Result 120, Processing Time 0.027 seconds

Determination of Significance Threshold for Detecting QTL in Pigs (돼지의 QTL 검색을 위한 유의적 임계수준(Threshold) 결정)

  • Lee, H.K.;Jeon, G.J.
    • Journal of Animal Science and Technology
    • /
    • v.44 no.1
    • /
    • pp.31-38
    • /
    • 2002
  • Interval mapping using microsatellite markers was employed to detect quantitative trait loci (QTL) in the experimental cross between Berkshire and Yorkshire pigs. In order to derive critical values (CV) for test statistics for declaring significance of QTL, permutation test (PT) of Churchill and Doerge method(1994) and the analytical method(LK) of Lander and Kruglyak(1995) were used by each trait and chromosome. 525 $F_2$ progeny phenotypes of five traits(carcass weight, loin eye area, marbling score, cholesterol content, last back fat thickness) and genotypes of 125 markers covering the genome were used. Data were analyzed by line cross regression interval mapping with an F-test every by 1cM. PT CV were based on 10,000 permutations. CV at genome-wise test were 10.5 for LK and ranged from 8.1 to 8.3 for PT, depending on the trait. CV, differed substantially between methods, led to different numbers of quantitative trait loci (QTL) to be detected. PT results in the least stringent CV compared at the same % level.

Bootstrapping and DNA Marker Mining of ILSTS098 Microsatellite Locus in Hanwoo Chromosome 2

  • Lee, Jea-Young;Kwon, Jae-Chul
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.3
    • /
    • pp.525-535
    • /
    • 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 ILSTS098 microsatellite locus in Hanwoo chromosome 2 for further analysis. K-means clustering analysis applied to four traits and eight DNA markers in ILSTS098 resulted in three cluster groups. We conclude that the major DNA markers of BMS1167 microsatellite locus in Hanwoo chromosome 2 are markers 105bp, 113bp and 115bp. Finally, bootstrap testing method has been adapted to calculate confidence intervals and for finding major DNA Markers.

Bootstrap Analysis and Major DNA Markers of BM4311 Microsatellite Locus in Hanwoo Chromosome 6

  • Yeo, Jung-Sou;Kim, Jae-Woo;Shin, Hyo-Sub;Lee, Jea-Young
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.17 no.8
    • /
    • pp.1033-1038
    • /
    • 2004
  • LOD scores related to marbling scores and permutation test have been applied for the purpose detecting quantitative trait loci (QTL) and we selected a considerable major locus BM4311. K-means clustering, for the major DNA marker mining of BM4311 microsatellite loci in Hanwoo chromosome 6, has been tried and five traits are divided by three cluster groups. Then, the three cluster groups are classified according to six DNA markers. Finally, bootstrap test method to calculate confidence intervals, using resampling method, has been adapted in order to find major DNA markers. It could be concluded that the major markers of BM4311 locus in Hanwoo chromosome 6 were DNA marker 100 and 95 bp.

Bootstrapping and DNA marker Mining of BMS941 microsatellite locus in Hanwoo chromosome 17

  • Lee, Jea-Young;Bae, Jung-Hwan;Yeo, Jung-Sou
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.4
    • /
    • pp.1103-1113
    • /
    • 2007
  • LOD scores and a permutation test for detecting and locating Quantitative trait loci(QTL) from the Hanwoo economic trait have been described and we selected a considerable major BMS941 locus. K -means clustering analysis of eight markers in BMS941 and four traits resulted in three cluster groups. Finally, we applied the bootstrap test method to calculate confidence intervals for finding major DNA markers. We conclude that the major markers of BMS941 locus in Hanwoo chromosome 17 are markers 85bp and 105bp.

  • PDF

Estimation of Equivalent Hydrodynamic Coefficients by Bean Permutation Technique (보치환법에 의한 등가 유체력계수 산정)

  • 박춘군
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.12 no.2
    • /
    • pp.81-86
    • /
    • 2000
  • For on-shore structures, dynamic analysis becomes increasingly important as the water depth increases and the structural configuration becoines slenderer. In this study, an estimation method for equivalent three dimensional (30) hydrodynamic coefficients is introduced as a part of beam permutation technique development. The beam pemlUtation technique is being developed for obtaining an equivalent beam to a frame structure in order to reduce the degrees of freedom and thus the analysis time significantly. Two 3D structures are used in order to verify the obtained equivalent 3D hydrodynamic coefficients. Two commercial softwares, ANSYS and SACS, are used for the verification. The results of the present analysis are found to be satisfactory in comparison with those by the two softwares.

  • PDF

The Study of Factors of Anxiety of Permutation and Combination in High School (고등학교 순열과 조합 단원의 불안요인 연구)

  • Kim, Mi-Jeong;Kim, Yong-Gu;Jung, In-Chul
    • Journal of the Korean School Mathematics Society
    • /
    • v.12 no.2
    • /
    • pp.261-279
    • /
    • 2009
  • Permutation and combination are the subjects that most teachers feel difficult to teach in Mathematics. This paper investigated evaluation items and factors of anxiety of students for permutation and combination, and further examined the way to lessen the factors of anxiety. Two high school students participated for over a year from December 2007 to February 2008. Also, two teachers joined for the analysis of evaluation items. We found that the ill-structured problems and word problems are the main factors to bring about the anxiety, whereas cooperative learning with high intelligent peers, practice to read word problems and write the process of problems solving are helpful in lessening the mathematical anxieties. Further we propose that the study of appropriate teaching and learning method for permutation and combination should be performed in the future.

  • PDF

Searching Algorithms Implementation and Comparison of Romania Problem

  • Ismail. A. Humied
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.105-110
    • /
    • 2024
  • Nowadays, permutation problems with large state spaces and the path to solution is irrelevant such as N-Queens problem has the same general property for many important applications such as integrated-circuit design, factory-floor layout, job-shop scheduling, automatic programming, telecommunications network optimization, vehicle routing, and portfolio management. Therefore, methods which are able to find a solution are very important. Genetic algorithm (GA) is one the most well-known methods for solving N-Queens problem and applicable to a wide range of permutation problems. In the absence of specialized solution for a particular problem, genetic algorithm would be efficient. But holism and random choices cause problem for genetic algorithm in searching large state spaces. So, the efficiency of this algorithm would be demoted when the size of state space of the problem grows exponentially. In this paper, the new method presented based on genetic algorithm to cover this weakness. This new method is trying to provide partial view for genetic algorithm by locally searching the state space. This may cause genetic algorithm to take shorter steps toward the solution. To find the first solution and other solutions in N-Queens problem using proposed method: dividing N-Queens problem into subproblems, which configuring initial population of genetic algorithm. The proposed method is evaluated and compares it with two similar methods that indicate the amount of performance improvement.

A New Approach for Image Encryption Based on Cyclic Rotations and Multiple Blockwise Diffusions Using Pomeau-Manneville and Sin Maps

  • Hanchinamani, Gururaj;Kulakarni, Linganagouda
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.4
    • /
    • pp.187-198
    • /
    • 2014
  • In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on $M{\times}N$ chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of $8{\times}8$ pixels, block of $16{\times}16$ pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

A Study on the Comparison between E-MDR and D-MDR in Continuous Data (연속형 데이터에서 E-MDR과 D-MDR방법 비교)

  • Lee, Jea-Young;Lee, Ho-Guen
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.4
    • /
    • pp.579-586
    • /
    • 2009
  • We have used multifactor dimensionality reduction(MDR) method to study interaction effect of statistical model in general. But MDR method cannot be applied in all cases. It can be applied to the only case-control data. So, two methods are suggested E-MDR and D-MDR method using regression tree algorithm and dummy variables. We applied the methods on the identify interaction effects of single nucleotide polymorphisms(SNPs) responsible for longissimus mulcle dorsi area(LMA), carcass cold weight(CWT) and average daily gain(ADG) in a Hanwoo beef cattle population. Finally, we compare the results using permutation test.

Order-Restricted Inference with Linear Rank Statistics in Microarray Data

  • Kang, Moon-Su
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.1
    • /
    • pp.137-143
    • /
    • 2011
  • The classification of subjects with unknown distribution in a small sample size often involves order-restricted constraints in multivariate parameter setups. Those problems make the optimality of a conventional likelihood ratio based statistical inferences not feasible. Fortunately, Roy (1953) introduced union-intersection principle(UIP) which provides an alternative avenue. Multivariate linear rank statistics along with that principle, yield a considerably appropriate robust testing procedure. Furthermore, conditionally distribution-free test based upon exact permutation theory is used to generate p-values, even in a small sample. Applications of this method are illustrated in a real microarray data example (Lobenhofer et al., 2002).