It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Effective machine-learning assembly for next-generation amplicon sequencing with very low coverage [RAW_REF_TEXT] Louis Ranjard 1 , [/RAW_REF_TEXT] [RAW_REF_TEXT] Thomas K. F. Wong1 & [/RAW_REF_TEXT] [RAW_REF_TEXT] Allen G. Rodrigo1 [/RAW_REF_TEXT] BMC Bioinformatics volume 21, Article number: 24 (2020) Cite this article [RAW_REF_TEXT] 248 Accesses [/RAW_REF_TEXT] [RAW_REF_TEXT] 3 Altmetric [/RAW_REF_TEXT] [RAW_REF_TEXT] Metrics details [/RAW_REF_TEXT] [RAW_REF_TEXT] The original article was published in BMC Bioinformatics 2019 20:654 [/RAW_REF_TEXT] Correction to: BMC Bioinform https://doi.org/10.1186/s12859-019-3287-2 Following publication of the original article [1], the author reported that there are several errors in the original article; [RAW_REF_TEXT] 1. The short-reads originate from a western-grey kangaroo amplicon of length 5,130bp with 5× coverage, therefore the expected number of bases covered is ∼25, 000 (dashed line) Full size image Fig. 2 figure2 Number of errors and length in nucleotide of the reconstructed amplicon for each bioinformatic pipeline and simulation settings. The 95% intervals are shown as solid lines for each method along both dimensions (reconstructed amplicon length and error rate) Full size image Fig. 3 figure3 With more than 20× coverage, the de Bruijn graph assembly is able to reconstruct the expected amplicon length (5,130bp) Full size image Fig. 4 figure4 Increasing the number of mapping iteration of the same reads does improve the number of aligned reads, measured as number of bases covered, but only to a limited extend. Effective machine-learning assembly for next-generation amplicon sequencing with very low coverage [RAW_REF_TEXT] Louis Ranjard 1 , Thomas K. F. Wong1 & Allen G. Rodrigo1 [/RAW_REF_TEXT] BMC Bioinformatics volume 21, Article number: 24 (2020) Cite this article [RAW_REF_TEXT] 248 Accesses 3 Altmetric Metrics details The original article was published in BMC Bioinformatics 2019 20:654 [/RAW_REF_TEXT] Correction to: BMC Bioinform https://doi.org/10.1186/s12859-019-3287-2 Following publication of the original article [1], the author reported that there are several errors in the original article; [RAW_REF_TEXT] 1.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer