×

Lossless compression of the enumeration space of founder line crosses

  • US 9,041,566 B2
  • Filed: 08/30/2013
  • Issued: 05/26/2015
  • Est. Priority Date: 08/30/2013
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer implemented method for providing lossless compression of an enumeration space for genetic founder lines, the computer implemented method comprisingobtaining an input comprising a set of genetic founder lines and a maximum number of generations G, wherein the following is iteratively performed for h=0, 1, . . . , G:

  • generating a set of genetic crossing templates of a height h, wherein each of the set of genetic crossing templates represents a binary tree, the binary tree comprising h levels representing a given generation, each of the h levels comprising a set of nodes wherein when h>

    0 one or more of the h levels of the binary tree correspond to at least one cross between at least one pair of nodes in the set of nodes,wherein each of the set of genetic crossing templates comprises an array of h entries, wherein a position of an entry within the array corresponds to a level in the binary tree represented by the genetic crossing template, each of the h entries in the array comprising a value indicating a number of leaf nodes in the set of nodes for the level in the binary tree; and

    determining if at least a first genetic crossing template in the set of genetic crossing templates is redundant with respect to a second genetic crossing template in the set of genetic crossing templates; and

    based on the at least first genetic crossing template being redundant, removing the at least first genetic crossing template from the set of genetic crossing templates, the removing creating an updated set of genetic crossing templates.

View all claims
  • 6 Assignments
Timeline View
Assignment View
    ×
    ×