Probability of a recombinant inbred diploid plant for two linked genes

2007 ◽  
Vol 87 (3) ◽  
pp. 489-492
Author(s):  
Theodore C Helms
Keyword(s):  
Efficient Method ◽  
Genetic Linkage ◽  
Genetic Recombination ◽  
Tabular Form ◽  
Diploid Plant ◽  
Plant Breeder ◽  
Numerical Examples ◽  
Probability Of Success ◽  
Minimum Number ◽  
Desirable Trait

For some discreet traits, breeders may need to break genetic linkage between a desirable trait and an undesirable trait. Breeders need to be able to determine the minimum number of plants to grow to have a specified probability of identifying at least one plant that is recombinant between two linked loci. Since 1931, recurrence equations have been available to determine the genotypic frequencies of each genotype when two loci are linked as the level of inbreeding changes. However, these genotypic frequencies have not been published in a tabular form that would be helpful to the applied plant breeder. The objectives are to: (1) provide genotypic proportions as the intensity of linkage and the level of inbreeding increases; (2) determine the most efficient method of identifying a homozygous recombinant genotype as the level of inbreeding and linkage intensity are varied. Numerical examples and formula are provided to determine the number of plants that must be grown to have a given probability of success of identifying a specified number of recombinant types. For close linkage, the number of plants that must be genotyped is greatly decreased by waiting until the population is highly inbred. Key words: Genetic recombination, inbreeding

scholarly journals Thiolation of Biopolymers for Developing Drug Delivery Systems with Enhanced Mechanical and Mucoadhesive Properties: A Review

Polymers ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1803
Author(s):  
Vivek Puri ◽  
Ameya Sharma ◽  
Pradeep Kumar ◽  
Inderbir Singh
Keyword(s):  
Mechanical Properties ◽  
Drug Delivery ◽  
Efficient Method ◽  
Drug Delivery Systems ◽  
Delivery Systems ◽  
Review Article ◽  
Present Review ◽  
Tabular Form ◽  
Thiolated Polymers ◽  
Drug Delivery Applications

Biopolymers are extensively used for developing drug delivery systems as they are easily available, economical, readily modified, nontoxic, biodegradable and biocompatible. Thiolation is a well reported approach for enhancing mucoadhesive and mechanical properties of polymers. In the present review article, for the modification of biopolymers different thiolation methods and evaluation/characterization techniques have been discussed in detail. Reported literature on thiolated biopolymers with enhanced mechanical and mucoadhesive properties has been presented conspicuously in text as well as in tabular form. Patents filed by researchers on thiolated polymers have also been presented. In conclusion, thiolation is an easily reproducible and efficient method for customization of mucoadhesive and mechanical properties of biopolymers for drug delivery applications.

A Study of Association Rules Mining Algorithms Based on Adaptive Support

2010 ◽  
Vol 108-111 ◽  
pp. 436-440
Author(s):  
Yue Shun He ◽  
Ping Du
Keyword(s):  
Association Rules ◽  
Efficient Method ◽  
User Needs ◽  
Association Rules Mining ◽  
Minimum Support ◽  
The Core ◽  
Minimum Number ◽  
Adaptive Support ◽  
Mining Algorithms ◽  
Specific Number

This paper presents an adaptive support for Boolean algorithm for mining association rules, the Algorithm does not require minimum support from outside, in the mining process of the algorithm will be based on user needs the minimum number of rules automatically adjust the scope of support to produce the specific number of rules, the algorithm number of rules for the user needs to generate the rules to a certain extent, reduce excavation time, avoid the artificial blindness specified minimum support. In addition, the core of the algorithm is using an efficient method of Boolean-type mining, using the logical OR, AND, and XOR operations to generate association rules, to avoided the candidate itemsets generated In the mining process, and only need to scan the database once, so the algorithm has a certain efficiency.

scholarly journals Recommendation systems with the quantum k–NN and Grover algorithms for data processing

