Visibility graph-based covariance functions for scalable spatial analysis in non-convex partially Euclidean domains.

We present a new method for constructing valid covariance functions of Gaussian processes for spatial analysis in irregular, non-convex domains such as bodies of water. Standard covariance functions based on geodesic distances are not guaranteed to be positive definite on such domains, while existing non-Euclidean approaches fail to respect the partially Euclidean nature of these domains where the geodesic distance agrees with the Euclidean distances for some pairs of points. Using a visibility graph on the domain, we propose a class of covariance functions that preserve Euclidean-based covariances between points that are connected in the domain while incorporating the non-convex geometry of the domain via conditional independence relationships. We show that the proposed method preserves the partially Euclidean nature of the intrinsic geometry on the domain while maintaining validity (positive definiteness) and marginal stationarity of the covariance function over the entire parameter space, properties which are not always fulfilled by existing approaches to construct covariance functions on non-convex domains. We provide useful approximations to improve computational efficiency, resulting in a scalable algorithm. We compare the performance of our method with those of competing state-of-the-art methods using simulation studies on synthetic non-convex domains. The method is applied to data regarding acidity levels in the Chesapeake Bay, showing its potential for ecological monitoring in real-world spatial applications on irregular domains.

Image denoising method integrating ridgelet transform and improved wavelet threshold.

In the field of image processing, common noise types include Gaussian noise, salt and pepper noise, speckle noise, uniform noise and pulse noise. Different types of noise require different denoising algorithms and techniques to maintain image quality and fidelity. Traditional image denoising methods not only remove image noise, but also result in the detail loss in the image. It cannot guarantee the clean removal of noise information while preserving the true signal of the image. To address the aforementioned issues, an image denoising method combining an improved threshold function and wavelet transform is proposed in the experiment. Unlike traditional threshold functions, the improved threshold function is a continuous function that can avoid the pseudo Gibbs effect after image denoising and improve image quality. During the process, the output image of the finite ridge wave transform is first combined with the wavelet transform to improve the denoising performance. Then, an improved threshold function is introduced to enhance the quality of the reconstructed image. In addition, to evaluate the performance of different algorithms, different densities of Gaussian noise are added to Lena images of black, white, and color in the experiment. The results showed that when adding 0.010.01 variance Gaussian noise to black and white images, the peak signal-to-noise ratio of the research method increased by 2.58dB in a positive direction. The mean square error decreased by 0.10dB. When using the algorithm for denoising, the research method had a minimum denoising time of only 13ms, which saved 9ms and 3ms compared to the hard threshold algorithm (Hard TA) and soft threshold algorithm (Soft TA), respectively. The research method exhibited higher stability, with an average similarity error fluctuating within 0.89%. The above results indicate that the research method has smaller errors and better system stability in image denoising. It can be applied in the field of digital image denoising, which can effectively promote the positive development of image denoising technology to a certain extent.

Algebraic method for multisensor data fusion.

In this contribution, we use Gaussian posterior probability densities to characterize local estimates from distributed sensors, and assume that they all belong to the Riemannian manifold of Gaussian distributions. Our starting point is to introduce a proper Lie algebraic structure for the Gaussian submanifold with a fixed mean vector, and then the average dissimilarity between the fused density and local posterior densities can be measured by the norm of a Lie algebraic vector. Under Gaussian assumptions, a geodesic projection based algebraic fusion method is proposed to achieve the fused density by taking the norm as the loss. It provides a robust fixed point iterative algorithm for the mean fusion with theoretical convergence, and gives an analytical form for the fused covariance matrix. The effectiveness of the proposed fusion method is illustrated by numerical examples.

Specific Substrate Activity of Lotus Root Polyphenol Oxidase: Insights from Gaussian-Accelerated Molecular Dynamics and Markov State Models.

Polyphenol oxidase (PPO) plays a key role in the enzymatic browning process, and this study employed Gaussian-accelerated molecular dynamics (GaMD) simulations to investigate the catalytic efficiency mechanisms of lotus root PPO with different substrates, including catechin, epicatechin, and chlorogenic acid, as well as the inhibitor oxalic acid. Key findings reveal significant conformational changes in PPO that correlate with its enzymatic activity. Upon substrate binding, the alpha-helix in the Q53-D63 region near the copper ion extends, likely stabilizing the active site and enhancing catalysis. In contrast, this helix is disrupted in the presence of the inhibitor, resulting in a decrease in enzymatic efficiency. Additionally, the F350-V378 region, which covers the substrate-binding site, forms an alpha-helix upon substrate binding, further stabilizing the substrate and promoting catalytic function. However, this alpha-helix does not form when the inhibitor is bound, destabilizing the binding site and contributing to inhibition. These findings offer new insights into the substrate-specific and inhibitor-induced structural dynamics of lotus root PPO, providing valuable information for enhancing food processing and preservation techniques.

