Abstract: Systems and methods of the present disclosure enable automated analyses of a biological sample using a processing system by receiving signal profiles of each allele of a set of cells in the sample. A set of allele vectors are determined based on a mapping of the magnitude of the measurement of each signal profile at each locus to an index location. A set of cell vectors is generated by concatenating each allele vector of each cell. A cluster model is utilized to generate clusters of the signal profiles based on the set of cell vectors to represent contributors. A first likelihood of a target contributor matching a contributor and a second likelihood of the target contributor not matching any contributor are determined by comparing the target signal profile to each cluster. A likelihood ratio is determined from a ratio of the first likelihood and the second likelihood.

Abstract: Computerized analysis methods and systems to implement the computerized analysis methods are disclosed herein. Specifically, the present disclosure relates to systems and methods for determining an unknown characteristic of a sample.

Abstract: Computerized analysis methods and systems to implement the computerized analysis methods are disclosed herein. Specifically, the present disclosure relates to systems and methods for determining an unknown characteristic of a sample.

Abstract: In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided.

Abstract: In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided.

Abstract: A method and computer program product for performing minimum cost routing with network coding is presented. The method and system model a network as a directed graph. A cost per unit flow is associated with each link of the directed graph. A link capacity is associated with each link of the directed graph. A network code is then computed that sets up a routing connection that achieves an optimal cost using the cost per unit flow for each link of the directed graph and using the link capacity for each link of the directed graph.