Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alberto Pessia

dblp:221/7266 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-8607-9191ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › population genetics
ancestry inference
0.312018
Kpax3: Bayesian bi-clustering of large sequence datasets · Bioinform. 2018
Bioinformatics and computational biology › gene expression analysis
biclustering
0.312018
Kpax3: Bayesian bi-clustering of large sequence datasets · Bioinform. 2018
Bioinformatics and computational biology
population genetics
0.312018
Kpax3: Bayesian bi-clustering of large sequence datasets · Bioinform. 2018
Bioinformatics and computational biology
multiple sequence alignment
0.112018
Kpax3: Bayesian bi-clustering of large sequence datasets · Bioinform. 2018
Bioinformatics and computational biology
sequence analysis
0.112018
Kpax3: Bayesian bi-clustering of large sequence datasets · Bioinform. 2018

Methods — techniques the papers use, named apart from their topics

split-merge sampler · 0.3gibbs sampler · 0.3bayesian inference · 0.3MCMC · 0.3
YearPublicationVenuePosition
2019 Drug combination sensitivity scoring facilitates the discovery of synergistic and efficacious drug combinations in cancer
abstract
High-throughput drug screening has facilitated the discovery of drug combinations in cancer. Many existing studies adopted a full matrix design, aiming for the characterization of drug pair effects for cancer cells. However, the full matrix design may be suboptimal as it requires a drug pair to be combined at multiple concentrations in a full factorial manner. Furthermore, many of the computational tools assess only the synergy but not the sensitivity of drug combinations, which might lead to false positive discoveries. We proposed a novel cross design to enable a more cost-effective and simultaneous testing of drug combination sensitivity and synergy. We developed a drug combination sensitivity score (CSS) to determine the sensitivity of a drug pair, and showed that the CSS is highly reproducible between the replicates and thus supported its usage as a robust metric. We further showed that CSS can be predicted using machine learning approaches which determined the top pharmaco-features to cluster cancer cell lines based on their drug combination sensitivity profiles. To assess the degree of drug interactions using the cross design, we developed an S synergy score based on the difference between the drug combination and the single drug dose-response curves. We showed that the S score is able to detect true synergistic and antagonistic drug combinations at an accuracy level comparable to that using the full matrix design. Taken together, we showed that the cross design coupled with the CSS sensitivity and S synergy scoring methods may provide a robust and accurate characterization of both drug combination sensitivity and synergy levels, with minimal experimental materials required. Our experimental-computational approach could be utilized as an efficient pipeline for improving the discovery rate in high-throughput drug combination screening, particularly for primary patient samples which are difficult to obtain.
Alina Malyutina, Muntasir Mamun Majumder, Alberto Pessia, Caroline Heckman, Jing Tang 0002
PLoS Comput. Biol.4
2018 Kpax3: Bayesian bi-clustering of large sequence datasets
abstract
Motivation: Estimation of the hidden population structure is an important step in many genetic studies. Often the aim is also to identify which sequence locations are the most discriminative between groups of samples for a given data partition. Automated discovery of interesting patterns that are present in the data can help to generate new biological hypotheses. Results: We introduce Kpax3, a Bayesian method for bi-clustering multiple sequence alignments. Influence of individual sites will be determined in a supervised manner by using informative prior distributions for the model parameters. Our inference method uses an implementation of both split-merge and Gibbs sampler type MCMC algorithms to traverse the joint posterior of partitions of samples and variables. We use a large Rotavirus sequence dataset to demonstrate the ability of Kpax3 to generate biologically important hypotheses about differential selective pressures across a virus protein. Availability and implementation: Kpax3 is implemented as a Julia package and released under the MIT license. Source code and documentation are available at: https://github.com/albertopessia/Kpax3.jl. Supplementary information: Supplementary data are available at Bioinformatics online.
Alberto Pessia, Jukka Corander
Bioinform.1