Data size sufficiency analyses of haplotype inference algortihms

We present experimental and theoretical analyses of data requirements for haplotype inference algorithms. Our experiments include a broad range of problem sizes under two standard models of tree distribution and were designed to yield statistically robust results despite the size of the sample space. Our results validate Gusfield's conjecture that a population size of n log n is required to give (with high probability) sufficient information to deduce the n haplotypes and their complete evolutionary history. The experimental results inspired our experimental finding with theoretical bounds on the population size. We also analyze the population size required to deduce some fixed fraction of the evolutionary history of a set of n haplotypes and establish linear bounds on the required sample size. These linear bounds are also shown theoretically.

Coupling and monotonicity of queueing processes

The main purpose of this work is to give a survey of main monotonicity properties of queueing processes based on the coupling method. The literature on this topic is quite extensive, and we do not consider all aspects of this topic. Our more concrete goal is to select the most interesting basic monotonicity results and give simple and elegant proofs. Also we give a few new (or revised) proofs of a few important monotonicity properties for the queue-size and workload processes both in single-server and multi- server systems. The paper is organized as follows. In Section 1, the basic notions and results on coupling method are given. Section 2 contains known coupling results for renewal processes with focus on construction of synchronized renewal instants for a superposition of independent renewal processes. In Section 3, we present basic monotonicity results for the queue-size and workload processes. We consider both discrete-and continuous-time queueing systems with single and multi servers. Less known results on monotonicity of queueing processes with dependent service times and interarrival times are also presented. Section 4 is devoted to monotonicity of general Jackson-type queueing networks with Markovian routing. This section is based on the notable paper [17]. Finally, Section 5 contains elements of stability analysis of regenerative queues and networks, where coupling and monotonicity results play a crucial role to establish minimal suficient stability conditions. Besides, we present some new monotonicity results for tandem networks.

Generalized multiresolution analyses with given multiplicity functions

Generalized multiresolution analyses are increasing sequences of subspaces of a Hilbert space H that fail to be multiresolution analyses in the sense of wavelet theory because the core subspace does not have an orthonormal basis generated by a fixed scaling function. Previous authors have studied a multiplicity function m which, loosely speaking, measures the failure of the GMRA to be an MRA. When the Hilbert space H is L2(Rn), the possible multiplicity functions have been characterized by Baggett and Merrill. Here we start with a function m satisfying a consistency condition which is known to be necessary, and build a GMRA in an abstract Hilbert space with multiplicity function m.

A general multiserver state-dependent queueing system

The work studies a general multiserver queue in which the service time of an arriving customer and the next interarrival period may depend on both the current waiting time and the server assigned to the arriving customer. Stability of the system is proved under general assumptions on the predetermined distributions describing the model. The proof exploits a combination of the Markov property of the workload process with a regenerative property of the process. The key idea leading to stability is a characterization of the limit behavior of the forward renewal process generated by regenerations. Extensions of the basic model are also studied.

Natural abundance of stable isotopes (15N and 13C) and isotopic fractionation of sea bream muscle as markers of food and culture conditions and its relationship with metabolic and proteomic analyses

Els isòtops estables com a traçadors de la cadena alimentària, s'han utilitzat per caracteritzar la relació entre els consumidors i els seus aliments, ja que el fraccionament isotòpic implica una discriminació en contra de certs isòtops. Però les anàlisis d'isòtops estables (SIA), també es poden dur a terme en peixos cultivats amb dietes artificials, com la orada (Sparus aurata), la especie más cultivada en el Mediterráneo. Canvis en l'abundància natural d'isòtops estables (13C i 15N) en els teixits i les seves reserves poden reflectir els canvis en l'ús i reciclatge dels nutrients ja que els enzims catabòlics implicats en els processos de descarboxilació i desaminació mostren una preferència pels isòtops més lleugers. Per tant, aquestes anàlisis ens poden proporcionar informació útil sobre l'estat nutricional i metabòlic dels peixos. L'objectiu d'aquest projecte va ser determinar la capacitat dels isòtops estables per ser utilitzats com a marcadors potencials de la capacitat de creixement i condicions de cria de l'orada. En aquest sentit, les anàlisis d'isòtops estables s'han combinat amb altres metabòlics (activitats citocrom-c-oxidasa, COX, i citrat sintasa, CS) i els paràmetres de creixement (ARN/ADN). El conjunt de resultats obtinguts en els diferents estudis realitzats en aquest projecte demostra que el SIA, en combinació amb altres paràmetres metabòlics, pot servir com una eina eficaç per discriminar els peixos amb millor potencial de creixement, així com a marcador sensible de l'estat nutricional i d'engreix. D'altra banda, la combinació de l'anàlisi d'isòtops estables amb les eines emergents, com ara tècniques de proteòmica (2D-PAGE), ens proporciona nous coneixements sobre els canvis metabòlics que ocorren en els músculs dels peixos durant l‟increment del creixement muscular induït per l'exercici.

Grain size analyses in tin-lead glazes based on 2d-sections