2019 ◽  
Vol 29 (1) ◽  
pp. 139-150
Author(s):  
Marek Sawerwain ◽  
Marek Wróblewski
Keyword(s):  
Computational Complexity ◽  
Data Processing ◽  
Algebraic Equation ◽  
Recommendation System ◽  
Quantum Circuit ◽  
Specific Element ◽  
Grover Algorithm ◽  
Numerical Examples ◽  
Nearest Neighbours ◽  
Probability Of Success

Abstract In this article, we discuss the implementation of a quantum recommendation system that uses a quantum variant of the k-nearest neighbours algorithm and the Grover algorithm to search for a specific element in an unstructured database. In addition to the presentation of the recommendation system as an algorithm, the article also shows the main steps in construction of a suitable quantum circuit for realisation of a given recommendation system. The computational complexity of individual calculation steps in the recommendation system is also indicated. The verification of the correctness of the proposed system is analysed as well, indicating an algebraic equation describing the probability of success of the recommendation. The article also shows numerical examples presenting the behaviour of the recommendation system for two selected cases.

A Highly Accurate and Computationally Efficient Method for Predicting RAIM Holes

2005 ◽  
Vol 59 (1) ◽  
pp. 105-117 ◽  
Author(s):  
Shaojun Feng ◽  
Washington Y. Ochieng ◽  
David Walsh ◽  
Rigas Ioannides
Keyword(s):  
Efficient Method ◽  
Current Approach ◽  
Computationally Efficient ◽  
Satellite Navigation System ◽  
Computational Load ◽  
Temporal Sampling ◽  
Minimum Number ◽  
Receiver Autonomous Integrity Monitoring ◽  
Search Approach ◽  
Grid Based

Receiver Autonomous Integrity Monitoring (RAIM) is a method implemented within the receiver to protect users against satellite navigation system failures. For a receiver to execute a RAIM calculation, two conditions must be met: a minimum number of satellites and adequate satellite geometry. The non-existence of the minimum number of satellites (five) is referred to as a RAIM hole. Current regional and global RAIM availability studies use spatial (grid-based) and temporal sampling intervals driven by a trade-off between accuracy and computation workload. The implication of minimising computational load is that accuracy is compromised and potential RAIM holes remain un-sampled, with potential risk to safety. This paper proposes a direct and computationally efficient method (as opposed to the grid-based search approach) to predict RAIM holes. The method is based on the precise computation of satellite coverage (footprint) boundaries, the intersection points and analysis of the topology of the regions of intersection. Test results show that the proposed method is highly accurate and requires minimal computational load compared to the current approach.

scholarly journals Best Information is Most Successful

2019 ◽  
pp. 49-79 ◽  
Author(s):  
Eloi De Chérisey ◽  
Sylvain Guilley ◽  
Olivier Rioul ◽  
Pablo Piantanida
Keyword(s):  
Mutual Information ◽  
Success Rate ◽  
Signal To Noise Ratio ◽  
Additive White Gaussian Noise ◽  
Side Channel ◽  
Secret Key ◽  
Information Theoretic ◽  
Leakage Model ◽  
Probability Of Success ◽  
Minimum Number

Using information-theoretic tools, this paper establishes a mathematical link between the probability of success of a side-channel attack and the minimum number of queries to reach a given success rate, valid for any possible distinguishing rule and with the best possible knowledge on the attacker’s side. This link is a lower bound on the number of queries highly depends on Shannon’s mutual information between the traces and the secret key. This leads us to derive upper bounds on the mutual information that are as tight as possible and can be easily calculated. It turns out that, in the case of an additive white Gaussian noise, the bound on the probability of success of any attack is directly related to the signal to noise ratio. This leads to very easy computations and predictions of the success rate in any leakage model.

scholarly journals Modeling interference in genetic recombination.

Genetics ◽  
1995 ◽  
Vol 139 (2) ◽  
pp. 1031-1044 ◽  
Author(s):  
M S McPeek ◽  
T P Speed
Keyword(s):  
Point Process ◽  
Genetic Linkage ◽  
Genetic Recombination ◽  
Poisson Model ◽  
Process Models ◽  
Linkage Data ◽  
Biologically Inspired ◽  
Method Of Maximum Likelihood ◽  
Point Process Models ◽  
Genetic Linkage Data

