scholarly journals P nucleotides in V(D)J recombination: a fine-structure analysis.

1993 ◽  
Vol 13 (2) ◽  
pp. 1078-1092 ◽  
Author(s):  
J T Meier ◽  
S M Lewis
Keyword(s):  
Fine Structure ◽  
Germ Line ◽  
Statistical Tests ◽  
Random Sequence ◽  
Genetic Locus ◽  
Gene Segment ◽  
Lymphoid Cells ◽  
Base Pairs ◽  
Nucleotide Data ◽  
Selection Of

Antigen receptor genes acquire junctional inserts upon assembly from their component, germ line-encoded V, D, and J segments. Inserts are generally of random sequence, but a small number of V-D, D-J, or V-J junctions are exceptional. In such junctions, one or two added base pairs inversely repeat the sequence of the abutting germ line DNA. (For example, a gene segment ending AG might acquire an insert beginning with the residues CT upon joining). It has been proposed that the nonrandom residues, termed "P nucleotides," are a consequence of an obligatory end-modification step in V(D)J recombination. P insertion in normal, unselected V(D)J joining products, however, has not been rigorously established. Here, we use an experimentally manipulable system, isolated from immune selection of any kind, to examine the fine structure of V(D)J junctions formed in wild-type lymphoid cells. Our results, according to statistical tests, show the following, (i) The frequency of P insertion is influenced by the DNA sequence of the joined ends. (ii) P inserts may be longer than two residues in length. (iii) P inserts are associated with coding ends only. Additionally, a systematic survey of published P nucleotide data shows no evidence for variation in P insertion as a function of genetic locus and ontogeny. Together, these analyses establish the generality of the P nucleotide pattern within inserts but do not fully support previous conjectures as to their origin and centrality in the joining reaction.

P nucleotides in V(D)J recombination: a fine-structure analysis

1993 ◽  
Vol 13 (2) ◽  
pp. 1078-1092
Author(s):  
J T Meier ◽  
S M Lewis
Keyword(s):  
Fine Structure ◽  
Germ Line ◽  
Statistical Tests ◽  
Random Sequence ◽  
Genetic Locus ◽  
Gene Segment ◽  
Lymphoid Cells ◽  
Base Pairs ◽  
Nucleotide Data ◽  
Selection Of

Antigen receptor genes acquire junctional inserts upon assembly from their component, germ line-encoded V, D, and J segments. Inserts are generally of random sequence, but a small number of V-D, D-J, or V-J junctions are exceptional. In such junctions, one or two added base pairs inversely repeat the sequence of the abutting germ line DNA. (For example, a gene segment ending AG might acquire an insert beginning with the residues CT upon joining). It has been proposed that the nonrandom residues, termed "P nucleotides," are a consequence of an obligatory end-modification step in V(D)J recombination. P insertion in normal, unselected V(D)J joining products, however, has not been rigorously established. Here, we use an experimentally manipulable system, isolated from immune selection of any kind, to examine the fine structure of V(D)J junctions formed in wild-type lymphoid cells. Our results, according to statistical tests, show the following, (i) The frequency of P insertion is influenced by the DNA sequence of the joined ends. (ii) P inserts may be longer than two residues in length. (iii) P inserts are associated with coding ends only. Additionally, a systematic survey of published P nucleotide data shows no evidence for variation in P insertion as a function of genetic locus and ontogeny. Together, these analyses establish the generality of the P nucleotide pattern within inserts but do not fully support previous conjectures as to their origin and centrality in the joining reaction.

scholarly journals New Statistical Randomness Tests Based on Length of Runs

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Ali Doğanaksoy ◽  
Fatih Sulak ◽  
Muhiddin Uğuz ◽  
Okan Şeker ◽  
Ziya Akcengiz
Keyword(s):  
Statistical Tests ◽  
Random Sequence ◽  
Cryptographic Protocols ◽  
Experimental Results ◽  
Security Evaluation ◽  
Random Numbers ◽  
Statistical Distributions ◽  
Cryptographic Algorithm ◽  
Encryption Algorithms ◽  
Randomness Tests

Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic protocols depend on random values. Randomness is measured by statistical tests and hence security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this work we focus on statistical distributions of runs of lengths one, two, and three. Using these distributions we state three new statistical randomness tests. New tests useχ2distribution and, therefore, exact values of probabilities are needed. Probabilities associated runs of lengths one, two, and three are stated. Corresponding probabilities are divided into five subintervals of equal probabilities. Accordingly, three new statistical tests are defined and pseudocodes for these new statistical tests are given. New statistical tests are designed to detect the deviations in the number of runs of various lengths from a random sequence. Together with some other statistical tests, we analyse our tests’ results on outputs of well-known encryption algorithms and on binary expansions ofe,π, and2. Experimental results show the performance and sensitivity of our tests.

Preventive maintenance scheduling using analysis of variance-based ant lion optimizer

