Search results for "Abstract data type"
showing 10 items of 1140 documents
On a set of data for the membrane potential in a neuron
2006
We consider a set of data where the membrane potential in a pyramidal neuron is measured almost continuously in time, under varying experimental conditions. We use nonparametric estimates for the diffusion coefficient and the drift in view to contribute to the discussion which type of diffusion process is suitable to model the membrane potential in a neuron (more exactly: in a particular type of neuron under particular experimental conditions).
Gabor-like systems in ${cal L}^2({bf R}^d)$ and extensions to wavelets
2008
In this paper we show how to construct a certain class of orthonormal bases in starting from one or more Gabor orthonormal bases in . Each such basis can be obtained acting on a single function with a set of unitary operators which operate as translation and modulation operators in suitable variables. The same procedure is also extended to frames and wavelets. Many examples are discussed.
Analysis of the renal transplant waiting list in the País Valencià (Spain).
2005
In this paper we analyse the renal transplant waiting list of the Pais Valencia in Spain, using Queueing theory. The customers of this queue are patients with end-stage renal failure waiting for a kidney transplant. We set up a simplified model to represent the flow of the customers through the system, and perform Bayesian inference to estimate parameters in the model. Finally, we consider several scenarios by tuning the estimations achieved and computationally simulate the behaviour of the queue under each one. The results indicate that the system could reach equilibrium at some point in the future and the model forecasts a slow decrease in the size of the waiting list in the short and mid…
Iterative Cluster Analysis of Protein Interaction Data
2004
Abstract Motivation: Generation of fast tools of hierarchical clustering to be applied when distances among elements of a set are constrained, causing frequent distance ties, as happens in protein interaction data. Results: We present in this work the program UVCLUSTER, that iteratively explores distance datasets using hierarchical clustering. Once the user selects a group of proteins, UVCLUSTER converts the set of primary distances among them (i.e. the minimum number of steps, or interactions, required to connect two proteins) into secondary distances that measure the strength of the connection between each pair of proteins when the interactions for all the proteins in the group are consid…
Multiple sequence editing by spreadsheet.
1990
Spreadsheets have several functions and facilities that make them good candidates to be used as multiple sequence editors. They can be easily programmed (even by non-programmers) with macros that allow them to fit the needs of the user, free of the restrictions that programs written by other people have. Here I present a sheet containing a set of macros written for Lotus 1-2-3
The Power of Word-Frequency Based Alignment-Free Functions: a Comprehensive Large-Scale Experimental Analysis
2021
Abstract Motivation Alignment-free (AF) distance/similarity functions are a key tool for sequence analysis. Experimental studies on real datasets abound and, to some extent, there are also studies regarding their control of false positive rate (Type I error). However, assessment of their power, i.e. their ability to identify true similarity, has been limited to some members of the D2 family. The corresponding experimental studies have concentrated on short sequences, a scenario no longer adequate for current applications, where sequence lengths may vary considerably. Such a State of the Art is methodologically problematic, since information regarding a key feature such as power is either mi…
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.
Overlap and diversity in antimicrobial peptide databases: Compiling a non-redundant set of sequences
2015
Abstract Motivation: The large variety of antimicrobial peptide (AMP) databases developed to date are characterized by a substantial overlap of data and similarity of sequences. Our goals are to analyze the levels of redundancy for all available AMP databases and use this information to build a new non-redundant sequence database. For this purpose, a new software tool is introduced. Results: A comparative study of 25 AMP databases reveals the overlap and diversity among them and the internal diversity within each database. The overlap analysis shows that only one database (Peptaibol) contains exclusive data, not present in any other, whereas all sequences in the LAMP_Patent database are inc…