ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    facet.materialart.
    Unknown
    Diversity and complexity of HIV-1 drug resistance: A bioinformatics approach to predicting phenotype from genotype (2002)
    National Academy of Sciences
    Details
    Publication Date: 2002-06-11
    Print ISSN: 0027-8424
    Electronic ISSN: 1091-6490
    Topics: Biology , Medicine , Natural Sciences in General
    Published by National Academy of Sciences
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 2
    facet.materialart.
    Unknown
    Comparative lesion sequencing provides insights into tumor evolution (2008)
    National Academy of Sciences
    Details
    Publication Date: 2008-03-12
    Print ISSN: 0027-8424
    Electronic ISSN: 1091-6490
    Topics: Biology , Medicine , Natural Sciences in General
    Published by National Academy of Sciences
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    ISMB/ECCB 2015 (2015)
    Oxford University Press
    Details
    Publication Date: 2015-06-14
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 4
    facet.materialart.
    Unknown
    BMix: probabilistic modeling of occurring substitutions in PAR-CLIP data (2016)
    Oxford University Press
    Details
    Publication Date: 2016-03-26
    Description: Motivation : Photoactivatable ribonucleoside-enhanced cross-linking and immunoprecipitation (PAR-CLIP) is an experimental method based on next-generation sequencing for identifying the RNA interaction sites of a given protein. The method deliberately inserts T-to-C substitutions at the RNA-protein interaction sites, which provides a second layer of evidence compared with other CLIP methods. However, the experiment includes several sources of noise which cause both low-frequency errors and spurious high-frequency alterations. Therefore, rigorous statistical analysis is required in order to separate true T-to-C base changes, following cross-linking, from noise. So far, most of the existing PAR-CLIP data analysis methods focus on discarding the low-frequency errors and rely on high-frequency substitutions to report binding sites, not taking into account the possibility of high-frequency false positive substitutions. Results : Here, we introduce BMix , a new probabilistic method which explicitly accounts for the sources of noise in PAR-CLIP data and distinguishes cross-link induced T-to-C substitutions from low and high-frequency erroneous alterations. We demonstrate the superior speed and accuracy of our method compared with existing approaches on both simulated and real, publicly available human datasets. Availability and implementation : The model is freely accessible within the BMix toolbox at www.cbg.bsse.ethz.ch/software/BMix , available for Matlab and R. Supplementary information: Supplementary data is available at Bioinformatics online. Contact : niko.beerenwinkel@bsse.ethz.ch
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 5
    facet.materialart.
    Unknown
    Linear effects models of signaling pathways from combinatorial perturbation data (2016)
    Oxford University Press
    Details
    Publication Date: 2016-06-16
    Description: Motivation: Perturbations constitute the central means to study signaling pathways. Interrupting components of the pathway and analyzing observed effects of those interruptions can give insight into unknown connections within the signaling pathway itself, as well as the link from the pathway to the effects. Different pathway components may have different individual contributions to the measured perturbation effects, such as gene expression changes. Those effects will be observed in combination when the pathway components are perturbed. Extant approaches focus either on the reconstruction of pathway structure or on resolving how the pathway components control the downstream effects. Results: Here, we propose a linear effects model, which can be applied to solve both these problems from combinatorial perturbation data. We use simulated data to demonstrate the accuracy of learning the pathway structure as well as estimation of the individual contributions of pathway components to the perturbation effects. The practical utility of our approach is illustrated by an application to perturbations of the mitogen-activated protein kinase pathway in Saccharomyces cerevisiae . Availability and Implementation: lem is available as a R package at http://www.mimuw.edu.pl/~szczurek/lem . Contact: szczurek@mimuw.edu.pl ; niko.beerenwinkel@bsse.ethz.ch Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 6
    facet.materialart.
    Unknown
    Covering Pairs in Directed Acyclic Graphs (2015)
    Oxford University Press
    Details
    Publication Date: 2015-06-27
    Description: The Minimum Path Cover (MinPC) problem on directed acyclic graphs (DAGs) is a classical problem in graph theory that provides a clear and simple mathematical formulation for several applications in computational biology. In this paper, we study the computational complexity of three constrained variants of MinPC motivated by the recent introduction of Next-Generation Sequencing technologies. The first variant (MinRPC), given a DAG and a set of pairs of vertices, asks for a minimum-cardinality set of (not necessarily disjoint) paths such that both vertices of each pair belong to the same path. For this problem, we establish a sharp tractability borderline depending on the ‘overlapping degree’ of the instance, a natural parameter in some applications of the problem. The second variant we consider (MinPCRP), given a DAG and a set of pairs of vertices, asks for a minimum-cardinality set of (not necessarily disjoint) paths ‘covering’ all the vertices of the graph and such that both vertices of each pair belong to the same path. For this problem, we show that, while it is NP-hard to compute if there exists a solution consisting of at most three paths, it is possible to decide in polynomial time whether a solution consisting of at most two paths exists. The third variant (MaxRPSP), given a DAG and a set of pairs of vertices, asks for a single path containing the maximum number of the given pairs of vertices. We show that MaxRPSP is W[1]-hard when parameterized by the number of covered pairs and we give a fixed-parameter algorithm when the parameter is the maximum overlapping degree.
    Print ISSN: 0010-4620
    Electronic ISSN: 1460-2067
    Topics: Computer Science
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 7
    facet.materialart.
    Unknown
    Efficient sampling for Bayesian inference of conjunctive Bayesian networks (2012)
    Oxford University Press
    Details
    Publication Date: 2012-09-08
    Description: Motivation: Cancer development is driven by the accumulation of advantageous mutations and subsequent clonal expansion of cells harbouring these mutations, but the order in which mutations occur remains poorly understood. Advances in genome sequencing and the soon-arriving flood of cancer genome data produced by large cancer sequencing consortia hold the promise to elucidate cancer progression. However, new computational methods are needed to analyse these large datasets. Results: We present a Bayesian inference scheme for Conjunctive Bayesian Networks, a probabilistic graphical model in which mutations accumulate according to partial order constraints and cancer genotypes are observed subject to measurement noise. We develop an efficient MCMC sampling scheme specifically designed to overcome local optima induced by dependency structures. We demonstrate the performance advantage of our sampler over traditional approaches on simulated data and show the advantages of adopting a Bayesian perspective when reanalyzing cancer datasets and comparing our results to previous maximum-likelihood-based approaches. Availability: An R package including the sampler and examples is available at http://www.cbg.ethz.ch/software/bayes-cbn . Contacts: niko.beerenwinkel@bsse.ethz.ch
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    Full-length haplotype reconstruction to infer the structure of heterogeneous virus populations (2014)
    Oxford University Press
    Details
    Publication Date: 2014-08-15
    Description: Next-generation sequencing (NGS) technologies enable new insights into the diversity of virus populations within their hosts. Diversity estimation is currently restricted to single-nucleotide variants or to local fragments of no more than a few hundred nucleotides defined by the length of sequence reads. To study complex heterogeneous virus populations comprehensively, novel methods are required that allow for complete reconstruction of the individual viral haplotypes. Here, we show that assembly of whole viral genomes of ~8600 nucleotides length is feasible from mixtures of heterogeneous HIV-1 strains derived from defined combinations of cloned virus strains and from clinical samples of an HIV-1 superinfected individual. Haplotype reconstruction was achieved using optimized experimental protocols and computational methods for amplification, sequencing and assembly. We comparatively assessed the performance of the three NGS platforms 454 Life Sciences/Roche, Illumina and Pacific Biosciences for this task. Our results prove and delineate the feasibility of NGS-based full-length viral haplotype reconstruction and provide new tools for studying evolution and pathogenesis of viruses.
    Keywords: Computational Methods, Massively Parallel (Deep) Sequencing, Genomics
    Print ISSN: 0305-1048
    Electronic ISSN: 1362-4962
    Topics: Biology
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    TiMEx: a waiting time model for mutually exclusive cancer alterations (2016)
    Oxford University Press
    Details
    Publication Date: 2016-03-26
    Description: Motivation: Despite recent technological advances in genomic sciences, our understanding of cancer progression and its driving genetic alterations remains incomplete. Results: We introduce TiMEx, a generative probabilistic model for detecting patterns of various degrees of mutual exclusivity across genetic alterations, which can indicate pathways involved in cancer progression. TiMEx explicitly accounts for the temporal interplay between the waiting times to alterations and the observation time. In simulation studies, we show that our model outperforms previous methods for detecting mutual exclusivity. On large-scale biological datasets, TiMEx identifies gene groups with strong functional biological relevance, while also proposing new candidates for biological validation. TiMEx possesses several advantages over previous methods, including a novel generative probabilistic model of tumorigenesis, direct estimation of the probability of mutual exclusivity interaction, computational efficiency and high sensitivity in detecting gene groups involving low-frequency alterations. Availability and implementation: TiMEx is available as a Bioconductor R package at www.bsse.ethz.ch/cbg/software/TiMEx . Contact: niko.beerenwinkel@bsse.ethz.ch Supplementary information : Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    Stability of gene rankings from RNAi screens (2012)
    Oxford University Press
    Details
    Publication Date: 2012-06-12
    Description: Motivation: Genome-wide RNA interference (RNAi) experiments are becoming a widely used approach for identifying intracellular molecular pathways of specific functions. However, detecting all relevant genes involved in a biological process is challenging, because typically only few samples per gene knock-down are available and readouts tend to be very noisy. We investigate the reliability of top scoring hit lists obtained from RNAi screens, compare the performance of different ranking methods, and propose a new ranking method to improve the reproducibility of gene selection. Results: The performance of different ranking methods is assessed by the size of the stable sets they produce, i.e. the subsets of genes which are estimated to be re-selected with high probability in independent validation experiments. Using stability selection, we also define a new ranking method, called stability ranking, to improve the stability of any given base ranking method. Ranking methods based on mean, median, t -test and rank-sum test, and their stability-augmented counterparts are compared in simulation studies and on three microscopy image RNAi datasets. We find that the rank-sum test offers the most favorable trade-off between ranking stability and accuracy and that stability ranking improves the reproducibility of all and the accuracy of several ranking methods. Availability: Stability ranking is freely available as the R/Bioconductor package staRank at http://www.cbg.ethz.ch/software/staRank . Contact: niko.beerenwinkel@bsse.ethz.ch Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...