33
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Construction of a map-based reference genome sequence for barley, Hordeum vulgare L.

      , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
      Scientific Data
      Springer Nature

      Read this article at

          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references35

          • Record: found
          • Abstract: found
          • Article: not found

          FLASH: fast length adjustment of short reads to improve genome assemblies.

          Next-generation sequencing technologies generate very large numbers of short reads. Even with very deep genome coverage, short read lengths cause problems in de novo assemblies. The use of paired-end libraries with a fragment size shorter than twice the read length provides an opportunity to generate much longer reads by overlapping and merging read pairs before assembling a genome. We present FLASH, a fast computational tool to extend the length of short reads by overlapping paired-end reads from fragment libraries that are sufficiently short. We tested the correctness of the tool on one million simulated read pairs, and we then applied it as a pre-processor for genome assemblies of Illumina reads from the bacterium Staphylococcus aureus and human chromosome 14. FLASH correctly extended and merged reads >99% of the time on simulated reads with an error rate of <1%. With adequately set parameters, FLASH correctly merged reads over 90% of the time even when the reads contained up to 5% errors. When FLASH was used to extend reads prior to assembly, the resulting assemblies had substantially greater N50 lengths for both contigs and scaffolds. The FLASH system is implemented in C and is freely available as open-source code at http://www.cbcb.umd.edu/software/flash. t.magoc@gmail.com.
            Bookmark
            • Record: found
            • Abstract: found
            • Book: not found

            Molecular Cloning : A Laboratory Manual

            <p>The first two editions of this manual have been mainstays of molecular biology for nearly twenty years, with an unrivalled reputation for reliability, accuracy, and clarity.<br>In this new edition, authors Joseph Sambrook and David Russell have completely updated the book, revising every protocol and adding a mass of new material, to broaden its scope and maintain its unbeatable value for studies in genetics, molecular cell biology, developmental biology, microbiology, neuroscience, and immunology.<br>Handsomely redesigned and presented in new bindings of proven durability, this three–volume work is essential for everyone using today’s biomolecular techniques.<br>The opening chapters describe essential techniques, some well–established, some new, that are used every day in the best laboratories for isolating, analyzing and cloning DNA molecules, both large and small.<br>These are followed by chapters on cDNA cloning and exon trapping, amplification of DNA, generation and use of nucleic acid probes, mutagenesis, and DNA sequencing.<br>The concluding chapters deal with methods to screen expression libraries, express cloned genes in both prokaryotes and eukaryotic cells, analyze transcripts and proteins, and detect protein–protein interactions.<br>The Appendix is a compendium of reagents, vectors, media, technical suppliers, kits, electronic resources and other essential information.<br>As in earlier editions, this is the only manual that explains how to achieve success in cloning and provides a wealth of information about why techniques work, how they were first developed, and how they have evolved. </p>
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Shortest Connection Networks And Some Generalizations

              R. Prim (1957)
                Bookmark

                Author and article information

                Journal
                Scientific Data
                Sci. Data
                Springer Nature
                2052-4463
                April 27 2017
                April 27 2017
                : 4
                :
                : 170044
                Article
                10.1038/sdata.2017.44
                a608bd6c-e546-46a0-b30f-3330d7e0cfdd
                © 2017
                History

                Comments

                Comment on this article