Abstract In analyzing genetic linkage data it is common to assume that the locations of crossovers along a chromosome follow a Poisson process, whereas it has long been known that this assumption does not fit the data. In many organisms it appears that the presence of a crossover inhibits the formation of another nearby, a phenomenon known as "interference." We discuss several point process models for recombination that incorporate position interference but assume no chromatid interference. Using stochastic simulation, we are able to fit the models to a multilocus Drosophila dataset by the method of maximum likelihood. We find that some biologically inspired point process models incorporating one or two additional parameters provide a dramatically better fit to the data than the usual "no-interference" Poisson model.

scholarly journals On the Approximate Solution of Partial Integro-Differential Equations Using the Pseudospectral Method Based on Chebyshev Cardinal Functions

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 286
Author(s):  
Fairouz Tchier ◽  
Ioannis Dassios ◽  
Ferdous Tawfiq ◽  
Lakhdar Ragoub
Keyword(s):  
Approximate Solution ◽  
Differential Equations ◽  
Convergence Analysis ◽  
Efficient Method ◽  
Pseudospectral Method ◽  
Numerical Examples ◽  
Expansion Coefficients ◽  
Cardinal Functions ◽  
Theoretical Results ◽  
Chebyshev Functions

In this paper, we apply the pseudospectral method based on the Chebyshev cardinal function to solve the parabolic partial integro-differential equations (PIDEs). Since these equations play a key role in mathematics, physics, and engineering, finding an appropriate solution is important. We use an efficient method to solve PIDEs, especially for the integral part. Unlike when using Chebyshev functions, when using Chebyshev cardinal functions it is no longer necessary to integrate to find expansion coefficients of a given function. This reduces the computation. The convergence analysis is investigated and some numerical examples guarantee our theoretical results. We compare the presented method with others. The results confirm the efficiency and accuracy of the method.

A New Numerical Scheme for the Space Fractional Diffusion Equation

2014 ◽  
Vol 599-601 ◽  
pp. 1305-1308 ◽  
Author(s):  
Jun Ying Cao ◽  
Zi Qiang Wang
Keyword(s):  
Finite Element Method ◽  
Finite Element ◽  
Finite Difference ◽  
Diffusion Equation ◽  
Efficient Method ◽  
Numerical Scheme ◽  
Fractional Diffusion ◽  
Fractional Diffusion Equation ◽  
Numerical Examples ◽  
Space Fractional Diffusion Equation

We construct the numerical method of the space fractional diffusion equation in this paper. We propose an efficient method for its numerical solution. This method is based on a finite difference in time and finite element method in space. Convergence of the method is rigorously established. A series of numerical examples are provided to support the theoretical claims.

scholarly journals Generalized Refinement of Gauss-Seidel Method for Consistently Ordered 2-Cyclic Matrices

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Gashaye Dessalew ◽  
Tesfaye Kebede ◽  
Gurju Awgichew ◽  
Assaye Walelign
Keyword(s):  
Differential Equation ◽  
Finite Difference ◽  
Finite Difference Method ◽  
Rate Of Convergence ◽  
Difference Method ◽  
Linear Equations ◽  
System Of Linear Equations ◽  
Numerical Examples ◽  
Seidel Method ◽  
Minimum Number

This paper presents generalized refinement of Gauss-Seidel method of solving system of linear equations by considering consistently ordered 2-cyclic matrices. Consistently ordered 2-cyclic matrices are obtained while finite difference method is applied to solve differential equation. Suitable theorems are introduced to verify the convergence of this proposed method. To observe the effectiveness of this method, few numerical examples are given. The study points out that, using the generalized refinement of Gauss-Seidel method, we obtain a solution of a problem with a minimum number of iteration and obtain a greater rate of convergence than other previous methods.

Sign in / Sign up

Export Citation Format

Share Document