2018 ◽  
Vol 15 (2) ◽  
pp. 254-272 ◽  
Author(s):  
Umamaheswari Elango ◽  
Ganesan Sivarajan ◽  
Abirami Manoharan ◽  
Subramanian Srikrishna
Keyword(s):  
Analysis Of Variance ◽  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Statistical Tests ◽  
Population Based ◽  
Maintenance Scheduling ◽  
Content Type ◽  
Ant Lion Optimizer ◽  
Ant Lion ◽  
Selection Of

Purpose Generator maintenance scheduling (GMS) is an essential task for electric power utilities as the periodical maintenance activity enhances the lifetime and also ensures the reliable and continuous operation of generating units. Though numerous meta-heuristic algorithms have been reported for the GMS solution, enhancing the existing techniques or developing new optimization procedure is still an interesting research task. The meta-heuristic algorithms are population based and the selection of their algorithmic parameters influences the quality of the solution. This paper aims to propose statistical tests guided meta-heuristic algorithm for solving the GMS problems. Design/methodology/approach The intricacy characteristics of the GMS problem in power systems necessitate an efficient and robust optimization tool. Though several meta-heuristic algorithms have been applied to solve the chosen power system operational problem, tuning of their control parameters is a protracting process. To prevail over the previously mentioned drawback, the modern meta-heuristic algorithm, namely, ant lion optimizer (ALO), is chosen as the optimization tool for solving the GMS problem. Findings The meta-heuristic algorithms are population based and require proper selection of algorithmic parameters. In this work, the ANOVA (analysis of variance) tool is proposed for selecting the most feasible decisive parameters in algorithm domain, and the statistical tests-based validation of solution quality is described. The parametric and non-parametric statistical tests are also performed to validate the selection of ALO against the various competing algorithms. The numerical and statistical results confirm that ALO is a promising tool for solving the GMS problems. Originality/value As a first attempt, ALO is applied to solve the GMS problem. Moreover, the ANOVA-based parameter selection is proposed and the statistical tests such as Wilcoxon signed rank and one-way ANOVA are conducted to validate the applicability of the intended optimization tool. The contribution of the paper can be summarized in two folds: the ANOVA-based ALO for GMS applications and statistical tests-based performance evaluation of intended algorithm.

Practical biomedical statistics: A guide to the selection of statistical tests

Urology ◽  
1996 ◽  
Vol 47 (1) ◽  
pp. 2-13 ◽  
Author(s):  
J. Stuart Wolf ◽  
Deborah S. Smith
Keyword(s):  
Statistical Tests ◽  
Biomedical Statistics ◽  
Selection Of

Practical R for biologists: an introduction

2021 ◽  
Keyword(s):  
Statistical Tests ◽  
Statistical Modelling ◽  
Biological Data ◽  
Early Years ◽  
Main Text ◽  
Biological Data Analysis ◽  
Base Functions ◽  
Almost All ◽  
Selection Of ◽  
R Functions

Abstract R is an open-source statistical environment modelled after the previously widely used commercial programs S and S-Plus, but in addition to powerful statistical analysis tools, it also provides powerful graphics outputs. In addition to its statistical and graphical capabilities, R is a programming language suitable for medium-sized projects. This book presents a set of studies that collectively represent almost all the R operations that beginners, analysing their own data up to perhaps the early years of doing a PhD, need. Although the chapters are organized around topics such as graphing, classical statistical tests, statistical modelling, mapping and text parsing, examples have been chosen based largely on real scientific studies at the appropriate level and within each the use of more R functions is nearly always covered than are simply necessary just to get a p-value or a graph. R comes with around a thousand base functions which are automatically installed when R is downloaded. This book covers the use of those of most relevance to biological data analysis, modelling and graphics. Throughout each chapter, the functions introduced and used in that chapter are summarized in Tool Boxes. The book also shows the user how to adapt and write their own code and functions. A selection of base functions relevant to graphics that are not necessarily covered in the main text are described in Appendix 1, and additional housekeeping functions in Appendix 2.

scholarly journals Group 3 innate lymphoid cells mediate intestinal selection of commensal bacteria-specific CD4+ T cells

Science ◽  
2015 ◽  
Vol 348 (6238) ◽  
pp. 1031-1035 ◽  
Author(s):  
M. R. Hepworth ◽  
T. C. Fung ◽  
S. H. Masur ◽  
J. R. Kelsen ◽  
F. M. McConnell ◽  
...  
Keyword(s):  
T Cells ◽  
Cd4 T Cells ◽  
Innate Lymphoid Cells ◽  
Lymphoid Cells ◽  
Commensal Bacteria ◽  
Group 3 ◽  
Selection Of

scholarly journals On the correlation and sensitivity of so far statistical randomness tests based on runs

2022 ◽  
Vol 2 (14) ◽  
pp. 55-65
Author(s):  
Hoang Dinh Linh ◽  
Do Dai Chi ◽  
Nguyen Tuan Anh ◽  
Le Thao Uyen
Keyword(s):  
Statistical Tests ◽  
Random Sequence ◽  
Random Numbers ◽  
Expected Number ◽  
Cryptographic Primitives ◽  
Pearson Coefficient ◽  
Strong Linear Correlation ◽  
Cryptographic Algorithms ◽  
Coefficient Method ◽  
Randomness Tests