Heterogeneous latent transfer learning in Gaussian graphical models.

Gaussian graphical models (GGMs) are useful for understanding the complex relationships between biological entities. Transfer learning can improve the estimation of GGMs in a target dataset by incorporating relevant information from related source studies. However, biomedical research often involves intrinsic and latent heterogeneity within a study, such as heterogeneous subpopulations. This heterogeneity can make it difficult to identify informative source studies or lead to negative transfer if the source study is improperly used. To address this challenge, we developed a heterogeneous latent transfer learning (Latent-TL) approach that accounts for both within-sample and between-sample heterogeneity. The idea behind this approach is to "learn from the alike" by leveraging the similarities between source and target GGMs within each subpopulation. The Latent-TL algorithm simultaneously identifies common subpopulation structures among samples and facilitates the learning of target GGMs using source samples from the same subpopulation. Through extensive simulations and real data application, we have shown that the proposed method outperforms single-site learning and standard transfer learning that ignores the latent structures. We have also demonstrated the applicability of the proposed algorithm in characterizing gene co-expression networks in breast cancer patients, where the inferred genetic networks identified many biologically meaningful gene-gene interactions.

Detection of invasive ductal carcinoma by electrical impedance spectroscopy implementing gaussian relaxation-time distribution (EIS-GRTD).

Breast cancer detection and differentiation of breast tissues are critical for accurate diagnosis and treatment planning. This study addresses the challenge of distinguishing between invasive ductal carcinoma (IDC), normal glandular breast tissues (nGBT), and adipose tissue using electrical impedance spectroscopy combined with Gaussian relaxation-time distribution (EIS-GRTD). The primary objective is to investigate the relaxation-time characteristics of these tissues and their potential to differentiate between normal and abnormal breast tissues. We applied a single-point EIS-GRTD measurement to ten mastectomy specimens across a frequency rangef= 4 Hz to 5 MHz. The method calculates the differential ratio of the relaxation-time distribution functionΔγbetween IDC and nGBT, which is denoted byΔγIDC-nGBT,andΔγbetween IDC and adipose tissues, which is denoted byΔγIDC-adipose.As a result, the differential ratio ofΔγbetween IDC and nGBTΔγIDC-nGBTis 0.36, and between IDC and adiposeΔγIDC-adiposeis 0.27, which included in theα-dispersion atτpeak1=0.033±0.001s.In all specimens, the relaxation-time distribution functionγof IDCγIDCis higher, and there is no intersection withγof nGBTγnGBTand adiposeγadipose.The difference inγsuggests potential variations in relaxation properties at the molecular or structural level within each breast tissue that contribute to the overall relaxation response. The average mean percentage errorδfor IDC, nGBT, and adipose tissues are 5.90%, 6.33%, and 8.07%, respectively, demonstrating the model's accuracy and reliability. This study provides novel insights into the use of relaxation-time characteristic for differentiating breast tissue types, offering potential advancements in diagnosis methods. Future research will focus on correlating EIS-GRTD finding with pathological results from the same test sites to further validate the method's efficacy.

SEMbap: Bow-free covariance search and data de-correlation.

Large-scale studies of gene expression are commonly influenced by biological and technical sources of expression variation, including batch effects, sample characteristics, and environmental impacts. Learning the causal relationships between observable variables may be challenging in the presence of unobserved confounders. Furthermore, many high-dimensional regression techniques may perform worse. In fact, controlling for unobserved confounding variables is essential, and many deconfounding methods have been suggested for application in a variety of situations. The main contribution of this article is the development of a two-stage deconfounding procedure based on Bow-free Acyclic Paths (BAP) search developed into the framework of Structural Equation Models (SEM), called SEMbap(). In the first stage, an exhaustive search of missing edges with significant covariance is performed via Shipley d-separation tests; then, in the second stage, a Constrained Gaussian Graphical Model (CGGM) is fitted or a low dimensional representation of bow-free edges structure is obtained via Graph Laplacian Principal Component Analysis (gLPCA). We compare four popular deconfounding methods to BAP search approach with applications on simulated and observed expression data. In the former, different structures of the hidden covariance matrix have been replicated. Compared to existing methods, BAP search algorithm is able to correctly identify hidden confounding whilst controlling false positive rate and achieving good fitting and perturbation metrics.

