Allele-specific copy number alteration (ASCNA) analysis is for identifying copy number abnormalities in tumor cells. Unlike normal cells, tumor cells are heterogeneous as a combination of dominant and minor subclones ...
详细信息
Allele-specific copy number alteration (ASCNA) analysis is for identifying copy number abnormalities in tumor cells. Unlike normal cells, tumor cells are heterogeneous as a combination of dominant and minor subclones with distinct copy number profiles. Estimating the clonal proportion and identifying mainclone and subclone genotypes across the genome are important for understanding tumor progression. Several ASCNA tools have recently been developed, but they have been limited to the identification of subclone regions, and not the genotype of subclones. In this article, we propose subHMM, a hidden Markov model-based approach that estimates both subclone region and region-specific subclone genotype and clonal proportion. We specify a hidden state variable representing the conglomeration of clonal genotype and subclone status. We propose a two-step algorithm for parameter estimation, where in the first step, a standard hidden Markov model with this conglomerated state variable is fit. Then, in the second step, region-specific estimates of the clonal proportions are obtained by maximizing region-specific pseudo-likelihoods. We apply subHMM to study renal cell carcinoma datasets in The Cancer Genome Atlas. In addition, we conduct simulation studies that show the good performance of the proposed approach. The R source code is available online at https://***/tools/analysis/subhmm. Expectation-Maximization algorithm;forward-backward algorithm;Somatic copy number alteration;Tumor subclones.
In this paper we propose a new particle smoother that has a computational complexity of O(N), where N is the number of particles. This compares favourably with the O(N-2) computational cost of most smoothers. The new ...
详细信息
In this paper we propose a new particle smoother that has a computational complexity of O(N), where N is the number of particles. This compares favourably with the O(N-2) computational cost of most smoothers. The new method also overcomes some degeneracy problems in existing algorithms. Through simulation studies we show that substantial gains in efficiency are obtained for practical amounts of computational cost. It is shown both through these simulation studies, and by the analysis of an athletics dataset, that our new method also substantially outperforms the simple filter-smoother, the only other smoother with computational cost that is O(N).
Fluorescing molecules (fluorophores) that stochastically switch between photon-emitting and dark states underpin some of the most celebrated advancements in super-resolution microscopy. While this stochastic behavior ...
详细信息
Fluorescing molecules (fluorophores) that stochastically switch between photon-emitting and dark states underpin some of the most celebrated advancements in super-resolution microscopy. While this stochastic behavior has been heavily exploited, full characterization of the underlying models can potentially drive forward further imaging methodologies. Under the assumption that fluorophores move between fluorescing and dark states as continuous time Markov processes, the goal is to use a sequence of images to select a model and estimate the transition rates. We use a hidden Markov model to relate the observed discrete time signal to the hidden continuous time process. With imaging involving several repeat exposures of the fluorophore, we show the observed signal depends on both the current and past states of the hidden process, producing emission probabilities that depend on the transition rate parameters to be estimated. To tackle this unusual coupling of the transition and emission probabilities, we conceive transmission (transition-emission) matrices that capture all dependencies of the model. We provide a scheme of computing these matrices and adapt the forward-backward algorithm to compute a likelihood which is readily optimized to provide rate estimates. When confronted with several model proposals, combining this procedure with the Bayesian Information Criterion provides accurate model selection.
In this paper, we propose a generalized viscosity explicit method for finding zeros of the sum of two accretive operators in the framework of Banach spaces. The strong convergence theorem of such method is proved unde...
详细信息
In this paper, we propose a generalized viscosity explicit method for finding zeros of the sum of two accretive operators in the framework of Banach spaces. The strong convergence theorem of such method is proved under some suitable assumption on the parameters. As applications, we apply our main result to the variational inequality problem, the convex minimization problem and the split feasibility problem. The numerical experiments to illustrate the behaviour of the proposed method including compare it with other methods are also presented.
We first study the fast minimization properties of the trajectories of the second-order evolution equation (x) double over dot (t) + alpha/t (x) over dot(t) + beta del(2)Phi(x(t))(x) double over dot(t) + del Phi(x(t))...
详细信息
We first study the fast minimization properties of the trajectories of the second-order evolution equation (x) double over dot (t) + alpha/t (x) over dot(t) + beta del(2)Phi(x(t))(x) double over dot(t) + del Phi(x(t)) = 0, where Phi : H -> R is a smooth convex function acting on a real Hilbert space H, and alpha, beta are positive parameters. This inertial system combines an isotropic viscous damping which vanishes asymptotically, and a geometrical Hessian driven damping, which makes it naturally related to Newton's and Levenberg-Marquardt methods. For alpha >= 3, and beta > 0, along any trajectory, fast convergence of the values Phi(x(t)) - min(H) Phi = O (t(-2)) is obtained, together with rapid convergence of the gradients del Phi(x(t)) to zero. For alpha > 3, just assuming that argmin Phi not equal empty set, we show that any trajectory converges weakly to a minimizer of Phi, and that Phi(x(t)) - min(H) Phi = o(t(-2)). Strong convergence is established in various practical situations. In particular, for the strongly convex case, we obtain an even faster speed of convergence which can be arbitrarily fast depending on the choice of alpha. More precisely, we have Phi (x(t)) - min(H) Phi = O(t(-2/3 alpha)). Then, we extend the results to the case of a general proper lower-semicontinuous convex function Phi : H -> R boolean OR {+infinity}. This is based on the crucial property that-the inertial dynamics with Hessian driven damping can be equivalently written as a first-order system in time and space, allowing to extend it by simply replacing the gradient with the subdifferential. By explicit-implicit time discretization, this opens a gate to new - possibly more rapid - inertial algorithms, expanding the field of FISTA methods for convex structured optimization problems. (C) 2016 Elsevier Inc. All rights reserved.
We study the existence and uniqueness of (locally) absolutely continuous trajectories of a dynamical system governed by a nonexpansive operator. The weak convergence of the orbits to a fixed point of the operator is i...
详细信息
We study the existence and uniqueness of (locally) absolutely continuous trajectories of a dynamical system governed by a nonexpansive operator. The weak convergence of the orbits to a fixed point of the operator is investigated by relying on Lyapunov analysis. We show also an order of convergence of for the fixed point residual of the trajectory of the dynamical system. We apply the results to dynamical systems associated with the problem of finding the zeros of the sum of a maximally monotone operator and a cocoercive one. Several dynamical systems from the literature turn out to be particular instances of this general approach.
In this article we introduce two procedures for variable selection in cluster analysis and classification rules. One is mainly aimed at detecting the ''noisy'' noninformative variables, while the other...
详细信息
In this article we introduce two procedures for variable selection in cluster analysis and classification rules. One is mainly aimed at detecting the ''noisy'' noninformative variables, while the other also deals with multicolinearity and general dependence. Both methods are designed to be used after a ''satisfactory'' grouping procedure has been carried out. A forward-backward algorithm is proposed to make such procedures feasible in large datasets. A small simulation is performed and some real data examples are analyzed.
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situations they can be difficult to implem...
详细信息
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situations they can be difficult to implement;and suffer from problems such as poor mixing, and the difficulty of diagnosing convergence. Here we review three alternatives to MCMC methods: importance sampling, the forward-backward algorithm, and sequential Monte Carlo (SMC). We discuss how to design good proposal densities for importance sampling, show some of the range of models for which the forward-backward algorithm can be applied, and show how resampling ideas from SMC can be used to improve the efficiency of the other two methods. We demonstrate these methods on a range of examples, including estimating the transition density of a diffusion and of a discrete-state continuous-time Markov chain;inferring structure in population genetics;and segmenting genetic divergence data.
The generalized viscosity implicit rules for solving quasi-inclusion problems of accretive operators in Banach spaces are established. The strong convergence theorems of the rules to a solution of quasi-inclusion prob...
详细信息
The generalized viscosity implicit rules for solving quasi-inclusion problems of accretive operators in Banach spaces are established. The strong convergence theorems of the rules to a solution of quasi-inclusion problems of accretive operators are proved under certain assumptions imposed on the sequences of parameters. The results presented in this paper extend and improve the main results of Refs. (Moudafi, J Math Anal Appl. 2000;241:46-55;Xu et al., Fixed Point Theory Appl. 2015;2015:41;Lopez et al., Abstr Appl Anal. 2012;2012;Cholamjiak, Numer Algor. DOI:10.1007/s11075-015-0030-6.). Moreover, some applications to monotone variational inequalities, convex minimization problem and convexly constrained linear inverse problem are presented.
We consider inference for queues based on inter-departure time data. Calculating the likelihood for such models is difficult, as the likelihood involves summing up over the (exponentially-large) space of realisations ...
详细信息
We consider inference for queues based on inter-departure time data. Calculating the likelihood for such models is difficult, as the likelihood involves summing up over the (exponentially-large) space of realisations of the arrival process. We demonstrate how a likelihood recursion can be used to calculate this likelihood efficiently for the specific cases of M/G/1 and Er/G/1 queues. We compare the sampling properties of the mles to the sampling properties of estimators, based on indirect inference, which have previously been suggested for this problem.
暂无评论