Big Data-Driven Computational Aptamer Design Framework via Parallel Monte Carlo Tree Search
Computational aptamer design using Monte Carlo Tree Search (MCTS) shows promise in drug discovery but is limited by sequential computing and simulation, which hinders the exploration of vast nucleotide sequence spaces and the integration of high-quality molecular docking techniques. We present a big data-driven parallel MCTS framework that significantly accelerates aptamer discovery while maintaining high accuracy. Our framework addresses these computational bottlenecks by distributing tasks across multiple processing units, enabling simultaneous exploration of diverse sequence regions and efficient incorporation of RNA/ssDNA-protein docking simulations for candidate evaluation. Key designs include a distributed search architecture with molecular docking, a score penalty system for optimized exploration, and comprehensive RNA/ssDNA docking pipelines that combine structure prediction with protein docking simulations. Experimental results targeting human complement component protein (i.e., protein 2A73) demonstrate a 98-fold increase in daily successful candidate discovery and improved binding affinity compared to the baseline, with the successful ratio increasing from 1% to 7.59%. Our approach not only accelerates the aptamer design process but also enhances the quality of generated aptamers, providing a more efficient and effective tool for drug discovery.
Authors
- Jikang Jian (ORCID: https://orcid.org/0000-0001-5752-7282)
- Jin Chen (ORCID: https://orcid.org/0000-0002-6497-4141)
- Z. Jiao (ORCID: https://orcid.org/0009-0009-6288-7042)
- Zihan Li (ORCID: https://orcid.org/0000-0003-3516-4892)
Institutions
- Cleveland Clinic (US)
- University of Illinois Urbana-Champaign (US)
Publication Details
- Published
- 2024-12-15
- DOI
- https://doi.org/10.1109/bigdata62323.2024.10825454
- Primary Topic
- VLSI and FPGA Design Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00