Depth-first search is inherently sequential

Evaluation of Cellpose segmentation with sequential thresholding for instance segmentation of cytoplasms within autofluorescence images

BACKGROUND

Autofluorescence imaging of the coenzyme, reduced nicotinamide adenine dinucleotide (phosphate) (NAD(P)H), provides a label-free technique to assess cellular metabolism. Because NAD(P)H is localized in the cytosol and mitochondria, instance segmentation of cell cytoplasms from NAD(P)H images allows quantification of metabolism with cellular resolution. However, accurate cytoplasmic segmentation of autofluorescence images is difficult due to irregular cell shapes and cell clusters.

METHOD

Here, a cytoplasm segmentation method is presented and tested. First, autofluorescence images are segmented into cells via either hand-segmentation or Cellpose, a deep learning-based segmentation method. Then, a cytoplasmic post-processing algorithm (CPPA) is applied for cytoplasmic segmentation. CPPA uses a binarized segmentation image to remove non-segmented pixels from the NAD(P)H image and then applies an intensity-based threshold to identify nuclei regions. Errors at cell edges are removed using a distance transform algorithm. The nucleus mask is then subtracted from the cell segmented image to yield the cytoplasm mask image. CPPA was tested on five NAD(P)H images of three different cell samples, quiescent T cells, activated T cells, and MCF7 cells.

RESULTS

Using POSEA, an evaluation method tailored for instance segmentation, the CPPA yielded F-measure values of 0.89, 0.87, and 0.94 for quiescent T cells, activated T cells, and MCF7 cells, respectively, for cytoplasm identification of hand-segmented cells. CPPA achieved F-measure values of 0.84, 0.74, and 0.72 for Cellpose segmented cells.

CONCLUSION

These results exceed the F-measure value of a comparative cell segmentation method (CellProfiler, ∼0.50-0.60) and support the use of artificial intelligence and post-processing techniques for accurate segmentation of autofluorescence images for single-cell metabolic analyses.

Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs

The Edmonds Blossom algorithm is implemented here using depth-first search, which is intrinsically serial. By streamlining the code, our serial implementation is consistently three to five times faster than the previously fastest general graph matching code. By extracting parallelism across iterations of the algorithm, with coarse-grain locking, we are able to further reduce the run time on random regular graphs four-fold and obtain a two-fold reduction of run time on real-world graphs with similar topology. Solving very sparse graphs (average degree less than four) exhibiting community structure with eight threads led to a slow down of three-fold, but this slow down is replaced by marginal speed up once the average degree is greater than four. We conclude that our parallel coarse-grain locking implementation performs well when extracting parallelism from this augmenting-path-based algorithm and may work well for similar algorithms.

Parallel Maximum Cardinality Matching for General Graphs on GPUs

The matching problem formulated as Maximum Cardinality Matching in General Graphs (MCMGG) finds the largest matching on graphs without restrictions. The Micali-Vazirani algorithm has the best asymptotic complexity for solving MCMGG when the graphs are sparse. Parallelizing matching in general graphs on the GPU is difficult for multiple reasons. First, the augmenting path procedure is highly recursive, and NVIDIA GPUs use registers to store kernel arguments, which eventually spill into cached device memory, with a performance penalty. Second, extracting parallelism from the matching process requires partitioning the graph to avoid any overlapping augmenting paths. We propose an implementation of the Micali-Vazirani algorithm which identifies bridge edges using thread-parallel breadth-first search, followed by block-parallel path augmentation and blossom contraction. Augmenting path and Union-find methods were implemented as stack-based iterative methods, with a stack allocated in shared memory. Our experimentation shows that compared to the serial implementation, our approach results in up to 15-fold speed-up for very sparse regular graphs, up to 5-fold slowdown for denser regular graphs, and finally a 50-fold slowdown for power-law distributed Kronecker graphs. This implementation has been open-sourced for further research on developing combinatorial graph algorithms on GPUs.

Parallel path detection for fraudulent accounts in banks based on graph analysis

