Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Ke Yuan is active.

Publication


Featured researches published by Ke Yuan.


Genome Biology | 2015

BitPhylogeny: a probabilistic framework for reconstructing intra-tumor phylogenies.

Ke Yuan; Thomas Sakoparnig; Florian Markowetz; Niko Beerenwinkel

Cancer has long been understood as a somatic evolutionary process, but many details of tumor progression remain elusive. Here, we present BitPhylogeny, a probabilistic framework to reconstruct intra-tumor evolutionary pathways. Using a full Bayesian approach, we jointly estimate the number and composition of clones in the sample as well as the most likely tree connecting them. We validate our approach in the controlled setting of a simulation study and compare it against several competing methods. In two case studies, we demonstrate how BitPhylogeny reconstructs tumor phylogenies from methylation patterns in colon cancer and from single-cell exomes in myeloproliferative neoplasm.


Neural Computation | 2011

Online variational inference for state-space models with point-process observations

Andrew Zammit Mangion; Ke Yuan; Visakan Kadirkamanathan; Mahesan Niranjan; Guido Sanguinetti

We present a variational Bayesian (VB) approach for the state and parameter inference of a state-space model with point-process observations, a physiologically plausible model for signal processing of spike data. We also give the derivation of a variational smoother, as well as an efficient online filtering algorithm, which can also be used to track changes in physiological parameters. The methods are assessed on simulated data, and results are compared to expectation-maximization, as well as Monte Carlo estimation techniques, in order to evaluate the accuracy of the proposed approach. The VB filter is further assessed on a data set of taste-response neural cells, showing that the proposed approach can effectively capture dynamical changes in neural responses in real time.


Neural Computation | 2012

Markov chain monte carlo methods for state-space models with point process observations

Ke Yuan; Mark A. Girolami; Mahesan Niranjan

This letter considers how a number of modern Markov chain Monte Carlo (MCMC) methods can be applied for parameter estimation and inference in state-space models with point process observations. We quantified the efficiencies of these MCMC methods on synthetic data, and our results suggest that the Reimannian manifold Hamiltonian Monte Carlo method offers the best performance. We further compared such a method with a previously tested variational Bayes method on two experimental data sets. Results indicate similar performance on the large data sets and superior performance on small ones. The work offers an extensive suite of MCMC algorithms evaluated on an important class of models for physiological signal analysis.


Neural Computation | 2010

Estimating a state-space model from point process observations: A note on convergence

Ke Yuan; Mahesan Niranjan

Physiological signals such as neural spikes and heartbeats are discrete events in time, driven by continuous underlying systems. A recently introduced data-driven model to analyze such a system is a state-space model with point process observations, parameters of which and the underlying state sequence are simultaneously identified in a maximum likelihood setting using the expectation-maximization (EM) algorithm. In this note, we observe some simple convergence properties of such a setting, previously un-noticed. Simulations show that the likelihood is unimodal in the unknown parameters, and hence the EM iterations are always able to find the globally optimal solution.


bioRxiv | 2017

The evolutionary history of 2,658 cancers

Moritz Gerstung; Clemency Jolly; Ignaty Leshchiner; Stefan Dentro; Santiago Gonzalez; Thomas J. Mitchell; Yulia Rubanova; Pavana Anur; Daniel Rosebrock; Kaixan Yu; Maxime Tarabichi; Amit G Deshwar; Jeff Wintersinger; Kortine Kleinheinz; Ignacio Vázquez-García; Kerstin Haase; Subhajit Sengupta; Geoff Macintyre; Salem Malikic; Nilgun Donmez; Dimitri Livitz; Marek Cmero; Jonas Demeulemeester; Steve Schumacher; Yu Fan; Xiaotong Yao; Juhee Lee; Matthias Schlesner; Paul C. Boutros; David Bowtell