Enhancing RNA-seq bias mitigation with the Gaussian self-benchmarking framework: towards unbiased sequencing data.

BACKGROUND: RNA sequencing is a vital technique for analyzing RNA behavior in cells, but it often suffers from various biases that distort the data. Traditional methods to address these biases are typically empirical and handle them individually, limiting their effectiveness. Our study introduces the Gaussian Self-Benchmarking (GSB) framework, a novel approach that leverages the natural distribution patterns of guanine (G) and cytosine (C) content in RNA to mitigate multiple biases simultaneously. This method is grounded in a theoretical model, organizing k-mers based on their GC content and applying a Gaussian model for alignment to ensure empirical sequencing data closely match their theoretical distribution. RESULTS: The GSB framework demonstrated superior performance in mitigating sequencing biases compared to existing methods. Testing with synthetic RNA constructs and real human samples showed that the GSB approach not only addresses individual biases more effectively but also manages co-existing biases jointly. The framework's reliance on accurately pre-determined parameters like mean and standard deviation of GC content distribution allows for a more precise representation of RNA samples. This results in improved accuracy and reliability of RNA sequencing data, enhancing our understanding of RNA behavior in health and disease. CONCLUSIONS: The GSB framework presents a significant advancement in RNA sequencing analysis by providing a well-validated, multi-bias mitigation strategy. It functions independently from previously identified dataset flaws and sets a new standard for unbiased RNA sequencing results. This development enhances the reliability of RNA studies, broadening the potential for scientific breakthroughs in medicine and biology, particularly in genetic disease research and the development of targeted treatments.

Forward variable selection enables fast and accurate dynamic system identification with Karhunen-Loève decomposed Gaussian processes.

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are [Formula: see text] in training and [Formula: see text] per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a 'Susceptible, Infected, Recovered' (SIR) toy problem, along with the experimental 'Cascaded Tanks' benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package.

LncRNA-miRNA interactions prediction based on meta-path similarity and Gaussian kernel similarity.

Long non-coding RNAs (lncRNAs) and microRNAs (miRNAs) are two typical types of non-coding RNAs that interact and play important regulatory roles in many animal organisms. Exploring the unknown interactions between lncRNAs and miRNAs contributes to a better understanding of their functional involvement. Currently, studying the interactions between lncRNAs and miRNAs heavily relies on laborious biological experiments. Therefore, it is necessary to design a computational method for predicting lncRNA-miRNA interactions. In this work, we propose a method called MPGK-LMI, which utilizes a graph attention network (GAT) to predict lncRNA-miRNA interactions in animals. First, we construct a meta-path similarity matrix based on known lncRNA-miRNA interaction information. Then, we use GAT to aggregate the constructed meta-path similarity matrix and the computed Gaussian kernel similarity matrix to update the feature matrix with neighbourhood information. Finally, a scoring module is used for prediction. By comparing with three state-of-the-art algorithms, MPGK-LMI achieves the best results in terms of performance, with AUC value of 0.9077, AUPR of 0.9327, ACC of 0.9080, F1-score of 0.9143 and precision of 0.8739. These results validate the effectiveness and reliability of MPGK-LMI. Additionally, we conduct detailed case studies to demonstrate the effectiveness and feasibility of our approach in practical applications. Through these empirical results, we gain deeper insights into the functional roles and mechanisms of lncRNA-miRNA interactions, providing significant breakthroughs and advancements in this field of research. In summary, our method not only outperforms others in terms of performance but also establishes its practicality and reliability in biological research through real-case analysis, offering strong support and guidance for future studies and applications.

On the implementation of acollinearity in PET Monte Carlo simulations.

