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 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: 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: 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: 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 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: The subject disclosure is directed towards providing data for augmenting an entity-attribute-related task. Pre-processing is preformed on entity-attribute tables extracted from the web, e.g., to provide indexes that are accessible to find data that completes augmentation tasks. The indexes are based on both direct mappings and indirect mappings between tables. Example augmentation tasks include queries for augmented data based on an attribute name or examples, or finding synonyms for augmentation. An online query is efficiently processed by accessing the indexes to return augmented data related to the task.

Abstract: The subject disclosure is directed towards providing data for augmenting an entity-attribute-related task. Pre-processing is preformed on entity-attribute tables extracted from the web, e.g., to provide indexes that are accessible to find data that completes augmentation tasks. The indexes are based on both direct mappings and indirect mappings between tables. Example augmentation tasks include queries for augmented data based on an attribute name or examples, or finding synonyms for augmentation. An online query is efficiently processed by accessing the indexes to return augmented data related to the task.