Abstract—Random numbers play a very important role in cryptography. More precisely, almost cryptographic primitives are ensured their security based on random values such as random key, nonces, salts... Therefore, the assessment of randomness according to statistical tests is really essential for measuring the security of cryptographic algorithms. In this paper, we focus on so far randomness tests based on runs in the literature. First, we have proved in detail that the expected number of gaps (or blocks) of length  in a random sequence of length  is . Secondly, we have evaluated correlation of some tests based on runs so far using Pearson coefficient method [5, 6] and Fail-Fail ratio one [7, 8]. Surprisingly, the Pearson coefficient method do not show any strong linear correlation of these runs-based tests but the Fail-Fail ratio do. Then, we have considered the sensitivity of these runs tests with some basic transformations. Finally, we have proposed some new runs tests based on the sensitivity results and applied evaluations to some random sources. Tóm tắt—Số ngẫu nhiên đóng một vai trò quan trọng trong mật mã. Cụ thể, độ an toàn của hầu hết các nguyên thủy mật mã đều được đảm bảo dựa trên các giá trị ngẫu nhiên như khóa, nonce, salt… Do đó, việc đánh giá tính ngẫu nhiên dựa trên các kiểm tra thống kê là thực sự cần thiết để đo độ an toàn cho các thuật toán mật mã. Trong bài báo này, chúng tôi tập trung vào các kiểm tra ngẫu nhiên dựa vào run trong các tài liệu. Đầu tiên, chúng tôi chứng minh chi tiết rằng kỳ vọng số các gap (khối) độ dài  trong một chuỗi ngẫu nhiên độ dài  là . Sau đó, chúng tôi đánh giá mối tương quan của một số kiểm tra dựa vào run bằng phương pháp hệ số Pearson [5, 6] và tỷ số Fail-Fail  [7, 8]. Đáng ngạc nhiên là phương pháp hệ số Pearson không cho thấy bất kỳ mối tương quan tuyến tính mạnh nào của các kiểm tra dựa vào run, trong khi đó tỷ số Fail-Fail lại chỉ ra. Tiếp theo, chúng tôi xem xét độ nhạy của các kiểm tra run này với một số phép biến đổi cơ bản. Cuối cùng, chúng tôi đề xuất một số kiểm tra run mới dựa trên các kết quả độ nhạy và đánh giá áp dụng chúng cho một số nguồn ngẫu nhiên.

scholarly journals Data Size Requirement for Forecasting Daily Crude Oil Price with Neural Networks

2019 ◽  
Vol 66 (3) ◽  
pp. 363-388
Author(s):  
Serkan Aras ◽  
Manel Hamdi
Keyword(s):  
Neural Networks ◽  
Crude Oil ◽  
Significant Interaction ◽  
Statistical Tests ◽  
Oil Price ◽  
Training Data ◽  
Forecasting Model ◽  
Crude Oil Price ◽  
Crude Oil Prices ◽  
Selection Of

When the literature regarding applications of neural networks is investigated, it appears that a substantial issue is what size the training data should be when modelling a time series through neural networks. The aim of this paper is to determine the size of training data to be used to construct a forecasting model via a multiple-breakpoint test and compare its performance with two general methods, namely, using all available data and using just two years of data. Furthermore, the importance of the selection of the final neural network model is investigated in detail. The results obtained from daily crude oil prices indicate that the data from the last structural change lead to simpler architectures of neural networks and have an advantage in reaching more accurate forecasts in terms of MAE value. In addition, the statistical tests show that there is a statistically significant interaction between data size and stopping rule.

scholarly journals Immunoglobulin gene rearrangements in normal mouse B cells

1982 ◽  
Vol 2 (7) ◽  
pp. 829-836
Author(s):  
P Early ◽  
C Nottenburg ◽  
I Weissman ◽  
L Hood
Keyword(s):  
B Cells ◽  
Heavy Chain ◽  
Germ Line ◽  
Gene Segment ◽  
Immunoglobulin M ◽  
Chain Gene ◽  
Allelic Exclusion ◽  
Immunoglobulin Gene ◽  
Spleen Cells ◽  
Surface Immunoglobulin

We have analyzed the structure of rearranged mu heavy-chain genes obtained from the genomic DNA of normal BALB/c mouse spleen cells expressing surface immunoglobulin M. Examples were found of two types of nonproductive rearrangements, which may be responsible for allelic exclusion in normal B cells. In one of these rearrangements, a germ line D gene segment has joined to the JH4 gene segment but no V/D joining has occurred. We present evidence that D gene segments lie as a cluster between V and J gene segments in the germ line. A comparison of conserved sequences in V and D gene segments suggests that the D gene segments, which are found only in the heavy-chain gene family, may have evolved from V gene segments similar to the Vk family.

Sign in / Sign up

Export Citation Format

Share Document