Cancer develops through a process of somatic evolution. Here, we use whole-genome sequencing of 2,778 tumour samples from 2,658 donors to reconstruct the life history, evolution of mutational processes, and driver mutation sequences of 39 cancer types. The early phases of oncogenesis are driven by point mutations in a small set of driver genes, often including biallelic inactivation of tumour suppressors. Early oncogenesis is also characterised by specific copy number gains, such as trisomy 7 in glioblastoma or isochromosome 17q in medulloblastoma. By contrast, increased genomic instability, a nearly four-fold diversification of driver genes, and an acceleration of point mutation processes are features of later stages. Copy-number alterations often occur in mitotic crises leading to simultaneous gains of multiple chromosomal segments. Timing analysis suggests that driver mutations often precede diagnosis by many years, and in some cases decades, providing a window of opportunity for early cancer detection.


The Annals of Applied Statistics | 2014

Reconstructing evolving signalling networks by hidden Markov nested effects models

Xin Wang; Ke Yuan; Christoph Hellmayr; Wei Liu; Florian Markowetz

Inferring time-varying networks is important to understand the development and evolution of interactions over time. However, the vast majority of currently used models assume direct measurements of node states, which are often difficult to obtain, especially in fields like cell biology, where perturbation experiments often only provide indirect information of network structure. Here we propose hidden Markov nested effects models (HM-NEMs) to model the evolving network by a Markov chain on a state space of signalling networks, which are derived from nested effects models (NEMs) of indirect perturbation data. To infer the hidden network evolution and unknown parameter, a Gibbs sampler is developed, in which sampling network structure is facilitated by a novel structural Metropolis--Hastings algorithm. We demonstrate the potential of HM-NEMs by simulations on synthetic time-series perturbation data. We also show the applicability of HM-NEMs in two real biological case studies, in one capturing dynamic crosstalk during the progression of neutrophil polarisation, and in the other inferring an evolving network underlying early differentiation of mouse embryonic stem cells.


The Annals of Applied Statistics | 2016

A phylogenetic latent feature model for clonal deconvolution

Francesco Marass; Florent Mouliere; Ke Yuan; Nitzan Rosenfeld; Florian Markowetz

Tumours develop in an evolutionary process, in which the accumulation of mutations produces subpopulations of cells with distinct mutational profiles, called clones. This process leads to the genetic heterogeneity widely observed in tumour sequencing data, but identifying the genotypes and frequencies of the different clones is still a major challenge. Here, we present Cloe, a phylogenetic latent feature model to deconvolute tumour sequencing data into a set of related genotypes. Our approach extends latent feature models by placing the features as nodes in a latent tree. The resulting model can capture both the acquisition and the loss of mutations, as well as episodes of convergent evolution. We establish the validity of Cloe on synthetic data and assess its performance on controlled biological data, comparing our reconstructions to those of several published state-of-the-art methods. We show that our method provides highly accurate reconstructions and identifies the number of clones, their genotypes and frequencies even at a modest sequencing depth. As a proof of concept we apply our model to clinical data from three cases with chronic lymphocytic leukaemia, and one case with acute myeloid leukaemia.


Genome Biology | 2017

BaalChIP: Bayesian analysis of allele-specific transcription factor binding in cancer genomes

Ines de Santiago; Wei Liu; Ke Yuan; Martin O’Reilly; Chandra Sekhar Reddy Chilamakuri; Bruce A.J. Ponder; Kerstin B. Meyer; Florian Markowetz

Allele-specific measurements of transcription factor binding from ChIP-seq data are key to dissecting the allelic effects of non-coding variants and their contribution to phenotypic diversity. However, most methods of detecting an allelic imbalance assume diploid genomes. This assumption severely limits their applicability to cancer samples with frequent DNA copy-number changes. Here we present a Bayesian statistical approach called BaalChIP to correct for the effect of background allele frequency on the observed ChIP-seq read counts. BaalChIP allows the joint analysis of multiple ChIP-seq samples across a single variant and outperforms competing approaches in simulations. Using 548 ENCODE ChIP-seq and six targeted FAIRE-seq samples, we show that BaalChIP effectively corrects allele-specific analysis for copy-number variation and increases the power to detect putative cis-acting regulatory variants in cancer genomes.


vehicular technology conference | 2009

Reliability-Aided Multiuser Detection in Time-Frequency-Domain Spread Multicarrier DS-CDMA Systems

Ke Yuan; Wei Liu; Lie-Liang Yang