This article presents a novel parallel path detection algorithm for identifying suspicious fraudulent accounts in large-scale banking transaction graphs. The proposed algorithm is based on a three-step approach that involves constructing a directed graph, shrinking strongly connected components, and using a parallel depth-first search algorithm to mark potentially fraudulent accounts. The algorithm is designed to fully exploit CPU resources and handle large-scale graphs with exponential growth. The performance of the algorithm is evaluated on various datasets and compared with serial time baselines. The results demonstrate that our approach achieves high performance and scalability on multi-core processors, making it a promising solution for detecting suspicious accounts and preventing money laundering schemes in the banking industry. Overall, our work contributes to the ongoing efforts to combat financial fraud and promote financial stability in the banking sector.

Hybrid harmony search algorithm for social network contact tracing of COVID-19

The coronavirus disease 2019 (COVID-19) was first reported in December 2019 in Wuhan, China, and then moved to almost every country showing an unprecedented outbreak. The world health organization declared COVID-19 a pandemic. Since then, millions of people were infected, and millions have lost their lives all around the globe. By the end of 2020, effective vaccines that could prevent the fast spread of the disease started to loom on the horizon. Nevertheless, isolation, social distancing, face masks, and quarantine are the best-known measures, in the time being, to fight the pandemic. On the other hand, contact tracing is an effective procedure in tracking infections and saving others' lives. In this paper, we devise a new approach using a hybrid harmony search (HHS) algorithm that casts the problem of finding strongly connected components (SCCs) to contact tracing. This new approach is named as hybrid harmony search contact tracing (HHS-CT) algorithm. The hybridization is achieved by integrating the stochastic hill climbing into the operators' design of the harmony search algorithm. The HHS-CT algorithm is compared to other existing algorithms of finding SCCs in directed graphs, where it showed its superiority over these algorithms. The devised approach provides a 77.18% enhancement in terms of run time and an exceptional average error rate of 1.7% compared to the other existing algorithms of finding SCCs.

Symbolic Coloured SCC Decomposition

Problems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous in the number of both vertices and colours. Given such a graph, the original problem frequently translates to the detection of the graph’s strongly connected components, which is challenging at this scale.

We propose a new, symbolic algorithm that computes all the monochromatic strongly connected components of an edge-coloured graph. In the worst case, the algorithm performs \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(p\cdot n\cdot \log n)$$\end{document}O(p·n·logn) symbolic steps, where p is the number of colours and n the number of vertices. We evaluate the algorithm using an experimental implementation based on Binary Decision Diagrams (BDDs) and large (up to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{48}$$\end{document}248) coloured graphs produced by models appearing in systems biology.

Automated Verification of Parallel Nested DFS

Model checking algorithms are typically complex graph algorithms, whose correctness is crucial for the usability of a model checker. However, establishing the correctness of such algorithms can be challenging and is often done manually. Mechanising the verification process is crucially important, because model checking algorithms are often parallelised for efficiency reasons, which makes them even more error-prone. This paper shows how the VerCors concurrency verifier is used to mechanically verify the parallel nested depth-first search (NDFS) graph algorithm of Laarman et al. [25]. We also demonstrate how having a mechanised proof supports the easy verification of various optimisations of parallel NDFS. As far as we are aware, this is the first automated deductive verification of a multi-core model checking algorithm.

Efficiently Detecting Protein Complexes from Protein Interaction Networks via Alternating Direction Method of Multipliers

Protein complexes are crucial in improving our understanding of the mechanisms employed by proteins. Various computational algorithms have thus been proposed to detect protein complexes from protein interaction networks. However, given massive protein interactome data obtained by high-throughput technologies, existing algorithms, especially those with additionally consideration of biological information of proteins, either have low efficiency in performing their tasks or suffer from limited effectiveness. For addressing this issue, this work proposes to detect protein complexes from a protein interaction network with high efficiency and effectiveness. To do so, the original detection task is first formulated into an optimization problem according to the intuitive properties of protein complexes. After that, the framework of alternating direction method of multipliers is applied to decompose this optimization problem into several subtasks, which can be subsequently solved in a separate and parallel manner. An algorithm for implementing this solution is then developed. Experimental results on five large protein interaction networks demonstrated that compared to state-of-the-art protein complex detection algorithms, our algorithm outperformed them in terms of both effectiveness and efficiency. Moreover, as number of parallel processes increases, one can expect an even higher computational efficiency for the proposed algorithm with no compromise on effectiveness.

