Abstract: Methods, computer systems, computer-storage media, and graphical user interfaces are provided for facilitating data transformations, according to embodiments of the present invention. In one embodiment, a set of example values including example input values that indicate data values to be transformed and example output values that indicate a desired form in which to transform data. Based on the set of example values, a data transformation function that is relevant to the set of example values is identified. The data transformation function is used to generate a transformation program to transform the example input values to the desired form in which to transform data. A suggestion of the transformation program can be provided to a user device, wherein selection of the transformation program suggestion results in a data transformation.

Abstract: A molecular state machine is implemented in a cell by designing the cell to use specific homology directed repair (“HDR”) templates for repairing double strand breaks in polynucleotides based on a current “state” of the cell. The state may be established by the presence of a molecule in the cell or by the availability of specific cut sites in the polynucleotides of the cell. Different HDR templates or different nucleases may be available for performing HDR based on the state. When the state is changed, the same signal or event will result in a different HDR template being incorporated into the existing polynucleotides of the cell. Signals that are internal or external to the cell may be used to change the state of the cell. The cell may create a log of molecular events, store binary data, or perform other synthetic biology/molecular computing functions based on state.

Abstract: Gene expression can be identified by analyzing a DNA sequence. The DNA sequence can include a barcode sequence that corresponds to a particular gene. The barcode sequence can be produced during the expression of a gene by first adding a Homologous Directed Repair (HDR) template including the barcode sequence into the DNA sequence of the gene and then splicing the barcode sequence out of an RNA precursor during the expression of the gene. As the barcode sequence is made available from the RNA precursor, it can be added to the DNA strand using HDR. The resulting DNA strand can be sequenced and the sequence data can be analyzed to identify the barcode sequence within the DNA sequence, which provides an indicator of the expression of the gene in DNA rather than RNA.

Abstract: A molecular state machine is implemented in a cell by designing the cell to use specific homology directed repair (“HDR”) templates for repairing double strand breaks in polynucleotides based on a current “state” of the cell. The state may be established by the presence of a molecule in the cell or by the availability of specific cut sites in the polynucleotides of the cell. Different HDR templates or different nucleases may be available for performing HDR based on the state. When the state is changed, the same signal or event will result in a different HDR template being incorporated into the existing polynucleotides of the cell. Signals that are internal or external to the cell may be used to change the state of the cell. The cell may create a log of molecular events, store binary data, or perform other synthetic biology/molecular computing functions based on state.

Abstract: Gene expression can be identified by analyzing a DNA sequence. The DNA sequence can include a barcode sequence that corresponds to a particular gene. The barcode sequence can be produced during the expression of a gene by first adding a Homologous Directed Repair (HDR) template including the barcode sequence into the DNA sequence of the gene and then splicing the barcode sequence out of an RNA precursor during the expression of the gene. As the barcode sequence is made available from the RNA precursor, it can be added to the DNA strand using HDR. The resulting DNA strand can be sequenced and the sequence data can be analyzed to identify the barcode sequence within the DNA sequence, which provides an indicator of the expression of the gene in DNA rather than RNA.

Abstract: The techniques discussed herein leverage structure within data of a corpus to parse unstructured data to obtain structured data and/or to predict latent data that is related to the unstructured and/or structured data. In some examples, parsing and/or predicting can be conducted at varying levels of granularity. In some examples, parsing and/or predicting can be iteratively conducted to improve accuracy and/or to expose more hidden data.

Abstract: A log of molecular events experienced by a cell and timing indicators for those events are stored in existing polynucleotides through a process of creating a double strand break (“DSB”) in a polynucleotide and inserting a new polynucleotide sequence by repairing the DSB with homology directed repair (“HDR”). The presence, order, and number of new polynucleotide sequences provides a log of events and timing of those events. Cellular mechanisms for creating the DSB and/or repairing with HDR are regulated by intra- or extra-cellular signals. When the log is created in the DNA of a cell, the changes may be heritably passed to subsequent generations of the cell. A correlation between the cellular signals and sequence of inserted HDR templates allows for identification of events and the timing experienced by the cell.

Abstract: Information is stored in existing DNA through an iterative process of creating a break in dsDNA and adding new DNA by repairing the break with a homologous repair template. The order and sequence of DNA sequences added to the breaks in the dsDNA can encode binary data. By using a context-dependent encoding scheme, three unique homologous repair templates can encode an unbounded number of bits. When the existing DNA is in a cell, the changes are heritably passed to subsequent generations of the cell. Synthesis of the homologous repair templates may be under the control of a promoter and operator. Intra- or extra-cellular signals may regulate the synthesis of homologous repair templates.

Abstract: A table corpus processing server identifies concepts within enterprise domain data. The table corpus processing server is configured to iteratively group values in a table corpus based on co-occurrence statistics to produce a candidate hierarchical tree. The candidate hierarchical tree is then summarized by selecting nodes that can best “describe” the original corpus, which leads to a small tree that often corresponds to desired concept hierarchies. The table corpus processing server employs a parallel dynamic programming approach that allows the disclosed embodiments to scale with amount of enterprise domain data being analyzed.

