SearcharxivSearch

arXiv subjects

Muhammad Daud

Publications and source records attributed to Muhammad Daud.

2 recordsLinked to original sources

EHCube4P: Learning Epistatic Patterns Through Hypercube Graph Convolution Neural Network for Protein Fitness Function Estimation

Understanding the relationship between protein sequences and their functions is fundamental to protein engineering, but this task is hindered by the combinatorially vast sequence space and the experimental noise inherent in fitness measurements. In this study, we present a novel framework that models the sequence landscape as a hypercube $H(k,2)$ and integrates wavelet-based signal denoising with a graph convolutional neural network (GCN) to predict protein fitness across rugged fitness landscapes. Using a dataset of 419 experimentally measured mutant sequences of the Tobacco 5-Epi-Aristolochene Synthase (TEAS) enzyme, we preprocess the fitness signals using a 1-D discrete wavelet transform with a Daubechies-3 basis to suppress experimental noise while preserving local epistatic patterns. Our model comprises two GCN layers, allowing for beyond pairwise aggregation, followed by a multi-layer perceptron (MLP). We show that our approach, EHCube4P, generalizes well across different enzyme activity datasets and effectively captures higher-order mutational interactions. Performance varies with the ruggedness of the fitness landscape, with smoother signals yielding higher test set $r^2$ scores. These results demonstrate that combining wavelet preprocessing with graph-based deep learning enhances the robustness and generalization of fitness prediction, particularly for sparse and noisy biological datasets. The approach provides a scalable and interpretable framework for protein fitness estimation applicable to a broad range of combinatorial biological systems.

q-bio.QM

Scaling Network Topologies for Multi-User Entanglement Distribution

Future quantum internet relies on large-scale entanglement distribution. Quantum decoherence is a significant obstacle in large-scale networks, which otherwise perform better with multiple paths between the source and destination. We propose a new topology, connected tree, with a significant amount of redundant edges to support multi-path routing of entangled pairs. We qualitatively analyse the scalability of quantum networks to maximum user capacity in decoherence for different topologies. Our analysis shows that thin-connected tree networks can accommodate a larger number of user pairs than more evenly distributed lattice topology. We extend our analysis to quantum key distribution and show that the quantum network of a thin tree topology is more robust against decoherence and leads to better key distribution among multiple communicating parties.

quant-ph