Haoling Zhang

Haoling Zhang

Auto-generated profile, based on publicly available information

Haoling Zhang

King Abdullah University of Science and Technology

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 October 2023 in Nature Communications
Verified
Journal Article
Open access
PDF file
TCTiantian Chang
Tiantian Chang
WDWeichao Ding
Weichao Ding
SYShirui Yan
Shirui Yan
YWYun Wang
Yun Wang
HZHaoling Zhang
Haoling Zhang
XFXian Fu
Xian Fu
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.

1 March 2024 in Bioinformatics
Verified
Journal Article
Open access
PDF file
YCYuting Chen
Yuting Chen
HZHaoling Zhang
Haoling Zhang
WWWen Wang
Wen Wang
YSYue Shen
Yue Shen
ZPZhi Ping
Zhi Ping
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.

27 March 2024 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
YLYiming Li
Yiming Li
HZHaoling Zhang
Haoling Zhang
YCYuxin Chen
Yuxin Chen
YSYue Shen
Yue Shen
ZPZhi Ping
Zhi Ping
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.

3 January 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
ZPZhi Ping
Zhi Ping
HZHaoling Zhang
Haoling Zhang
SCShihong Chen
Shihong Chen
QZQianlong Zhuang
Qianlong Zhuang
SZSha Joe Zhu
Sha Joe Zhu
YSYue Shen
Yue Shen
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.

30 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
HZHaoling Zhang
Haoling Zhang
ZLZhaojun Lan
Zhaojun Lan
WZWenwei Zhang
Wenwei Zhang
XXXun Xu
Xun Xu
ZPZhi Ping
Zhi Ping
YSYue Shen
Yue Shen
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.

13 December 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
HZHaoling Zhang
Haoling Zhang
CYChao-Han Huck Yang
Chao-Han Huck Yang
Hector ZenilHector Zenil
Hector Zenil
PCPin-Yu Chen
Pin-Yu Chen
YSYue Shen
Yue Shen
JTJesper Tegner
Jesper Tegner
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.