On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

count % of corpus

3 results for “site-saturation mutagenesis”

Batched Stochastic Bayesian Optimization via Combinatorial Constraints Designcs.LG

BSBO optimizes constraints for high-throughput experiments.

problem Optimizing high-throughput experiments with combinatorial constraints.

method Stochastic Bayesian optimization with submodular decomposition.

result BSBO outperforms heuristics in real-world protein datasets.

Bayesian optimization combinatorial constraints high-throughput experiments site-saturation mutagenesis submodular functions

2019-04-17abs ↗pdf ↗

A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Modelmath.OC

We present a sparse knowledge gradient (SpKG) algorithm for adaptively selecting the targeted regions within a large RNA molecule to identify which regions are most amenable to interactions with other molecules. Experimentally, such regions can be inferred from fluorescence measurements obtained by binding a complement…

2015-08-06abs ↗pdf ↗

PANDA: Predicting the change in proteins binding affinity upon mutations using sequence informationq-bio.BM

PANDA predicts protein binding affinity changes from sequences, outperforming existing methods.

problem Accurately predicting changes in protein binding affinity due to mutations.

method Sequence-based machine learning approach using protein sequence information.

result PANDA achieves higher Pearson correlation coefficients than existing methods.

protein binding affinity mutation prediction sequence-based machine learning Pearson correlation

2020-09-16abs ↗pdf ↗