Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Interpretation of pooling experiments using the Markov chain Monte Carlo method

E Knill1, A Schliep, D C Torney

  • 1Los Alamos National Laboratory, New Mexico 87545, USA.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|January 1, 1996
PubMed
Summary

This study presents a Markov chain Monte Carlo method for decoding pooled library screening results. This approach effectively identifies positive clones, even with experimental errors, improving efficiency and robustness in genetic screening.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Joint Quantum-State and Measurement Tomography with Incomplete Measurements.

Physical review. A·2024
Same author

High-fidelity laser-free universal control of trapped ion qubits.

Nature·2021
Same author

Quantum Estimation of Parameters of Classical Spacetimes.

Physical review. D. (2016)·2020
Same author

Chained Bell Inequality Experiment with High-Efficiency Measurements.

Physical review letters·2017
Same author

Preparation of Entangled States through Hilbert Space Engineering.

Physical review letters·2016
Same author

High-Fidelity Universal Gate Set for ^{9}Be^{+} Ion Qubits.

Physical review letters·2016

Area of Science:

  • Molecular Biology
  • Bioinformatics
  • Computational Biology

Background:

  • Library screening is crucial for identifying positive clones.
  • Decoding pooled screening results is challenging due to experimental errors and combinatorial complexity.
  • Existing methods may struggle with large datasets and inherent noise.

Purpose of the Study:

  • To develop an effective method for extracting maximum information from pooled library screening experiments.
  • To address the ambiguities in decoding pool screening results caused by errors.
  • To provide a robust and efficient decoding algorithm for library screening.

Main Methods:

  • Implemented a decoding algorithm using Markov chain Monte Carlo (MCMC) methods.
  • Applied Bayesian inference for ranking candidate positives, considering prior distributions for positives and errors.

Related Experiment Videos

  • Utilized the algorithm for screening a library of 1298 clones using 47 pools.

    • Main Results:

    • The MCMC algorithm effectively decodes pooled screening results, inferring positive clones with corroborated posterior probabilities.
    • Simulations demonstrated the algorithm's efficacy on a larger library (33,000 clones, 253 pools).
    • The method allows for the use of fewer pools and introduces robustness compared to combinatorial decoding.

    Conclusions:

    • The developed MCMC-based decoding algorithm is effective for pooled library screening.
    • This approach enhances information extraction and handles experimental errors efficiently.
    • The method offers a robust alternative for large-scale library screening where combinatorial methods are less practical.