Objective.Acollinearity of annihilation photons (APA) introduces spatial blur in positron emission tomography (PET) imaging. This phenomenon increases proportionally with the scanner diameter and it has been shown to follow a Gaussian distribution. This last statement can be interpreted in two ways: the magnitude of the acollinearity angle, or the angular deviation of annihilation photons from perfect collinearity. As the former constitutes the partial integral of the latter, a misinterpretation could have significant consequences on the resulting spatial blurring. Previous research investigating the impact of APA in PET imaging has assumed the Gaussian nature of its angular deviation, which is consistent with experimental results. However, a comprehensive analysis of several simulation software packages for PET data acquisition revealed that the magnitude of APA was implemented as a Gaussian distribution.Approach.We quantified the impact of this misinterpretation of APA by comparing simulations obtained with GATE, which is one of these simulation programs, to an in-house modification of GATE that models APA deviation as following a Gaussian distribution.Main results.We show that the APA misinterpretation not only alters the spatial blurring profile in image space, but also considerably underestimates the impact of APA on spatial resolution. For an ideal PET scanner with a diameter of 81 cm, the APA point source response simulated under the first interpretation has a cusp shape with 0.4 mm FWHM. This is significantly different from the expected Gaussian point source response of 2.1 mm FWHM reproduced under the second interpretation.Significance.Although this misinterpretation has been found in several PET simulation tools, it has had a limited impact on the simulated spatial resolution of current PET scanners due to its small magnitude relative to the other factors. However, the inaccuracy it introduces in estimating the overall spatial resolution of PET scanners will increase as the performance of newer devices improves.

Reinforcing Tunnel Network Exploration in Proteins Using Gaussian Accelerated Molecular Dynamics.

Tunnels are structural conduits in biomolecules responsible for transporting chemical compounds and solvent molecules from the active site. They have been shown to be present in a wide variety of enzymes across all functional and structural classes. However, the study of such pathways is experimentally challenging, because they are typically transient. Computational methods, such as molecular dynamics (MD) simulations, have been successfully proposed to explore tunnels. Conventional MD (cMD) provides structural details to characterize tunnels but suffers from sampling limitations to capture rare tunnel openings on longer time scales. Therefore, in this study, we explored the potential of Gaussian accelerated MD (GaMD) simulations to improve the exploration of complex tunnel networks in enzymes. We used the haloalkane dehalogenase LinB and its two variants with engineered transport pathways, which are not only well-known for their application potential but have also been extensively studied experimentally and computationally regarding their tunnel networks and their importance in multistep catalytic reactions. Our study demonstrates that GaMD efficiently improves tunnel sampling and allows the identification of all known tunnels for LinB and its two mutants. Furthermore, the improved sampling provided insight into a previously unknown transient side tunnel (ST). The extensive conformational landscape explored by GaMD simulations allowed us to investigate in detail the mechanism of ST opening. We determined variant-specific dynamic properties of ST opening, which were previously inaccessible due to limited sampling of cMD. Our comprehensive analysis supports multiple indicators of the functional relevance of the ST, emphasizing its potential significance beyond structural considerations. In conclusion, our research proves that the GaMD method can overcome the sampling limitations of cMD for the effective study of tunnels in enzymes, providing further means for identifying rare tunnels in enzymes with the potential for drug development, precision medicine, and rational protein engineering.

Conformations of KRAS4B Affected by Its Partner Binding and G12C Mutation: Insights from GaMD Trajectory-Image Transformation-Based Deep Learning.

Binding of partners and mutations highly affects the conformational dynamics of KRAS4B, which is of significance for deeply understanding its function. Gaussian accelerated molecular dynamics (GaMD) simulations followed by deep learning (DL) and principal component analysis (PCA) were carried out to probe the effect of G12C and binding of three partners NF1, RAF1, and SOS1 on the conformation alterations of KRAS4B. DL reveals that G12C and binding of partners result in alterations in the contacts of key structure domains, such as the switch domains SW1 and SW2 together with the loops L4, L5, and P-loop. Binding of NF1, RAF1, and SOS1 constrains the structural fluctuation of SW1, SW2, L4, and L5; on the contrary, G12C leads to the instability of these four structure domains. The analyses of free energy landscapes (FELs) and PCA also show that binding of partners maintains the stability of the conformational states of KRAS4B while G12C induces greater mobility of the switch domains SW1 and SW2, which produces significant impacts on the interactions of GTP with SW1, L4, and L5. Our findings suggest that partner binding and G12C play important roles in the activity and allosteric regulation of KRAS4B, which may theoretically aid in further understanding the function of KRAS4B.

Motor Imagery Recognition Based on GMM-JCSFE Model.