Abstract: Concept expansion using tables, such as web tables, can return entities belonging to a concept based on an input of the concept and at least one seed entity that belongs to the concept. A concept expansion frontend can receive the concept and seed entity and provide them to a concept expansion framework. The concept expansion framework can expand the coverage of entities for concepts, including tail concepts, using tables by leveraging rich content signals corresponding to concept names. Such content signals can include content matching the concept that appear in captions, early headings, page titles, surrounding text, anchor text, and queries for which the page has been clicked. The concept expansion framework can use the structured entities in tables to infer exclusive tables. Such inference differs from previous label propagation methods and involves modeling a table-entity relationship. The table-entity relationship reduces semantic drift without using a reference ontology.

Abstract: A system and method is provided for generating a dynamic comprehensive domain review. A domain review engine obtains authoritative literature associated with a domain to extract insights using entity recognition and relationship extraction, and ranks the extracted results to generate a dynamic domain review.

Abstract: Information is stored in existing DNA through an iterative process of creating a break in dsDNA and adding new DNA by repairing the break with a homologous repair template. The order and sequence of DNA sequences added to the breaks in the dsDNA can encode binary data. By using a context-dependent encoding scheme, three unique homologous repair templates can encode an unbounded number of bits. When the existing DNA is in a cell, the changes are heritably passed to subsequent generations of the cell. Synthesis of the homologous repair templates may be under the control of a promoter and operator. Intra- or extra-cellular signals may regulate the synthesis of homologous repair templates.

Abstract: A molecular state machine is implemented in a cell by designing the cell to use specific homology directed repair (“HDR”) templates for repairing double strand breaks in polynucleotides based on a current “state” of the cell. The state may be established by the presence of a molecule in the cell or by the availability of specific cut sites in the polynucleotides of the cell. Different HDR templates or different nucleases may be available for performing HDR based on the state. When the state is changed, the same signal or event will result in a different HDR template being incorporated into the existing polynucleotides of the cell. Signals that are internal or external to the cell may be used to change the state of the cell. The cell may create a log of molecular events, store binary data, or perform other synthetic biology/molecular computing functions based on state.

Abstract: The techniques discussed herein leverage structure within data of a corpus to parse unstructured data to obtain structured data and/or to predict latent data that is related to the unstructured and/or structured data. In some examples, parsing and/or predicting can be conducted at varying levels of granularity. In some examples, parsing and/or predicting can be iteratively conducted to improve accuracy and/or to expose more hidden data.

Abstract: The techniques discussed herein leverage structure within data of a corpus to parse unstructured data to obtain structured data and/or to predict latent data that is related to the unstructured and/or structured data. In some examples, parsing and/or predicting can be conducted at varying levels of granularity. In some examples, parsing and/or predicting can be iteratively conducted to improve accuracy and/or to expose more hidden data.

Abstract: The techniques described herein are directed to robust matching for identity screening. In some examples, the techniques can include generating a similarity score for received identity information compared to a reference record. In some examples, the techniques can utilize a region associated with the received identity information to weight tokens composing the identity information or of the reference record to adjust the similarity score. Moreover, the techniques can include multiple tokenizers, transformation providers, and token weight providers and the techniques can be configured to select between the multiple tokenizers, transformation providers, and token weight providers based at least in part on a region to improve the accuracy of the similarity score. The techniques can determine whether or not to flag or otherwise affirm an identity of an individual or entity associated with the entity information based at least in part on the similarity score.

Abstract: This disclosure provides for a system, method, and computer-readable medium for implementing a table corpus processing server that identifies concepts within enterprise domain data. The table corpus processing server is configured to iteratively group values in a table corpus based on co-occurrence statistics to produce a candidate hierarchical tree. The candidate hierarchical tree is then summarized by selecting nodes that can best “describe” the original corpus, which leads to a small tree that often corresponds to desired concept hierarchies. The table corpus processing server employs a parallel dynamic programming approach that allows the disclosed embodiments to scale with amount of enterprise domain data being analyzed.

Abstract: A system and method is provided for generating a dynamic comprehensive domain review. A domain review engine obtains authoritative literature associated with a domain to extract insights using entity recognition and relationship extraction, and ranks the extracted results to generate a dynamic domain review.

Abstract: A database implemented by storing information encoded in DNA molecules provides high information density but the information is more difficult to access than in conventional electronic storage media. A relational database is a way of organizing information by using multiple related tables. Relational algebra operations are performed on relational databases to locate and manipulate information. This disclosure provides techniques for implementing relational algebra operations on a relational database that uses DNA molecules to store information. The techniques of this disclosure relate to the structure of DNA molecules used to store the information and to correlations between relational algebra operations and manipulations of DNA molecules.

Abstract: A molecular state machine is implemented in a cell by designing the cell to use specific homology directed repair (“HDR”) templates for repairing double strand breaks in polynucleotides based on a current “state” of the cell. The state may be established by the presence of a molecule in the cell or by the availability of specific cut sites in the polynucleotides of the cell. Different HDR templates or different nucleases may be available for performing HDR based on the state. When the state is changed, the same signal or event will result in a different HDR template being incorporated into the existing polynucleotides of the cell. Signals that are internal or external to the cell may be used to change the state of the cell. The cell may create a log of molecular events, store binary data, or perform other synthetic biology/molecular computing functions based on state.