A problem in the archaeometric classification of Catalan Renaissance pottery is the fact, thatthe clay supply of the pottery workshops was centrally organized by guilds, and thereforeusually all potters of a single production centre produced chemically similar ceramics.However, analysing the glazes of the ware usually a large number of inclusions in the glaze isfound, which reveal technological differences between single workshops. These inclusionshave been used by the potters in order to opacify the transparent glaze and to achieve a whitebackground for further decoration.In order to distinguish different technological preparation procedures of the single workshops,at a Scanning Electron Microscope the chemical composition of those inclusions as well astheir size in the two-dimensional cut is recorded. Based on the latter, a frequency distributionof the apparent diameters is estimated for each sample and type of inclusion.Following an approach by S.D. Wicksell (1925), it is principally possible to transform thedistributions of the apparent 2D-diameters back to those of the true three-dimensional bodies.The applicability of this approach and its practical problems are examined using differentways of kernel density estimation and Monte-Carlo tests of the methodology. Finally, it istested in how far the obtained frequency distributions can be used to classify the pottery

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Precursor uptake assays and metabolic analyses in isolated tomato fruit chromoplasts

Background Carotenoids are the most widespread group of pigments found in nature. In addition to their role in the physiology of the plant, carotenoids also have nutritional relevance as their incorporation in the human diet provides health benefits. In non-photosynthetic tissues, carotenoids are synthesized and stored in specialized plastids called chromoplasts. At present very little is known about the origin of the metabolic precursors and cofactors required to sustain the high rate of carotenoid biosynthesis in these plastids. Recent proteomic data have revealed a number of biochemical and metabolic processes potentially operating in fruit chromoplasts. However, considering that chloroplast to chromoplast differentiation is a very rapid process during fruit ripening, there is the possibility that some of the proteins identified in the proteomic analysis could represent remnants no longer having a functional role in chromoplasts. Therefore, experimental validation is necessary to prove whether these predicted processes are actually operative in chromoplasts. Results A method has been established for high-yield purification of tomato fruit chromoplasts suitable for metabolic studies. Radiolabeled precursors were efficiently incorporated and further metabolized in isolated chromoplast. Analysis of labeled lipophilic compounds has revealed that lipid biosynthesis is a very efficient process in chromoplasts, while the relatively low incorporation levels found in carotenoids suggest that lipid production may represent a competing pathway for carotenoid biosynthesis. Malate and pyruvate are efficiently converted into acetyl-CoA, in agreement with the active operation of the malic enzyme and the pyruvate dehydrogenase complex in the chromoplast. Our results have also shown that isolated chromoplasts can actively sustain anabolic processes without the exogenous supply of ATP, thus suggesting that these organelles may generate this energetic cofactor in an autonomous way. Conclusions We have set up a method for high yield purification of intact tomato fruit chromoplasts suitable for precursor uptake assays and metabolic analyses. Using targeted radiolabeled precursors we have been able to unravel novel biochemical and metabolic aspects related with carotenoid and lipid biosynthesis in tomato fruit chromoplasts. The reported chromoplast system could represent a valuable platform to address the validation and characterization of functional processes predicted from recent transcriptomic and proteomic data.

DnaSP, DNA polymorphism analyses by the coalescent and other methods

DnaSP is a software package for the analysis of DNA polymorphism data. Present version introduces several new modules and features which, among other options allow: (1) handling big data sets (~5 Mb per sequence); (2) conducting a large number of coalescent-based tests by Monte Carlo computer simulations; (3) extensive analyses of the genetic differentiation and gene flow among populations; (4) analysing the evolutionary pattern of preferred and unpreferred codons; (5) generating graphical outputs for an easy visualization of results. Availability: The software package, including complete documentation and examples, is freely available to academic users from: http://www.ub.es/dnasp

Genome-wide DNA polymorphism analyses using VariScan

BACKGROUND: DNA sequence polymorphisms analysis can provide valuable information on the evolutionary forces shaping nucleotide variation, and provides an insight into the functional significance of genomic regions. The recent ongoing genome projects will radically improve our capabilities to detect specific genomic regions shaped by natural selection. Current available methods and software, however, are unsatisfactory for such genome-wide analysis. RESULTS: We have developed methods for the analysis of DNA sequence polymorphisms at the genome-wide scale. These methods, which have been tested on a coalescent-simulated and actual data files from mouse and human, have been implemented in the VariScan software package version 2.0. Additionally, we have also incorporated a graphical-user interface. The main features of this software are: i) exhaustive population-genetic analyses including those based on the coalescent theory; ii) analysis adapted to the shallow data generated by the high-throughput genome projects; iii) use of genome annotations to conduct a comprehensive analyses separately for different functional regions; iv) identification of relevant genomic regions by the sliding-window and wavelet-multiresolution approaches; v) visualization of the results integrated with current genome annotations in commonly available genome browsers. CONCLUSION: VariScan is a powerful and flexible suite of software for the analysis of DNA polymorphisms. The current version implements new algorithms, methods, and capabilities, providing an important tool for an exhaustive exploratory analysis of genome-wide DNA polymorphism data.

Auto- and allopolyploidy in Centaurea sect. Acrocentron s.l. (Asteraceae, Cardueae): karyotype and chromosome banding pattern analyses

Dysploidy and polyploidy are well documented in the large genus Centaurea, especially in sect. Acrocentron and in a small group of species from the Iberian Peninsula described as sect. Chamaecyanus, closely related to Acrocentron. We have explored two interesting cases of polyploid series in both sections: the polyploid series of Centaurea toletana in sect. Chamaecyanus and the series of C. ornata group in sect. Acrocentron. We have carried out a karyological study using both classic karyotype analyses and chromosome banding with fluorochromes.