Features from EEG microstate models, such as time-domain statistical features and state transition probabilities, are typically manually selected based on experience. However, traditional microstate models assume abrupt transitions between states, and the classification features can vary among individuals due to personal differences. To date, both empirical and theoretical classification results of EEG microstate features have not been entirely satisfactory. Here, we introduce an enhanced feature extraction method that combines Joint label-Common and label-Specific Feature Exploration (JCSFE) with Gaussian Mixture Models (GMM) to explore microstate features. First, GMMs are employed to represent the smooth transitions of EEG spatiotemporal features within microstate models. Second, category-common and category-specific features are identified by applying regularization constraints to linear classifiers. Third, a graph regularizer is used to extract subject-invariant microstate features. Experimental results on publicly available datasets demonstrate that the proposed model effectively encodes microstate features and improves the accuracy of motor imagery recognition across subjects. The primary code is accessible for download from the website: https://github.com/liaoliao3450/GMM-JCSFE.

Reconstructing blood flow in data-poor regimes: a vasculature network kernel for Gaussian process regression.

Blood flow reconstruction in the vasculature is important for many clinical applications. However, in clinical settings, the available data are often quite limited. For instance, transcranial Doppler ultrasound is a non-invasive clinical tool that is commonly used in clinical settings to measure blood velocity waveforms at several locations. This amount of data is grossly insufficient for training machine learning surrogate models, such as deep neural networks or Gaussian process regression. In this work, we propose a Gaussian process regression approach based on empirical kernels constructed by data generated from physics-based simulations-enabling near-real-time reconstruction of blood flow in data-poor regimes. We introduce a novel methodology to reconstruct the kernel within the vascular network. The proposed kernel encodes both spatiotemporal and vessel-to-vessel correlations, thus enabling blood flow reconstruction in vessels that lack direct measurements. We demonstrate that any prediction made with the proposed kernel satisfies the conservation of mass principle. The kernel is constructed by running stochastic one-dimensional blood flow simulations, where the stochasticity captures the epistemic uncertainties, such as lack of knowledge about boundary conditions and uncertainties in vasculature geometries. We demonstrate the performance of the model on three test cases, namely, a simple Y-shaped bifurcation, abdominal aorta and the circle of Willis in the brain.

Analytic delay distributions for a family of gene transcription models.

Models intended to describe the time evolution of a gene network must somehow include transcription, the DNA-templated synthesis of RNA, and translation, the RNA-templated synthesis of proteins. In eukaryotes, the DNA template for transcription can be very long, often consisting of tens of thousands of nucleotides, and lengthy pauses may punctuate this process. Accordingly, transcription can last for many minutes, in some cases hours. There is a long history of introducing delays in gene expression models to take the transcription and translation times into account. Here we study a family of detailed transcription models that includes initiation, elongation, and termination reactions. We establish a framework for computing the distribution of transcription times, and work out these distributions for some typical cases. For elongation, a fixed delay is a good model provided elongation is fast compared to initiation and termination, and there are no sites where long pauses occur. The initiation and termination phases of the model then generate a nontrivial delay distribution, and elongation shifts this distribution by an amount corresponding to the elongation delay. When initiation and termination are relatively fast, the distribution of elongation times can be approximated by a Gaussian. A convolution of this Gaussian with the initiation and termination time distributions gives another analytic approximation to the transcription time distribution. If there are long pauses during elongation, because of the modularity of the family of models considered, the elongation phase can be partitioned into reactions generating a simple delay (elongation through regions where there are no long pauses), and reactions whose distribution of waiting times must be considered explicitly (initiation, termination, and motion through regions where long pauses are likely). In these cases, the distribution of transcription times again involves a nontrivial part and a shift due to fast elongation processes.

Insights into the Interaction Mechanisms of Peptide and Non-Peptide Inhibitors with MDM2 Using Gaussian-Accelerated Molecular Dynamics Simulations and Deep Learning.

Inhibiting MDM2-p53 interaction is considered an efficient mode of cancer treatment. In our current study, Gaussian-accelerated molecular dynamics (GaMD), deep learning (DL), and binding free energy calculations were combined together to probe the binding mechanism of non-peptide inhibitors K23 and 0Y7 and peptide ones PDI6W and PDI to MDM2. The GaMD trajectory-based DL approach successfully identified significant functional domains, predominantly located at the helixes α2 and α2', as well as the ß-strands and loops between α2 and α2'. The post-processing analysis of the GaMD simulations indicated that inhibitor binding highly influences the structural flexibility and collective motions of MDM2. Calculations of molecular mechanics-generalized Born surface area (MM-GBSA) and solvated interaction energy (SIE) not only suggest that the ranking of the calculated binding free energies is in agreement with that of the experimental results, but also verify that van der Walls interactions are the primary forces responsible for inhibitor-MDM2 binding. Our findings also indicate that peptide inhibitors yield more interaction contacts with MDM2 compared to non-peptide inhibitors. Principal component analysis (PCA) and free energy landscape (FEL) analysis indicated that the piperidinone inhibitor 0Y7 shows the most pronounced impact on the free energy profiles of MDM2, with the piperidinone inhibitor demonstrating higher fluctuation amplitudes along primary eigenvectors. The hot spots of MDM2 revealed by residue-based free energy estimation provide target sites for drug design toward MDM2. This study is expected to provide useful theoretical aid for the development of selective inhibitors of MDM2 family members.