In this contribution we propose and study a novel multiuser detection (MUD) scheme for multicarrier direct- sequence code-division multiple-access systems employing both time (T)-domain and frequency (F)-domain spreading, which are referred to as the TF/MC DS-CDMA systems. Specifically, a reliability-aided MUD scheme is proposed, which consists of a linear MUD and a so-called L-level maximum-likelihood (ML)- MUD. The linear MUD is either a joint TF-domain linear MUD or constituted by two linear MUDs, one of which is operated in the T-domain and the other one in the F-domain. The L- level ML-MUD is a reduced ML-MUD, which only searches in a space of size 2 L in order to find the optimum solutions for the L most unreliable data bits detected by the linear MUD. In this contribution the bit error rate (BER) performance of the TF/MC DS-CDMA using the reliability-aided MUD is investigated, when communicating over additive white Gaussian noise (AWGN) chan- nels or over frequency-selective Rayleigh fading channels. Our simulation results show that the reliability-aided MUD is capable of significantly outperforming the corresponding linear MUD. It can be shown that, provided that the signal-to-noise ratio (SNR) is sufficiently high, the reliability-aided MUD can readily obtain several decibels of SNR gain over the linear MUD at the cost of slight or moderate increase of the detection complexity.


bioRxiv | 2018

Portraits of genetic intra-tumour heterogeneity and subclonal selection across cancer types

Stefan Dentro; Ignaty Leshchiner; Kerstin Haase; Maxime Tarabichi; Jeff Wintersinger; Amit G Deshwar; Kaixian Yu; Yulia Rubanova; Geoff Mcintyre; Ignacio Vázquez-García; Kortine Kleinheinz; Dimitri Livitz; Salem Malikic; Nilgun Donmez; Subhajit Sengupta; Jonas Demeulemeester; Pavana Anur; Clemency Jolly; Marek Cmero; Daniel Rosebrock; Steven E. Schumacher; Yu Fan; Matthew Fittall; Ruben M. Drews; Xiaotong Yao; Juhee Lee; Matthias Schlesner; Hongtu Zhu; David J. Adams; Gad Getz

Intra-tumor heterogeneity (ITH) is a mechanism of therapeutic resistance and therefore an important clinical challenge. However, the extent, origin and drivers of ITH across cancer types are poorly understood. To address this question, we extensively characterize ITH across whole-genome sequences of 2,658 cancer samples, spanning 38 cancer types. Nearly all informative samples (95.1%) contain evidence of distinct subclonal expansions, with frequent branching relationships between subclones. We observe positive selection of subclonal driver mutations across most cancer types, and identify cancer type specific subclonal patterns of driver gene mutations, fusions, structural variants and copy-number alterations, as well as dynamic changes in mutational processes between subclonal expansions. Our results underline the importance of ITH and its drivers in tumor evolution, and provide an unprecedented pan-cancer resource of comprehensively annotated subclonal events from whole-genome sequencing data.Continued evolution in cancers gives rise to intra-tumour heterogeneity (ITH), which is a major mechanism of therapeutic resistance and therefore an important clinical challenge. However, the extent, origin and drivers of ITH across cancer types are poorly understood. Here, we extensively characterise ITH across 2,778 cancer whole genome sequences from 36 cancer types. We demonstrate that nearly all tumours (95.1%) with sufficient sequencing depth contain evidence of recent subclonal expansions and most cancer types show clear signs of positive selection in both clonal and subclonal protein coding variants. We find distinctive subclonal patterns of driver gene mutations, fusions, structural variation and copy-number alterations across cancer types. Dynamic, tumour-type specific changes of mutational processes between subclonal expansions shape differences between clonal and subclonal events. Our results underline the importance of ITH and its drivers in tumour evolution and provide an unprecedented pan-cancer resource of extensively annotated subclonal events, laying a foundation for future cancer genomic studies.

Collaboration


Dive into the Ke Yuan's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Marek Cmero

University of Melbourne

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Stefan Dentro

Wellcome Trust Sanger Institute

View shared research outputs
Top Co-Authors

Avatar

Wei Liu

University of Southampton

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge