Boolean logic algebra driven similarity measure for text based applications.
Ontology highlight
ABSTRACT:
SUBMITTER: Abdalla HI
PROVIDER: S-EPMC8330432 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Among the promising approaches for implementing high-performance computing, reconfigurable logic gates and logic-in-memory (LIM) approaches have been drawing increased research attention. These allow for improved functional scaling of a chip, owing to the improved functionality per unit area. Although numerous studies have been conducted independently for either reconfigurable logic or LIM units, attempts to construct a hybrid structure based on reconfigurable logic and LIM units remain relatively rare. In this study, we merge reconfigurable logic gates and LIM units to achieve a universal logic-in-memory (ULIM) cell for enabling all basic Boolean logic operations and data storage in a single cell. A ULIM cell consisting of silicon memory devices with reconfigurable n- and p-program modes can reconfigure logic operations within the complete set of Boolean logic operations. Moreover, the ULIM cell exhibits memory behaviors for storing output logic values without supply voltages for a certain period, resulting in zero static power consumption. Hence, this study provides a way to realize high-performance electronics by utilizing the silicon devices with a hybrid function of reconfigurable logic and LIM.
| S-EPMC9684131 | biostudies-literature
Project description:MotivationBeyond identifying genetic variants, we introduce a set of Boolean relations, which allows for a comprehensive classification of the relations of every pair of variants by taking all minimal alignments into account. We present an efficient algorithm to compute these relations, including a novel way of efficiently computing all minimal alignments within the best theoretical complexity bounds.ResultsWe show that these relations are common, and many non-trivial, for variants of the CFTR gene in dbSNP. Ultimately, we present an approach for the storing and indexing of variants in the context of a database that enables efficient querying for all these relations.Availability and implementationA Python implementation is available at https://github.com/mutalyzer/algebra/tree/v0.2.0 as well as an interface at https://mutalyzer.nl/algebra.
| S-EPMC9879725 | biostudies-literature
Project description:We present a potential new mode of natural computing in which simple, heat-driven fluid flows perform Boolean logic operations. The system comprises a two-dimensional single-phase fluid that is heated from below and cooled from above, with two obstacles placed on the horizontal mid-plane. The obstacles remove all vertical momentum that flows into them. The horizontal momentum extraction of the obstacles is controlled in a binary fashion, and constitutes the 2-bit input. The output of the system is a thresholded measure of the energy extracted by the obstacles. Due to the existence of multiple attractors in the phase space of this system, the input-output relationships are equivalent to those of the OR, XOR or NAND gates, depending on the threshold and obstacle separation. The ability to reproduce these logical operations suggests that convective flows might have the potential to perform more general computations, despite the fact that they do not involve electronics, chemistry or multiple fluid phases.
| S-EPMC6735482 | biostudies-literature
Project description:MotivationA major goal of personalized medicine in oncology is the optimization of treatment strategies given measurements of the genetic and molecular profiles of cancer cells. To further our knowledge on drug sensitivity, machine learning techniques are commonly applied to cancer cell line panels.ResultsWe present a novel integer linear programming (ILP) formulation, called MEthod for Rule Identification with multi-omics DAta (MERIDA), for predicting the drug sensitivity of cancer cells. The method represents a modified version of the LOBICO method by Knijnenburg et al. and yields easily interpretable models amenable to a Boolean logic based interpretation. Since the proposed altered logical rules lead to an enormous acceleration of the running times of MERIDA compared to LOBICO, we can not only consider larger input feature sets integrated from genetic and molecular omics data but also build more comprehensive models that mirror the complexity of cancer initiation and progression. Moreover, we enable the inclusion of a priori knowledge that can either stem from biomarker databases or can also be newly acquired knowledge gathered iteratively by previous runs of MERIDA. Our results show that this approach does not only lead to an improved predictive performance but also identifies a variety of putative sensitivity and resistance biomarkers. We also compare our approach to state-of-the-art machine learning methods and demonstrate the superior performance of our method. Hence, MERIDA has great potential to deepen our understanding of the molecular mechanisms causing drug sensitivity or resistance.Availability and implementationThe corresponding code is available on github (https://github.com/unisb-bioinf/MERIDA.git).Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC8570817 | biostudies-literature
Project description:The ability to perform molecular-level computation in mammalian cells has the potential to enable a new wave of sophisticated cell-based therapies and diagnostics. To this end, we developed a Boolean logic framework utilizing artificial Cys(2)-His(2) zinc finger transcription factors (ZF-TFs) as computing elements. Artificial ZFs can be designed to specifically bind different DNA sequences and thus comprise a diverse set of components ideal for the construction of scalable networks. We generate ZF-TF activators and repressors and demonstrate a novel, general method to tune ZF-TF response by fusing ZF-TFs to leucine zipper homodimerization domains. We describe 15 transcriptional activators that display 2- to 463-fold induction and 15 transcriptional repressors that show 1.3- to 16-fold repression. Using these ZF-TFs, we compute OR, NOR, AND and NAND logic, employing hybrid promoters and split intein-mediated protein splicing to integrate signals. The split intein strategy is able to fully reconstitute the ZF-TFs, maintaining them as a uniform set of computing elements. Together, these components comprise a robust platform for building mammalian synthetic gene circuits capable of precisely modulating cellular behavior.
| S-EPMC3367183 | biostudies-literature
Project description:Living cells can process rapidly and simultaneously multiple extracellular input signals through the complex networks of evolutionary selected biomolecular interactions and chemical transformations. Recent approaches to molecular computation have increasingly sought to mimic or exploit various aspects of biology. A number of studies have adapted nucleic acids and proteins to the design of molecular logic gates and computational systems, while other works have affected computation in living cells via biochemical pathway engineering. Here we report that de novo designed synthetic peptide networks can also mimic some of the basic logic functions of the more complex biological networks. We show that segments of a small network whose graph structure is composed of five nodes and 15 directed edges can express OR, NOR, and NOTIF logic.
| S-EPMC1829323 | biostudies-literature
Project description:The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger fraction of these proteins compared with regular HKs. Microbial cells are thus theoretically unbounded in mapping distinct environmental signals onto distinct physiological states and perform complex computations on them. These findings facilitate the understanding of natural two-component systems and allow their engineering through synthetic biology.
| S-EPMC4528588 | biostudies-literature
Project description:Biological systems contain a large number of molecules that have diverse interactions. A fruitful path to understanding these systems is to represent them with interaction networks, and then describe flow processes in the network with a dynamic model. Boolean modeling, the simplest discrete dynamic modeling framework for biological networks, has proven its value in recapitulating experimental results and making predictions. A first step and major roadblock to the widespread use of Boolean networks in biology is the laborious network inference and construction process. Here we present a streamlined network inference method that combines the discovery of a parsimonious network structure and the identification of Boolean functions that determine the dynamics of the system. This inference method is based on a causal logic analysis method that associates a logic type (sufficient or necessary) to node-pair relationships (whether promoting or inhibitory). We use the causal logic framework to assimilate indirect information obtained from perturbation experiments and infer relationships that have not yet been documented experimentally. We apply this inference method to a well-studied process of hormone signaling in plants, the signaling underlying abscisic acid (ABA)-induced stomatal closure. Applying the causal logic inference method significantly reduces the manual work typically required for network and Boolean model construction. The inferred model agrees with the manually curated model. We also test this method by re-inferring a network representing epithelial to mesenchymal transition based on a subset of the information that was initially used to construct the model. We find that the inference method performs well for various likely scenarios of inference input information. We conclude that our method is an effective approach toward inference of biological networks and can become an efficient step in the iterative process between experiments and computations.
| S-EPMC9246059 | biostudies-literature
Project description:BackgroundMore so than face-to-face counseling, users of online text-based services might drop out from a session before establishing a clear closure or expressing the intention to leave. Such premature departure may be indicative of heightened risk or dissatisfaction with the service or counselor. However, there is no systematic way to identify this understudied phenomenon.PurposeThis study has two objectives. First, we developed a set of rules and used logic-based pattern matching techniques to systematically identify premature departures in an online text-based counseling service. Second, we validated the importance of premature departure by examining its association with user satisfaction. We hypothesized that the users who rated the session as less helpful were more likely to have departed prematurely.MethodWe developed and tested a classification model using a sample of 575 human-annotated sessions from an online text-based counseling platform. We used 80% of the dataset to train and develop the model and 20% of the dataset to evaluate the model performance. We further applied the model to the full dataset (34,821 sessions). We compared user satisfaction between premature departure and completed sessions based on data from a post-session survey.ResultsThe resulting model achieved 97% and 92% F1 score in detecting premature departure cases in the training and test sets, respectively, suggesting it is highly consistent with the judgment of human coders. When applied to the full dataset, the model classified 15,150 (43.5%) sessions as premature departure and the remaining 19,671 (56.5%) as completed sessions. Completed cases (15.2%) were more likely to fill the post-chat survey than premature departure cases (4.0%). Premature departure was significantly associated with lower perceived helpfulness and effectiveness in distress reduction.ConclusionsThe model is the first that systematically and accurately identifies premature departure in online text-based counseling. It can be readily modified and transferred to other contexts for the purpose of risk mitigation and service evaluation and improvement.
| S-EPMC8632835 | biostudies-literature
Project description:Precisely defining the roles of specific cell types is an intriguing frontier in the study of intact biological systems and has stimulated the rapid development of genetically encoded tools for observation and control. However, targeting these tools with adequate specificity remains challenging: most cell types are best defined by the intersection of two or more features such as active promoter elements, location and connectivity. Here we have combined engineered introns with specific recombinases to achieve expression of genetically encoded tools that is conditional upon multiple cell-type features, using Boolean logical operations all governed by a single versatile vector. We used this approach to target intersectionally specified populations of inhibitory interneurons in mammalian hippocampus and neurons of the ventral tegmental area defined by both genetic and wiring properties. This flexible and modular approach may expand the application of genetically encoded interventional and observational tools for intact-systems biology.
| S-EPMC4085277 | biostudies-literature