Abstract: The efficiency of polymer synthesis is increased by reducing the number of monomer addition cycles needed to create a set of polymer strands. The number of cycles depends on the sequences of the polymer strands and the order in which each type of monomer is made available for addition to the growing strands. Efficiencies are created by grouping the polymer strands into batches such that all the strands in a batch require a similar number of cycles to synthesize. Efficiencies are also created by selecting an order in which the monomers are made available for addition to the growing polymer strands in a batch. Both techniques can be used together. With these techniques, the number of cycles of monomer addition and commensurate reagent use may be reduced by over 10% as compared to naïve synthesis techniques.

Abstract: A technique for clustering DNA reads from polynucleotide sequencing is described. DNA reads with a level of difference that is likely caused by errors in sequencing are grouped together in the same cluster. DNA reads that represent reads of different DNA molecules are placed in different clusters. The clusters are based on edit distance, which is the number of changes necessary to convert a given DNA read into another. The process of forming clusters may be performed iteratively and may use other types of distance that serve as an approximation for edit distance. Well clustered DNA reads provide a starting point for further analysis.

Abstract: The efficiency of polymer synthesis is increased by reducing the number of monomer addition cycles needed to create a set of polymer strands. The number of cycles depends on the sequences of the polymer strands and the order in which each type of monomer is made available for addition to the growing strands. Efficiencies are created by grouping the polymer strands into batches such that all the strands in a batch require a similar number of cycles to synthesize. Efficiencies are also created by selecting an order in which the monomers are made available for addition to the growing polymer strands in a batch. Both techniques can be used together. With these techniques, the number of cycles of monomer addition and commensurate reagent use may be reduced by over 10% as compared to naïve synthesis techniques.

Abstract: Systems and techniques for extracting information-containing payloads from DNA or other polynucleotides are provided. Decoding the sequence of payload regions from multiple polynucleotides to obtain encoded information includes sequencing the molecules with a polynucleotide sequencer. Reads generated by the polynucleotide sequencer can include information from multiple different sources mixed together. Primer sequences present in the reads identify which reads contain information from the same source. A computationally efficient technique for finding primer sequences in the reads includes comparing hashes of the reads and hashes of primer sequences to find an approximate location then computing edit distances between the primer sequences and the reads to find an exact location. Reads that include the same primer sequences may be clustered together. Sequences of the payload regions are extracted based on the locations of the primer sequences.

Abstract: System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations.

Abstract: System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations.