Haoling Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Haoling Zhang has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Yue Shen
University of Illinois Urbana-Champaign
9 shared publications - Zhi Ping
The Chinese University of Hong Kong, Shenzhen
7 shared publications - Xun Xu
State Key Laboratory of Genome and Multi-Omics Technologies, BGI Research, Shenzhen, China
4 shared publications - Jesper Tegnér
King Abdullah University of Science and Technology
3 shared publications Wenwei Zhang
BGI research, Shenzhen, China
3 shared publicationsZhaojun Lan
Capital Normal University
3 shared publications
Latest Publications
- Open Access
- 8 July 2026
- Published by Springer Nature in Research Square
SPIDER-WEB enables a real-time data retrieval of DNA-based data storage
Data retrieval efficiency remains one of the key challenges hindering the practical application of DNA-based data storage, being at least five orders of magnitude lower than that of compact discs. Here, we introduce SPIDER-WEB, an all-in-one coding framework that eliminates reliance on time-consuming sequence clustering and alignment steps in conventional pipelines, allowing data process- ing to proceed concurrently with the sequencing process. Across 3,000 synthesised data-coding DNA sequences, SPIDER-WEB demonstrated an efficiency improvement of 587-fold to 9,083-fold over optimised conventional pipelines. Projections for megabyte and exabyte-scale retrievals show even greater gains, with efficiency enhancements of 3.0-3.2 and 24.0-29.7 orders of magnitude, respectively. On a laptop, SPIDER-WEB achieves retrieval throughput up to 13.8 MB/s. When integrated with nanopore sequencing, SPIDER-WEB enabled progressive rendering of a 19,200-byte video during sequencing, with full retrieval completed within 100 seconds. Overall, we demonstrate that the compact-disc-level retrieval performance is achievable in DNA-based data storage.
- 8 July 2026
- Published by Springer Nature in Research Square
Open AccessSPIDER-WEB enables a real-time data retrieval of DNA-based data storage
Data retrieval efficiency remains one of the key challenges hindering the practical application of DNA-based data storage, being at least five orders of magnitude lower than that of compact discs. Here, we introduce SPIDER-WEB, an all-in-one coding framework that eliminates reliance on time-consuming sequence clustering and alignment steps in conventional pipelines, allowing data process- ing to proceed concurrently with the sequencing process. Across 3,000 synthesised data-coding DNA sequences, SPIDER-WEB demonstrated an efficiency improvement of 587-fold to 9,083-fold over optimised conventional pipelines. Projections for megabyte and exabyte-scale retrievals show even greater gains, with efficiency enhancements of 3.0-3.2 and 24.0-29.7 orders of magnitude, respectively. On a laptop, SPIDER-WEB achieves retrieval throughput up to 13.8 MB/s. When integrated with nanopore sequencing, SPIDER-WEB enabled progressive rendering of a 19,200-byte video during sequencing, with full retrieval completed within 100 seconds. Overall, we demonstrate that the compact-disc-level retrieval performance is achievable in DNA-based data storage.
- Open Access
- 13 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1)
Leveraging network motifs to improve artificial neural networks
As the scale of artificial neural networks continues to expand to tackle increasingly complex tasks or improve the prediction accuracy of specific tasks, the challenges associated with computational demand, hyper-parameter tuning, model interpretability, and deployment costs intensify. Addressing these challenges requires a deeper understanding of how network structures influence network performance. Here, we analyse 882,000 motifs to reveal the functional roles of incoherent and coherent three-node motifs in shaping overall network performance. Our findings reveal that incoherent loops exhibit superior representational capacity and numerical stability, whereas coherent loops show a distinct preference for high-gradient regions within the output landscape. By avoiding such gradient pursuit, incoherent loops sustain more stable adaptation and consequently greater robustness. This mechanism is evident in 97,240 fixed-network training experiments, where coherent-loop networks consistently prioritized high-gradient regions during learning, and is further supported by noise-resilience analyses – from classical reinforcement learning tasks to biological, chemical, and medical applications – which demonstrate that incoherent-loop networks maintain stronger resistance to training noise and environmental perturbations. This work shows the functional impact of structural motif differences on the performance of artificial neural networks, offering foundational insights for designing more resilient and accurate networks.
- 13 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1)
Open AccessLeveraging network motifs to improve artificial neural networks
As the scale of artificial neural networks continues to expand to tackle increasingly complex tasks or improve the prediction accuracy of specific tasks, the challenges associated with computational demand, hyper-parameter tuning, model interpretability, and deployment costs intensify. Addressing these challenges requires a deeper understanding of how network structures influence network performance. Here, we analyse 882,000 motifs to reveal the functional roles of incoherent and coherent three-node motifs in shaping overall network performance. Our findings reveal that incoherent loops exhibit superior representational capacity and numerical stability, whereas coherent loops show a distinct preference for high-gradient regions within the output landscape. By avoiding such gradient pursuit, incoherent loops sustain more stable adaptation and consequently greater robustness. This mechanism is evident in 97,240 fixed-network training experiments, where coherent-loop networks consistently prioritized high-gradient regions during learning, and is further supported by noise-resilience analyses – from classical reinforcement learning tasks to biological, chemical, and medical applications – which demonstrate that incoherent-loop networks maintain stronger resistance to training noise and environmental perturbations. This work shows the functional impact of structural motif differences on the performance of artificial neural networks, offering foundational insights for designing more resilient and accurate networks.
- Open Access
- 27 March 2024
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 25 (3)
DNA Bloom Filter enables anti-contamination and file version control for DNA-based data storage
DNA storage is one of the most promising ways for future information storage due to its high data storage density, durable storage time and low maintenance cost. However, errors are inevitable during synthesizing, storing and sequencing. Currently, many error correction algorithms have been developed to ensure accurate information retrieval, but they will decrease storage density or increase computing complexity. Here, we apply the Bloom Filter, a space-efficient probabilistic data structure, to DNA storage to achieve the anti-error, or anti-contamination function. This method only needs the original correct DNA sequences (referred to as target sequences) to produce a corresponding data structure, which will filter out almost all the incorrect sequences (referred to as non-target sequences) during sequencing data analysis. Experimental results demonstrate the universal and efficient filtering capabilities of our method. Furthermore, we employ the Counting Bloom Filter to achieve the file version control function, which significantly reduces synthesis costs when modifying DNA-form files. To achieve cost-efficient file version control function, a modified system based on yin–yang codec is developed.
- 27 March 2024
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 25 (3)
Open AccessDNA Bloom Filter enables anti-contamination and file version control for DNA-based data storage
DNA storage is one of the most promising ways for future information storage due to its high data storage density, durable storage time and low maintenance cost. However, errors are inevitable during synthesizing, storing and sequencing. Currently, many error correction algorithms have been developed to ensure accurate information retrieval, but they will decrease storage density or increase computing complexity. Here, we apply the Bloom Filter, a space-efficient probabilistic data structure, to DNA storage to achieve the anti-error, or anti-contamination function. This method only needs the original correct DNA sequences (referred to as target sequences) to produce a corresponding data structure, which will filter out almost all the incorrect sequences (referred to as non-target sequences) during sequencing data analysis. Experimental results demonstrate the universal and efficient filtering capabilities of our method. Furthermore, we employ the Counting Bloom Filter to achieve the file version control function, which significantly reduces synthesis costs when modifying DNA-form files. To achieve cost-efficient file version control function, a modified system based on yin–yang codec is developed.
- Open Access
- 1 March 2024
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 40 (3)
Rapid generation of high-quality structure figures for publication with PyMOL-PUB
The advancement of structural biology has increased the requirements for researchers to quickly and efficiently visualize molecular structures in silico. Meanwhile, it is also time-consuming for structural biologists to create publication-standard figures, as no useful tools can directly generate figures from structure data. Although manual editing can ensure that figures meet the standards required for publication, it requires a deep understanding of software operations and/or program call commands. Therefore, providing interfaces based on established software instead of manual editing becomes a significant necessity. We developed PyMOL-PUB, based on the original design of PyMOL, to effectively create publication-quality figures from molecular structure data. It provides functions including structural alignment methods, functional coloring schemes, conformation adjustments, and layout plotting strategies. These functions allow users to easily generate high-quality figures, demonstrate structural differences, illustrate inter-molecular interactions, and predict performances of biomacromolecules. Our tool is publicly available at https://github.com/BGI-SynBio/PyMOL-PUB.
- 1 March 2024
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 40 (3)
Open AccessRapid generation of high-quality structure figures for publication with PyMOL-PUB
The advancement of structural biology has increased the requirements for researchers to quickly and efficiently visualize molecular structures in silico. Meanwhile, it is also time-consuming for structural biologists to create publication-standard figures, as no useful tools can directly generate figures from structure data. Although manual editing can ensure that figures meet the standards required for publication, it requires a deep understanding of software operations and/or program call commands. Therefore, providing interfaces based on established software instead of manual editing becomes a significant necessity. We developed PyMOL-PUB, based on the original design of PyMOL, to effectively create publication-quality figures from molecular structure data. It provides functions including structural alignment methods, functional coloring schemes, conformation adjustments, and layout plotting strategies. These functions allow users to easily generate high-quality figures, demonstrate structural differences, illustrate inter-molecular interactions, and predict performances of biomacromolecules. Our tool is publicly available at https://github.com/BGI-SynBio/PyMOL-PUB.
- Open Access
- 14 October 2023
- Published by Springer Nature in Nature Communications
- Vol. 14 (1) , 1-13
A robust yeast biocontainment system with two-layered regulation switch dependent on unnatural amino acid
Synthetic auxotrophy in which cell viability depends on the presence of an unnatural amino acid (unAA) provides a powerful strategy to restrict unwanted propagation of genetically modified organisms (GMOs) in open environments and potentially prevent industrial espionage. Here, we describe a generic approach for robust biocontainment of budding yeast dependent on unAA. By understanding escape mechanisms, we specifically optimize our strategies by introducing designed “immunity” to the generation of amber-suppressor tRNAs and developing the transcriptional- and translational-based biocontainment switch. We further develop a fitness-oriented screening method to easily obtain multiplex safeguard strains that exhibit robust growth and undetectable escape frequency (<~10−9) on solid media for 14 days. Finally, we show that employing our multiplex safeguard system could restrict the proliferation of strains of interest in a real fermentation scenario, highlighting the great potential of our yeast biocontainment strategy to protect the industrial proprietary strains.
- 14 October 2023
- Published by Springer Nature in Nature Communications
- Vol. 14 (1) , 1-13
Open AccessA robust yeast biocontainment system with two-layered regulation switch dependent on unnatural amino acid
Synthetic auxotrophy in which cell viability depends on the presence of an unnatural amino acid (unAA) provides a powerful strategy to restrict unwanted propagation of genetically modified organisms (GMOs) in open environments and potentially prevent industrial espionage. Here, we describe a generic approach for robust biocontainment of budding yeast dependent on unAA. By understanding escape mechanisms, we specifically optimize our strategies by introducing designed “immunity” to the generation of amber-suppressor tRNAs and developing the transcriptional- and translational-based biocontainment switch. We further develop a fitness-oriented screening method to easily obtain multiplex safeguard strains that exhibit robust growth and undetectable escape frequency (<~10−9) on solid media for 14 days. Finally, we show that employing our multiplex safeguard system could restrict the proliferation of strains of interest in a real fermentation scenario, highlighting the great potential of our yeast biocontainment strategy to protect the industrial proprietary strains.
- Open Access
SPIDER-WEB generates coding algorithms with superior error tolerance and real-time information retrieval capacity
DNA has been considered a promising medium for storing digital information. As an essential step in the DNA-based data storage workflow, coding algorithms are responsible to implement functions including bit-to-base transcoding, error correction, etc. In previous studies, these functions are normally realized by introducing multiple algorithms. Here, we report a graph-based architecture, named SPIDER-WEB, providing an all-in-one coding solution by generating customized algorithms automatically. SPIDERWEB is able to correct a maximum of 4% edit errors in the DNA sequences including substitution and insertion/deletion (indel), with only 5.5% redundant symbols. Since no DNA sequence pretreatment is required for the correcting and decoding processes, SPIDER-WEB offers the function of real-time information retrieval, which is 305.08 times faster than the speed of single-molecule sequencing techniques. Our retrieval process can improve 2 orders of magnitude faster compared to the conventional one under megabyte-level data and can be scalable to fit exabyte-level data. Therefore, SPIDER-WEB holds the potential to improve the practicability in large-scale data storage applications.
Open AccessSPIDER-WEB generates coding algorithms with superior error tolerance and real-time information retrieval capacity
DNA has been considered a promising medium for storing digital information. As an essential step in the DNA-based data storage workflow, coding algorithms are responsible to implement functions including bit-to-base transcoding, error correction, etc. In previous studies, these functions are normally realized by introducing multiple algorithms. Here, we report a graph-based architecture, named SPIDER-WEB, providing an all-in-one coding solution by generating customized algorithms automatically. SPIDERWEB is able to correct a maximum of 4% edit errors in the DNA sequences including substitution and insertion/deletion (indel), with only 5.5% redundant symbols. Since no DNA sequence pretreatment is required for the correcting and decoding processes, SPIDER-WEB offers the function of real-time information retrieval, which is 305.08 times faster than the speed of single-molecule sequencing techniques. Our retrieval process can improve 2 orders of magnitude faster compared to the conventional one under megabyte-level data and can be scalable to fit exabyte-level data. Therefore, SPIDER-WEB holds the potential to improve the practicability in large-scale data storage applications.
- Open Access
Evolving Neural Networks through a Reverse Encoding Tree
NeuroEvolution is one of the most competitive evolutionary learning frameworks for designing novel neural networks for use in specific tasks, such as logic circuit design and digital gaming. However, the application of benchmark methods such as the NeuroEvolution of Augmenting Topologies (NEAT) remains a challenge, in terms of their computational cost and search time inefficiency. This paper advances a method which incorporates a type of topological edge coding, named Reverse Encoding Tree (RET), for evolving scalable neural networks efficiently. Using RET, two types of approaches -- NEAT with Binary search encoding (Bi-NEAT) and NEAT with Golden-Section search encoding (GS-NEAT) -- have been designed to solve problems in benchmark continuous learning environments such as logic gates, Cartpole, and Lunar Lander, and tested against classical NEAT and FS-NEAT as baselines. Additionally, we conduct a robustness test to evaluate the resilience of the proposed NEAT algorithms. The results show that the two proposed strategies deliver improved performance, characterized by (1) a higher accumulated reward within a finite number of time steps; (2) using fewer episodes to solve problems in targeted environments, and (3) maintaining adaptive robustness under noisy perturbations, which outperform the baselines in all tested cases. Our analysis also demonstrates that RET expends potential future research directions in dynamic environments. Code is available from https://github.com/HaolingZHANG/ReverseEncodingTree.
Open AccessEvolving Neural Networks through a Reverse Encoding Tree
NeuroEvolution is one of the most competitive evolutionary learning frameworks for designing novel neural networks for use in specific tasks, such as logic circuit design and digital gaming. However, the application of benchmark methods such as the NeuroEvolution of Augmenting Topologies (NEAT) remains a challenge, in terms of their computational cost and search time inefficiency. This paper advances a method which incorporates a type of topological edge coding, named Reverse Encoding Tree (RET), for evolving scalable neural networks efficiently. Using RET, two types of approaches -- NEAT with Binary search encoding (Bi-NEAT) and NEAT with Golden-Section search encoding (GS-NEAT) -- have been designed to solve problems in benchmark continuous learning environments such as logic gates, Cartpole, and Lunar Lander, and tested against classical NEAT and FS-NEAT as baselines. Additionally, we conduct a robustness test to evaluate the resilience of the proposed NEAT algorithms. The results show that the two proposed strategies deliver improved performance, characterized by (1) a higher accumulated reward within a finite number of time steps; (2) using fewer episodes to solve problems in targeted environments, and (3) maintaining adaptive robustness under noisy perturbations, which outperform the baselines in all tested cases. Our analysis also demonstrates that RET expends potential future research directions in dynamic environments. Code is available from https://github.com/HaolingZHANG/ReverseEncodingTree.
- Open Access
- 3 January 2020
- Published by Cold Spring Harbor Laboratory in bioRxiv
Chamaeleo: a robust library for DNA storage coding schemes
Chamaeleo is currently the only collection library that focuses on adapting multiple well-established coding schemes for DNA storage. It provides a tool for researchers to study various coding schemes and apply them in practice. Chamaeleo adheres to the concept of high aggregation and low coupling for software design which will enhance the performance efficiency. Here, we describe the working pipeline of Chamaeleo, and demonstrate its advantages over the implementation of existing single coding schemes. The source code is available athttps://github.com/ntpz870817/Chamaeleo, it can be also installed by the command of pip.exe, “pip install chamaeleo”. Alternatively, the wheel file can be downloaded athttps://pypi.org/project/Chamaeleo/. Detailed documentation is available athttps://chamaeleo.readthedocs.io/en/latest/.Author Summary: DNA is now considered to be a promising candidate media for future digital information storage in order to tackle the global issue of data explosion. Transcoding between binary digital data and quanternary DNA information is one of the most important steps in the whole process of DNA digital storage. Although several coding schemes have been reported, researchers are still investigating better strategies. Moreover, the scripts of these coding schemes use different programming languages, software architectures and optimization contents. Therefore, we here introduce Chamaeleo, a library in which several classical coding schemes are collected, to reconstruct and optimize them. One of the key features of this tool is that we modulize the functions and make it feasible for more customized way of usage. Meanwhile, developers can also incorporate their new algorithms according to the framework expediently. Based on the benchmark tests we conducted, Chamaeleo shows better flexibility and expandability compared to original packages and we hope that it will help the further study and applications in DNA digital storage.
- 3 January 2020
- Published by Cold Spring Harbor Laboratory in bioRxiv
Open AccessChamaeleo: a robust library for DNA storage coding schemes
Chamaeleo is currently the only collection library that focuses on adapting multiple well-established coding schemes for DNA storage. It provides a tool for researchers to study various coding schemes and apply them in practice. Chamaeleo adheres to the concept of high aggregation and low coupling for software design which will enhance the performance efficiency. Here, we describe the working pipeline of Chamaeleo, and demonstrate its advantages over the implementation of existing single coding schemes. The source code is available athttps://github.com/ntpz870817/Chamaeleo, it can be also installed by the command of pip.exe, “pip install chamaeleo”. Alternatively, the wheel file can be downloaded athttps://pypi.org/project/Chamaeleo/. Detailed documentation is available athttps://chamaeleo.readthedocs.io/en/latest/.Author Summary: DNA is now considered to be a promising candidate media for future digital information storage in order to tackle the global issue of data explosion. Transcoding between binary digital data and quanternary DNA information is one of the most important steps in the whole process of DNA digital storage. Although several coding schemes have been reported, researchers are still investigating better strategies. Moreover, the scripts of these coding schemes use different programming languages, software architectures and optimization contents. Therefore, we here introduce Chamaeleo, a library in which several classical coding schemes are collected, to reconstruct and optimize them. One of the key features of this tool is that we modulize the functions and make it feasible for more customized way of usage. Meanwhile, developers can also incorporate their new algorithms according to the framework expediently. Based on the benchmark tests we conducted, Chamaeleo shows better flexibility and expandability compared to original packages and we hope that it will help the further study and applications in DNA digital storage.
- Open Access
- 5 November 2019
- Published by Cold Spring Harbor Laboratory in bioRxiv
- p. 829721
Towards Practical and Robust DNA-Based Data Archiving Using ‘Yin-Yang Codec’ System
DNA is a promising data storage medium due to its remarkable durability and space-efficient storage. Early bit-to-base transcoding schemes have primarily pursued information density, at the expense however of introducing biocompatibility challenges or at the risk of decoding failure. Here, we propose a robust transcoding algorithm named the “Yin-Yang Codec” (YYC), using two rules to encode two binary bits into one nucleotide, to generate DNA sequences highly compatible with synthesis and sequencing technologies. We encoded two representative file formats and stored them in vitro as 200-nt oligo pools and in vivo as an ~54-kb DNA fragment in yeast cells. Sequencing results show that YYC exhibits high robustness and reliability for a wide variety of data types, with an average recovery rate of 99.94% at 104molecule copies and an achieved recovery rate of 87.53% at 100 copies. In addition, the in vivo storage demonstration achieved for the first time an experimentally measured physical information density of 198.8 EB per gram of DNA (44% of the theoretical maximum for DNA).
- 5 November 2019
- Published by Cold Spring Harbor Laboratory in bioRxiv
- p. 829721
Open AccessTowards Practical and Robust DNA-Based Data Archiving Using ‘Yin-Yang Codec’ System
DNA is a promising data storage medium due to its remarkable durability and space-efficient storage. Early bit-to-base transcoding schemes have primarily pursued information density, at the expense however of introducing biocompatibility challenges or at the risk of decoding failure. Here, we propose a robust transcoding algorithm named the “Yin-Yang Codec” (YYC), using two rules to encode two binary bits into one nucleotide, to generate DNA sequences highly compatible with synthesis and sequencing technologies. We encoded two representative file formats and stored them in vitro as 200-nt oligo pools and in vivo as an ~54-kb DNA fragment in yeast cells. Sequencing results show that YYC exhibits high robustness and reliability for a wide variety of data types, with an average recovery rate of 99.94% at 104molecule copies and an achieved recovery rate of 87.53% at 100 copies. In addition, the in vivo storage demonstration achieved for the first time an experimentally measured physical information density of 198.8 EB per gram of DNA (44% of the theoretical maximum for DNA).
- Open Access
- 8 June 2018
- Published by Center for Open Science in SocArXiv
Special quantitative methods for orienteering training in areas without orienteering map
The objective of this study was to deal with the training problem of orienteering in the areas that suitable for orienteering but lack orienteering map since current training methods do not quantify the level of orienteering athletes. This study proposes to use the decomposition method to divide the problem of foot-orienteering into sub-parts and use the special quantitative methods to solve specific sub-problems. Experiments results show that the proficiency of the participants’ sub-skills is increasing. All participants took part in the Orienteering Competition of the National Student, and the team performance increased by nearly 13% and the proportion of the normal athletes who gain the ranking was increased from 0% to 60%. The results of this study demonstrate that applying the decomposition method and the above training methods are effective and reasonable, it also offers a useful solution for coaches to operate training and quantify easily.
- 8 June 2018
- Published by Center for Open Science in SocArXiv
Open AccessSpecial quantitative methods for orienteering training in areas without orienteering map
The objective of this study was to deal with the training problem of orienteering in the areas that suitable for orienteering but lack orienteering map since current training methods do not quantify the level of orienteering athletes. This study proposes to use the decomposition method to divide the problem of foot-orienteering into sub-parts and use the special quantitative methods to solve specific sub-problems. Experiments results show that the proficiency of the participants’ sub-skills is increasing. All participants took part in the Orienteering Competition of the National Student, and the team performance increased by nearly 13% and the proportion of the normal athletes who gain the ranking was increased from 0% to 60%. The results of this study demonstrate that applying the decomposition method and the above training methods are effective and reasonable, it also offers a useful solution for coaches to operate training and quantify easily.