136,403 research outputs found

    A microfluidic oligonucleotide synthesizer

    Get PDF
    De novo gene and genome synthesis enables the design of any sequence without the requirement of a pre-existing template as in traditional genetic engineering methods. The ability to mass produce synthetic genes holds great potential for biological research, but widespread availability of de novo DNA constructs is currently hampered by their high cost. In this work, we describe a microfluidic platform for parallel solid phase synthesis of oligonucleotides that can greatly reduce the cost of gene synthesis by reducing reagent consumption (by 100-fold) while maintaining a 100 pmol synthesis scale so there is no need for amplification before assembly. Sixteen oligonucleotides were synthesized in parallel on this platform and then successfully used in a ligation-mediated assembly method to generate DNA constructs 200 bp in length

    Local De Novo Assembly of RAD Paired-End Contigs Using Short Sequencing Reads

    Get PDF
    Despite the power of massively parallel sequencing platforms, a drawback is the short length of the sequence reads produced. We demonstrate that short reads can be locally assembled into longer contigs using paired-end sequencing of restriction-site associated DNA (RAD-PE) fragments. We use this RAD-PE contig approach to identify single nucleotide polymorphisms (SNPs) and determine haplotype structure in threespine stickleback and to sequence E. coli and stickleback genomic DNA with overlapping contigs of several hundred nucleotides. We also demonstrate that adding a circularization step allows the local assembly of contigs up to 5 kilobases (kb) in length. The ease of assembly and accuracy of the individual contigs produced from each RAD site sequence suggests RAD-PE sequencing is a useful way to convert genome-wide short reads into individually-assembled sequences hundreds or thousands of nucleotides long

    Focus: A Graph Approach for Data-Mining and Domain-Specific Assembly of Next Generation Sequencing Data

    Get PDF
    Next Generation Sequencing (NGS) has emerged as a key technology leading to revolutionary breakthroughs in numerous biomedical research areas. These technologies produce millions to billions of short DNA reads that represent a small fraction of the original target DNA sequence. These short reads contain little information individually but are produced at a high coverage of the original sequence such that many reads overlap. Overlap relationships allow for the reads to be linearly ordered and merged by computational programs called assemblers into long stretches of contiguous sequence called contigs that can be used for research applications. Although the assembly of the reads produced by NGS remains a difficult task, it is the process of extracting useful knowledge from these relatively short sequences that has become one of the most exciting and challenging problems in Bioinformatics. The assembly of short reads is an aggregative process where critical information is lost as reads are merged into contigs. In addition, the assembly process is treated as a black box, with generic assembler tools that do not adapt to input data set characteristics. Finally, as NGS data throughput continues to increase, there is an increasing need for smart parallel assembler implementations. In this dissertation, a new assembly approach called Focus is proposed. Unlike previous assemblers, Focus relies on a novel hybrid graph constructed from multiple graphs at different levels of granularity to represent the assembly problem, facilitating information capture and dynamic adjustment to input data set characteristics. This work is composed of four specific aims: 1) The implementation of a robust assembly and analysis tool built on the hybrid graph platform 2) The development and application of graph mining to extract biologically relevant features in NGS data sets 3) The integration of domain specific knowledge to improve the assembly and analysis process. 4) The construction of smart parallel computing approaches, including the application of energy-aware computing for NGS assembly and knowledge integration to improve algorithm performance. In conclusion, this dissertation presents a complete parallel assembler called Focus that is capable of extracting biologically relevant features directly from its hybrid assembly graph

    Comparison of Material Consumption, Experimental Protocols and Computation Time in DNA Computing

    Get PDF
    One of the major constraints in DNA computation is the exponential increase in material consumption and computation time for larger computation size in DNA computing particularly in critical stages such as initial pool generation and extraction during gel electrophoresis. In DNA computation, both the hybridization-ligation method and parallel overlap assembly method can be utilized to generate the initial pool of all possible solutions. In this paper, we discuss and compare the implementation of N × N Boolean matrix multiplication via in vitro implementation between Hybridization-Ligation Method and Parallel Overlap Assembly Method to show that selection of tools and protocols affect the cost effectiveness of a computation in terms of the material consumption, protocol steps and execution time to compute. In general, the the parallel overlap assembly method performs better than hybridization-ligation method in terms of the three parameters mentioned. The calculations are based on approximation of unique sequence strands required for the computation and not actual calculations on the nmol concentration

    Experimental Progress in Computation by Self-Assembly of DNA Tilings

    Get PDF
    Approaches to DNA-based computing by self-assembly require the use of D. T A nanostructures, called tiles, that have efficient chemistries, expressive computational power: and convenient input and output (I/O) mechanisms. We have designed two new classes of DNA tiles: TAO and TAE, both of which contain three double-helices linked by strand exchange. Structural analysis of a TAO molecule has shown that the molecule assembles efficiently from its four component strands. Here we demonstrate a novel method for I/O whereby multiple tiles assemble around a single-stranded (input) scaffold strand. Computation by tiling theoretically results in the formation of structures that contain single-stranded (output) reported strands, which can then be isolated for subsequent steps of computation if necessary. We illustrate the advantages of TAO and TAE designs by detailing two examples of massively parallel arithmetic: construction of complete XOR and addition tables by linear assemblies of DNA tiles. The three helix structures provide flexibility for topological routing of strands in the computation: allowing the implementation of string tile models
    corecore