Search results for "probability"
showing 10 items of 3417 documents
Long read alignment based on maximal exact match seeds
2012
Abstract Motivation: The explosive growth of next-generation sequencing datasets poses a challenge to the mapping of reads to reference genomes in terms of alignment quality and execution speed. With the continuing progress of high-throughput sequencing technologies, read length is constantly increasing and many existing aligners are becoming inefficient as generated reads grow larger. Results: We present CUSHAW2, a parallelized, accurate, and memory-efficient long read aligner. Our aligner is based on the seed-and-extend approach and uses maximal exact matches as seeds to find gapped alignments. We have evaluated and compared CUSHAW2 to the three other long read aligners BWA-SW, Bowtie2 an…
Likelihood Inference for Gibbs Processes in the Analysis of Spatial Point Patterns
2001
Plusieurs auteurs ont propose des approximations stochastiques et non-stochastiques au MLE pour les processus de Gibbs utilises pour decrire les interactions entre deux points dans une distribution spatiale de points. Cettes approximations sont necessaires a cause de la difficulte en l'evaluation de la constante qui normalise la f.d.p., Cet article present une comparaison, parmi d'un model de Strauss, des methodes qui utilisent des approximations directes aux MLE et des methodes qui utilisent techniques de Monte Carlo de chaine de Markov. Les techniques de simulation utilisees sont le Gibbs sampler et l'algorithm de Metropolis-Hastings.
Dimension reduction for time series in a blind source separation context using r
2021
Funding Information: The work of KN was supported by the CRoNoS COST Action IC1408 and the Austrian Science Fund P31881-N32. The work of ST was supported by the CRoNoS COST Action IC1408. The work of JV was supported by Academy of Finland (grant 321883). We would like to thank the anonymous reviewers for their comments which improved the paper and package considerably. Publisher Copyright: © 2021, American Statistical Association. All rights reserved. Multivariate time series observations are increasingly common in multiple fields of science but the complex dependencies of such data often translate into intractable models with large number of parameters. An alternative is given by first red…
A Bayesian analysis of a queueing system with unlimited service
1997
Abstract A queueing system occurs when “customers” arrive at some facility requiring a certain type of “service” provided by the “servers”. Both the arrival pattern and the service requirements are usually taken to be random. If all the servers are busy when customers arrive, they usually wait in line to get served. Queues possess a number of mathematical challenges and have been mainly approached from a probability point of view, and statistical analysis are very scarce. In this paper we present a Bayesian analysis of a Markovian queue in which customers are immediately served upon arrival, and hence no waiting lines form. Emergency and self-service facilities provide many examples. Techni…
The 1970 US Draft Lottery Revisited: A Spatial Analysis
2004
Summary We revise the result of the 1970 selective service draft lottery in the USA following an open question that was suggested by Fienberg in a paper published in Science in 1971. The result of the drawings can be viewed as a particular spatial pattern which can be analysed by using general spatial tools adapted to our context. Approaches for assessing the complete spatial randomness for this spatial process on a finite support are proposed. More specifically, these approaches involve the number of events in a square window and a k(r)-based function used to analyse stationary spatial point processes.
DRUDIT: Web-based DRUgs DIscovery Tools to design small molecules as modulators of biological targets
2019
Abstract Motivation New in silico tools to predict biological affinities for input structures are presented. The tools are implemented in the DRUDIT (DRUgs DIscovery Tools) web service. The DRUDIT biological finder module is based on molecular descriptors that are calculated by the MOLDESTO (MOLecular DEScriptors TOol) software module developed by the same authors, which is able to calculate more than one thousand molecular descriptors. At this stage, DRUDIT includes 250 biological targets, but new external targets can be added. This feature extends the application scope of DRUDIT to several fields. Moreover, two more functions are implemented: the multi- and on/off-target tasks. These tool…
TESF Methodology for Statistics Education Improvement
2010
The need for universities to achieve excellence in the services they provide has been the subject of research for several decades. The idea of involving students and recognizing the importance of their opinions has led to the creation of various models and tools. This paper focuses on teaching, a central service from which improvement actions of an academic institution should always begin. The article reviews and updates the previously developed Teaching Experiments and Student Feedback methodology. The methodology, which is primarily addressed to statistics teachers, allows practical aspects to be organized and decisions to be made based on data that has been collected from students and sc…
Stochastic labelling of biological images
1998
Many hypotheses made by experimental researchers can be formulated as a stochastic labelling of a given image. Some stochastic labelling methods for random closed sets are proposed in this paper. Molchanov (I. Molchanov, 1984, Theor. Probability and Math. Statist.29, 113–119) provided the probabilistic background for this problem. However, there is a lack of specific labelling models. Ayala and Simo (G. Ayala and A. Simo, 1995, Advances in Applied Probability27, 293–305) proposed a method in which, given the whole set of connected components, every component is classified in a certain phase or category in a completely random way. Alternative methods are necessary in case the random labellin…
Investigation of Simulated Trading — A multi agent based trading system for optimization purposes
2010
Abstract Some years ago, Bachem, Hochstattler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed rule set, the financial market creates a buy-and-sell graph for the various orders in the order book, intending to optimize the overall system. Here I present a thorough investigation for the application of this algorithm to the traveling salesman problem.
A tabu search algorithm for assigning teachers to courses
2002
In this paper we deal with the problem of assigning teachers to courses in a secondary school. The problem appears when a timetable is to be built and the teaching assignments are not fixed. We have developed a tabu search algorithm to solve the problem. The parameters involved in the algorithm have been estimated by using multiple regression techniques. The computational results, obtained on a set of Spanish secondary schools, show that the solutions obtained by this automatic procedure can be favourably compared with the solutions proposed by the experts.