Dependence of prevalence of contiguous pathways in proteins on structural complexity

Allostery is a regulatory mechanism in proteins where an effector molecule binds distal from an active site to modulate its activity. Allosteric signaling may occur via a continuous path of residues linking the active and allosteric sites, which has been suggested by large conformational changes evident in crystal structures. An alternate possibility is that the signal occurs in the realm of ensemble dynamics via an energy landscape change. While the latter was first proposed on theoretical grounds, increasing evidence suggests that such a control mechanism is plausible. A major difficulty for testing the two methods is the ability to definitively determine that a residue is directly involved in allosteric signal transduction. Statistical Coupling Analysis (SCA) is a method that has been successful at predicting pathways, and experimental tests involving mutagenesis or domain substitution provide the best available evidence of signaling pathways. However, ascertaining energetic pathways which need not be contiguous is far more difficult. To date, simple estimates of the statistical significance of a pathway in a protein remain to be established. The focus of this work is to estimate such benchmarks for the statistical significance of contiguous pathways for the null model of selecting residues at random. We found that when 20% of residues in proteins are randomly selected, contiguous pathways at the 6 Å cutoff level were found with success rates of 51% in PDZ, 30% in p53, and 3% in MutS. The results suggest that the significance of pathways may have system specific factors involved. Furthermore, the possible existence of false positives for contiguous pathways implies that signaling could be occurring via alternate routes including those consistent with the energetic landscape model.

An Efficient Approach for Accelerating Bucket Elimination on GPUs

Bucket elimination (BE) is a framework that encompasses several algorithms, including belief propagation (BP) and variable elimination for constraint optimization problems (COPs). BE has significant computational requirements that can be addressed by using graphics processing units (GPUs) to parallelize its fundamental operations, i.e., composition and marginalization, which operate on functions represented by large tables. We propose a novel approach to parallelize these operations with GPUs, which optimizes the table layout so to achieve better performance in terms of increased speedup and scalability. Our approach allows us to process incomplete tables (i.e., tables with some missing variables assignments), which often occur in several practical applications (such as the ones we consider in our dataset). Finally, we can process tables that are larger than the GPU memory. Our approach outperforms the state-of-the-art technique to parallelize BP on GPUs, achieving better speedups (up to +466% with respect to such parallel technique). We test our method on a publicly available COP dataset, measuring a speedup up to with respect to the sequential version. The ability of our technique to process large tables is crucial in this scenario, in which most of the instances generate tables larger than the GPU memory, and hence they cannot be solved with previous GPU techniques related to BE.

An efficient distributed algorithm for constructing spanning trees in wireless sensor networks

Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.

Dynamical modeling and analysis of large cellular regulatory networks

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Computational tools for guided discovery and engineering of metabolic pathways

With a high demand for increasingly diverse chemicals, as well as sustainable synthesis for many existing chemicals, the chemical industry is increasingly looking to biosynthesis. The majority of biosynthesis examples of useful chemicals are either native metabolites made by an organism or the heterologous expression of known metabolic pathways into a more amenable host. For chemicals that no known biosynthetic route exists, engineers are increasingly relying on automated computational algorithms, as described here, to identify potential metabolic pathways. In this chapter, we review a broad range of approaches to predict novel metabolic pathways. Broadly, these can rely on biochemical databases to assemble known reactions into a new pathway or rely on generalized biochemical rules to predict unobserved enzymatic reactions that are likely feasible. Many programs are freely available and immediately useable by non-computationally experienced scientists.