Bayesian inference for multivariate probit model with latent envelope.

The response envelope model proposed by Cook et al. (2010) is an efficient method to estimate the regression coefficient under the context of the multivariate linear regression model. It improves estimation efficiency by identifying material and immaterial parts of responses and removing the immaterial variation. The response envelope model has been investigated only for continuous response variables. In this paper, we propose the multivariate probit model with latent envelope, in short, the probit envelope model, as a response envelope model for multivariate binary response variables. The probit envelope model takes into account relations between Gaussian latent variables of the multivariate probit model by using the idea of the response envelope model. We address the identifiability of the probit envelope model by employing the essential identifiability concept and suggest a Bayesian method for the parameter estimation. We illustrate the probit envelope model via simulation studies and real-data analysis. The simulation studies show that the probit envelope model has the potential to gain efficiency in estimation compared to the multivariate probit model. The real data analysis shows that the probit envelope model is useful for multi-label classification.

Detection of invasive ductal carcinoma in quadrant breast areas by electrical impedance tomography implemented with gaussian relaxation-time distribution (EIT-GRTD).

Invasive ductal carcinoma (IDC) in breast specimens has been detected in the quadrant breast area: (I) upper outer, (II) upper inner, (III) lower inner, and (IV) lower outer areas by electrical impedance tomography implemented with Gaussian relaxation-time distribution (EIT-GRTD). The EIT-GRTD consists of two steps which are (1) the optimum frequencyfoptselection and (2) the time constant enhancement of breast imaging reconstruction.foptis characterized by a peak in the majority measurement pair of the relaxation-time distribution functionγ,which indicates the presence of IDC.γrepresents the inverse of conductivity and indicates the response of breast tissues to electrical currents across varying frequencies based on the Voigt circuit model. The EIT-GRTD is quantitatively evaluated by multi-physics simulations using a hemisphere container of mimic breast, consisting of IDC and adipose tissues as normal breast tissue under one condition with known IDC in quadrant breast area II. The simulation results show that EIT-GRTD is able to detect the IDC in four layers atfopt= 30, 170 Hz. EIT-GRTD is applied in the real breast by employed six mastectomy specimens from IDC patients. The placement of the mastectomy specimens in a hemisphere container is an important factor in the success of quadrant breast area reconstruction. In order to perform the evaluation, EIT-GRTD reconstruction images are compared to the CT scan images. The experimental results demonstrate that EIS-GRTD exhibits proficiency in the detection of the IDC in quadrant breast areas while compared qualitatively to CT scan images.

PepBinding: A Workflow for Predicting Peptide Binding Structures by Combining Peptide Docking and Peptide Gaussian Accelerated Molecular Dynamics Simulations.

Predicting protein-peptide interactions is crucial for understanding peptide binding processes and designing peptide drugs. However, traditional computational modeling approaches face challenges in accurately predicting peptide-protein binding structures due to the slow dynamics and high flexibility of the peptides. Here, we introduce a new workflow termed "PepBinding" for predicting peptide binding structures, which combines peptide docking, all-atom enhanced sampling simulations using the Peptide Gaussian accelerated Molecular Dynamics (Pep-GaMD) method, and structural clustering. PepBinding has been demonstrated on seven distinct model peptides. In peptide docking using HPEPDOCK, the peptide backbone root-mean-square deviations (RMSDs) of their bound conformations relative to X-ray structures ranged from 3.8 to 16.0 Å, corresponding to the medium to inaccurate quality models according to the Critical Assessment of PRediction of Interactions (CAPRI) criteria. The Pep-GaMD simulations performed for only 200 ns significantly improved the docking models, resulting in five medium and two acceptable quality models. Therefore, PepBinding is an efficient workflow for predicting peptide binding structures and is publicly available at https://github.com/MiaoLab20/PepBinding.