<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[微生物组分析]]></title><description><![CDATA[微生物组分析]]></description><link>http://an.forum.genostack.com/category/31</link><generator>RSS for Node</generator><lastBuildDate>Sat, 13 Jun 2026 14:45:42 GMT</lastBuildDate><atom:link href="http://an.forum.genostack.com/category/31.rss" rel="self" type="application/rss+xml"/><pubDate>Tue, 04 Jul 2023 08:02:16 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[RetroTector 是一个发现HERV的软件]]></title><description><![CDATA[<p dir="auto"><a href="https://retrovirology.biomedcentral.com/articles/10.1186/s12977-015-0232-y" rel="nofollow ugc">https://retrovirology.biomedcentral.com/articles/10.1186/s12977-015-0232-y</a><br />
Classification and characterization of human endogenous retroviruses; mosaic forms are common</p>
]]></description><link>http://an.forum.genostack.com/topic/942/retrotector-是一个发现herv的软件</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/942/retrotector-是一个发现herv的软件</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Tue, 04 Jul 2023 08:02:16 GMT</pubDate></item><item><title><![CDATA[Open Source Epidemiologic Statistics for Public Health]]></title><description><![CDATA[<p dir="auto"><a href="https://www.openepi.com/Menu/OE_Menu.htm" rel="nofollow ugc">https://www.openepi.com/Menu/OE_Menu.htm</a></p>
]]></description><link>http://an.forum.genostack.com/topic/919/open-source-epidemiologic-statistics-for-public-health</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/919/open-source-epidemiologic-statistics-for-public-health</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Thu, 08 Jun 2023 07:53:01 GMT</pubDate></item><item><title><![CDATA[Recombinant Sequence Analysis&#x2F;Detection Programs]]></title><description><![CDATA[<p dir="auto"><a href="http://bioinf.man.ac.uk/robertson/recombination/programs.shtml" rel="nofollow ugc">http://bioinf.man.ac.uk/robertson/recombination/programs.shtml</a></p>
]]></description><link>http://an.forum.genostack.com/topic/915/recombinant-sequence-analysis-detection-programs</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/915/recombinant-sequence-analysis-detection-programs</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Tue, 06 Jun 2023 02:16:52 GMT</pubDate></item><item><title><![CDATA[qiime trim truncate]]></title><description><![CDATA[<p dir="auto"><a href="https://forum.qiime2.org/t/nomenclature-issue-trimming-vs-truncation/21101/11" rel="nofollow ugc">https://forum.qiime2.org/t/nomenclature-issue-trimming-vs-truncation/21101/11</a></p>
<p dir="auto">Trimming: The number of base pairs that will be removed from either the 3' or the 5' end. In QIIME 2, you'll most commonly see trim-left (which will trim off the requested number of base pairs from the 5' end), but in qiime feature-classifier extract-reads, there is also a trim-right parameter, which refers to the 3' end.</p>
<p dir="auto">Truncating: The position at which reads will be truncated (counting from the 5' end). Reads that are shorter than the value provided will be discarded. The command you'll see this action represented by within QIIME 2 is trunc-len. Something to note is that in the denoising pipelines within the QIIME 2 core framework, <strong>truncation occurs before trimming.</strong></p>
]]></description><link>http://an.forum.genostack.com/topic/908/qiime-trim-truncate</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/908/qiime-trim-truncate</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Mon, 29 May 2023 09:07:24 GMT</pubDate></item><item><title><![CDATA[构建qiime2 blast genbank数据库]]></title><description><![CDATA[<p dir="auto">rescript 验证<br />
conda create -y -n rescript</p>
<p dir="auto">conda activate rescript</p>
<p dir="auto">conda install   -c conda-forge -c bioconda -c qiime2 -c <a href="https://packages.qiime2.org/qiime2/2023.5/tested/" rel="nofollow ugc">https://packages.qiime2.org/qiime2/2023.5/tested/</a> -c defaults   qiime2 q2cli q2templates q2-types q2-longitudinal q2-feature-classifier 'q2-types-genomics&gt;2023.2'   "pandas&gt;=0.25.3" xmltodict ncbi-datasets-pylib</p>
<p dir="auto">pip install git+https://ghproxy.com//<a href="https://github.com/bokulich-lab/RESCRIPt.git" rel="nofollow ugc">https://github.com/bokulich-lab/RESCRIPt.git</a></p>
<p dir="auto">创建COI库<br />
qiime rescript get-ncbi-data --p-query '(cytochrome c oxidase subunit 1[Title] OR cytochrome c oxidase subunit I[Title] OR cytochrome oxidase subunit 1[Title] OR cytochrome oxidase subunit I[Title] OR COX1[Title] OR CO1[Title] OR COI[Title]) AND BARCODE[KYWD])' --verbose  --output-dir NCBIdata_BOLDonly2 --o-sequences coi_genbank.qza --o-taxonomy coi_tax.qza</p>
<p dir="auto">创建16s库</p>
]]></description><link>http://an.forum.genostack.com/topic/897/构建qiime2-blast-genbank数据库</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/897/构建qiime2-blast-genbank数据库</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Sat, 20 May 2023 08:34:44 GMT</pubDate></item><item><title><![CDATA[鱼类metabarcoding 分析]]></title><description><![CDATA[<p dir="auto"><a href="https://onlinelibrary.wiley.com/doi/full/10.1002/edn3.376" rel="nofollow ugc">https://onlinelibrary.wiley.com/doi/full/10.1002/edn3.376</a><br />
<img src="/assets/uploads/files/1681352714295-f7fa1bf9-2484-4485-ac3d-ffa15c6320bc-image.png" alt="f7fa1bf9-2484-4485-ac3d-ffa15c6320bc-image.png" class=" img-responsive img-markdown" /><br />
这个项目使用了Riaz引物 加入了鸵鸟内控标准品</p>
]]></description><link>http://an.forum.genostack.com/topic/841/鱼类metabarcoding-分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/841/鱼类metabarcoding-分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Thu, 13 Apr 2023 02:26:22 GMT</pubDate></item><item><title><![CDATA[qiime2的物种注释研究]]></title><description><![CDATA[<p dir="auto">eDNA需要部署的流程和数据库：<br />
1.denoise+blast物种注释<br />
2.denoise+bayes物种注释<br />
3.nextflow 全流程<br />
3.denoise+rdp物种注释（这个不需要 classify-sklearn和RDP类似）<br />
4.训练分类数据库:makeblastdb、qiime2_train<br />
5.BOLD数据库、NT数据库、mitofish、silva、unite<br />
6.qiime2的全流程<br />
7.交互式分析工具、blast server<br />
8.nextflow hifi 全长</p>
]]></description><link>http://an.forum.genostack.com/topic/840/qiime2的物种注释研究</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/840/qiime2的物种注释研究</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Wed, 12 Apr 2023 08:59:15 GMT</pubDate></item><item><title><![CDATA[16s 18s混合物]]></title><description><![CDATA[<p dir="auto"><a href="https://astrobiomike.github.io/amplicon/16S_and_18S_mixed" rel="nofollow ugc">https://astrobiomike.github.io/amplicon/16S_and_18S_mixed</a><br />
这个文章使用18S的数据建了一个blast数据库  然后用blast把样本的序列分离了</p>
]]></description><link>http://an.forum.genostack.com/topic/833/16s-18s混合物</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/833/16s-18s混合物</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Thu, 23 Mar 2023 11:21:28 GMT</pubDate></item><item><title><![CDATA[微生物的文献整理]]></title><description><![CDATA[<p dir="auto"><a href="https://www.mdpi.com/1422-0067/23/17/9834/htm" rel="nofollow ugc">https://www.mdpi.com/1422-0067/23/17/9834/htm</a><br />
Combination of Whole Genome Sequencing and Metagenomics for Microbiological Diagnostics<br />
3d091668-c053-4aa3-a2b9-6988c37d1464-image.png</p>
]]></description><link>http://an.forum.genostack.com/topic/767/微生物的文献整理</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/767/微生物的文献整理</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Tue, 27 Sep 2022 07:47:45 GMT</pubDate></item><item><title><![CDATA[https:&#x2F;&#x2F;microbiome.github.io&#x2F;  R微生物分析]]></title><description><![CDATA[<p dir="auto"><a href="https://microbiome.github.io/" rel="nofollow ugc">https://microbiome.github.io/</a></p>
]]></description><link>http://an.forum.genostack.com/topic/763/https-microbiome-github-io-r微生物分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/763/https-microbiome-github-io-r微生物分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Wed, 14 Sep 2022 12:20:17 GMT</pubDate></item><item><title><![CDATA[测序深度计算器]]></title><description><![CDATA[<p dir="auto"><a href="https://www.onecodex.com/microbiome-sequencing/sequencing-calculator/" rel="nofollow ugc">https://www.onecodex.com/microbiome-sequencing/sequencing-calculator/</a><br />
<img src="/assets/uploads/files/1659602448632-5587efd0-7107-46a5-9799-220fea9147d5-image.png" alt="5587efd0-7107-46a5-9799-220fea9147d5-image.png" class=" img-responsive img-markdown" /></p>
]]></description><link>http://an.forum.genostack.com/topic/746/测序深度计算器</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/746/测序深度计算器</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Thu, 04 Aug 2022 08:40:52 GMT</pubDate></item><item><title><![CDATA[基于qiime2的扩增子数据分析]]></title><description><![CDATA[<p dir="auto"><a href="https://drive5.com/usearch/manual/amplification_bias.html" rel="nofollow ugc">https://drive5.com/usearch/manual/amplification_bias.html</a><br />
Abundance and amplification bias in amplicon sequencing<br />
序列的丰度和物种的实际丰度 可能偏差比较大</p>
]]></description><link>http://an.forum.genostack.com/topic/743/基于qiime2的扩增子数据分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/743/基于qiime2的扩增子数据分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Wed, 03 Aug 2022 10:07:59 GMT</pubDate></item><item><title><![CDATA[布鲁氏菌分析]]></title><description><![CDATA[<p dir="auto"><a href="https://github.com/B-UMMI/INNUca" rel="nofollow ugc">https://github.com/B-UMMI/INNUca</a><br />
6d089cdf-0e9e-4cad-925a-321e3bd0bf4a-image.png</p>
]]></description><link>http://an.forum.genostack.com/topic/737/布鲁氏菌分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/737/布鲁氏菌分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Thu, 28 Jul 2022 10:15:44 GMT</pubDate></item><item><title><![CDATA[nanopore 微生物文献分析]]></title><description><![CDATA[<p dir="auto"><a href="https://www.biorxiv.org/content/10.1101/2019.12.21.886028v1.full" rel="nofollow ugc">https://www.biorxiv.org/content/10.1101/2019.12.21.886028v1.full</a><br />
对牛胃微生物做了分析 对比了nanopore和illumina的两种方式<br />
illumina:<br />
quality control was performed by the same sequencing service using the prinseq-lite program</p>
<p dir="auto">the forward- and reverse-reads from the sequencing were joined using the FLASH software (Magoc &amp; Salzberg, 2011).</p>
<p dir="auto">nanopore:<br />
Reads were basecalled and demultiplexed using Guppy<br />
The resulting FASTQ files were used as input of Porechop (Wick R., 2017) for adaptor removal and barcode de-multiplexing</p>
<p dir="auto">FASTQ files were aligned against the NCBI-nr protein database (Nov. 2017) using DIAMOND v0.9.22 (blastx option) setting the -F option to 15, to consider frame-shift errors in the sequences and the – rangeCulling and –top options set to 10 to scan the whole sequence for alignments with a 10% of the best local bit score</p>
<p dir="auto">The taxonomic binning of short reads from Illumina was performed using the daa2rma program from MEGAN Community Edition (CE) v6.11. with the option -a2t, to map the reads to the NCBI-taxonomy mapping file containing protein accessions</p>
<p dir="auto"><strong>Relative taxonomic abundances</strong> were obtained for each samples and platform representing the number of reads assigned to each taxon.</p>
<p dir="auto">Relative abundances, alpha (Shannon and Simpson indexes) and beta diversity -using Bray-Curtis dissimilarity-were analyzed using the phyloseq (McMurdie &amp; Holmes, 2013), vegan (Oksanen et al., 2019), and microbiome R (Leo Lahti et al., 2012-2019) packages.</p>
<p dir="auto">Short reads from the Illumina dataset were assembled using Megahit (Li, Liu, Luo, Sadakane, &amp; Lam, 2015) with the default parameters using the joined forward and reverse reads.</p>
<p dir="auto">The nanopore reads were assembled using Canu (Koren et al., 2017) setting the options minReadLength = 100, minOverlapLength = 100 as the resulting reads were too short for the default parameters (less than 10,000 bp), and genomeSize = 2.5m, as described in the documentation for metagenome assemblies.</p>
<p dir="auto">The quality of the assemblies was assessed using Quast v4.0 (Mikheenko, Valin, Prjibelski, Saveliev, &amp; Gurevich, 2016).</p>
<p dir="auto">Rarefaction curves(稀疏曲线)<br />
<img src="/assets/uploads/files/1655364359642-bb27bb8f-9145-4959-937c-9e6c8676051a-image.png" alt="bb27bb8f-9145-4959-937c-9e6c8676051a-image.png" class=" img-responsive img-markdown" /></p>
<p dir="auto">alpha diversity indexes<br />
<img src="/assets/uploads/files/1655364582570-b4ebba4c-ccc3-4a58-8ff8-9bf6ab7c9369-image.png" alt="b4ebba4c-ccc3-4a58-8ff8-9bf6ab7c9369-image.png" class=" img-responsive img-markdown" /></p>
<p dir="auto">relative abundances<br />
<img src="/assets/uploads/files/1655364553958-c3b83c85-043d-4078-99b8-b4858f368aaf-image.png" alt="c3b83c85-043d-4078-99b8-b4858f368aaf-image.png" class=" img-responsive img-markdown" /></p>
]]></description><link>http://an.forum.genostack.com/topic/696/nanopore-微生物文献分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/696/nanopore-微生物文献分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Thu, 16 Jun 2022 07:38:56 GMT</pubDate></item><item><title><![CDATA[SARS-Cov-2文献阅读]]></title><description><![CDATA[<p dir="auto"><a href="https://www.frontiersin.org/articles/10.3389/fgene.2021.620009/full" rel="nofollow ugc">https://www.frontiersin.org/articles/10.3389/fgene.2021.620009/full</a><br />
Comprehensive Pathogen Identification, Antibiotic Resistance, and Virulence Genes Prediction Directly From Simulated Blood Samples and Positive Blood Cultures by Nanopore Metagenomic Sequencing<br />
对血液感染的肺炎克雷伯菌进行的检测 分析了物种及其耐药性和毒力<br />
Albacore v2.2.6<br />
Porechop v0.2.3<br />
quality control was run through Pauvre v0.1.86<br />
filtered using NanoFilt v2.2.0<br />
Canu v1.6 and nanopolish v0.10.16 were used for nanopore long-read-only assembly and polishing<br />
Unicycler v0.4.5 was also used for hybrid assembly of Illumina reads and nanopore reads<br />
Species identification was performed by Kraken Software v2.0.8-beta  这个文献用Kraken鉴定了nanopore物种<br />
CARD database through RGI v4.2.2 (Resistance Gene Identifier)<br />
Real-time analyses were performed by aligning MinION fastq reads to CARD database v3.0.0 through blastn (blast+, v2.2.28), seeking results with identity ≥80%, hit length ≥100 bp, and gene coverage ≥70%.</p>
]]></description><link>http://an.forum.genostack.com/topic/695/sars-cov-2文献阅读</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/695/sars-cov-2文献阅读</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Wed, 15 Jun 2022 12:46:34 GMT</pubDate></item><item><title><![CDATA[Evaluation of taxonomic profiling methods for long-read shotgun metagenomic sequencing datasets]]></title><description><![CDATA[<p dir="auto"><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-021-04089-5" rel="nofollow ugc">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-021-04089-5</a><br />
7f8690e4-abb9-4c35-8901-628ac328f0ed-image.png</p>
]]></description><link>http://an.forum.genostack.com/topic/690/evaluation-of-taxonomic-profiling-methods-for-long-read-shotgun-metagenomic-sequencing-datasets</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/690/evaluation-of-taxonomic-profiling-methods-for-long-read-shotgun-metagenomic-sequencing-datasets</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Mon, 13 Jun 2022 07:38:52 GMT</pubDate></item><item><title><![CDATA[ASAP 一个细菌分析流程]]></title><description><![CDATA[<p dir="auto"><a href="https://github.com/oschwengers/asap" rel="nofollow ugc">https://github.com/oschwengers/asap</a><br />
A scalable bacterial genome assembly, annotation and analysis pipeline</p>
]]></description><link>http://an.forum.genostack.com/topic/687/asap-一个细菌分析流程</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/687/asap-一个细菌分析流程</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Mon, 13 Jun 2022 04:08:44 GMT</pubDate></item><item><title><![CDATA[metagenlab  diag_pipelines]]></title><description><![CDATA[<p dir="auto"><a href="https://github.com/metagenlab/diag_pipelines" rel="nofollow ugc">https://github.com/metagenlab/diag_pipelines</a></p>
]]></description><link>http://an.forum.genostack.com/topic/686/metagenlab-diag_pipelines</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/686/metagenlab-diag_pipelines</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Mon, 13 Jun 2022 03:24:37 GMT</pubDate></item><item><title><![CDATA[MicroScope]]></title><description><![CDATA[<p dir="auto"><img src="/assets/uploads/files/1655090438685-848492f6-1676-4788-89f1-120238cab509-image-resized.png" alt="848492f6-1676-4788-89f1-120238cab509-image.png" class=" img-responsive img-markdown" /></p>
]]></description><link>http://an.forum.genostack.com/topic/685/microscope</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/685/microscope</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Mon, 13 Jun 2022 03:24:21 GMT</pubDate></item><item><title><![CDATA[毒力分析]]></title><description><![CDATA[<p dir="auto"><a href="https://microscope.readthedocs.io/en/stable/content/compgenomics/virulence.html" rel="nofollow ugc">https://microscope.readthedocs.io/en/stable/content/compgenomics/virulence.html</a><br />
What is VirulenceDB?<br />
VirulenceDB is a virulence genes database build using three sets of data:</p>
<p dir="auto">The core dataset from VFDB (setA), which is composed of genes associated with experimentally verified virulence factors (VFs) for 53 bacterial species</p>
<p dir="auto">The VirulenceFinder dataset which includes virulence genes for Listeria, Staphylococcus aureus, Escherichia coli/Shigella and Enterococcus</p>
<p dir="auto">A manually curated dataset of reference virulence genes for Escherichia coli (Coli_Ref).</p>
<p dir="auto">这个工具把几个毒力鉴定的做了综合</p>
]]></description><link>http://an.forum.genostack.com/topic/684/毒力分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/684/毒力分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Mon, 13 Jun 2022 03:11:44 GMT</pubDate></item><item><title><![CDATA[细菌抗生素耐药性分析]]></title><description><![CDATA[<p dir="auto"><a href="https://www.illumina.com/products/by-type/informatics-products/basespace-sequence-hub/apps/goseqit-aps-bacterial-analysis-pipeline.html" rel="nofollow ugc">https://www.illumina.com/products/by-type/informatics-products/basespace-sequence-hub/apps/goseqit-aps-bacterial-analysis-pipeline.html</a><br />
illumina basespace的耐药基因和毒力的报告<br />
b4189c14-1ef8-4db7-b1c2-afe431ff9dcb-image.png<br />
d188e828-108d-471f-ba3c-aa0b00b38e53-image.png</p>
]]></description><link>http://an.forum.genostack.com/topic/683/细菌抗生素耐药性分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/683/细菌抗生素耐药性分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Sat, 11 Jun 2022 03:33:15 GMT</pubDate></item><item><title><![CDATA[kraken2 bracken流程]]></title><description><![CDATA[<p dir="auto"><a href="https://microbe.net/2017/04/27/why-use-bracken-instead-of-kraken/" rel="nofollow ugc">https://microbe.net/2017/04/27/why-use-bracken-instead-of-kraken/</a><br />
为什么使用bracken？bracken可以更精准的在种级别进行丰度的统计。因为kraken2在相似的物种间会做LCA，导致鉴定的时候不精确。</p>
]]></description><link>http://an.forum.genostack.com/topic/658/kraken2-bracken流程</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/658/kraken2-bracken流程</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Wed, 18 May 2022 08:00:20 GMT</pubDate></item><item><title><![CDATA[齐碳耐药菌的研究论文 有数据]]></title><description><![CDATA[<p dir="auto"><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8985760/" rel="nofollow ugc">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8985760/</a></p>
]]></description><link>http://an.forum.genostack.com/topic/657/齐碳耐药菌的研究论文-有数据</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/657/齐碳耐药菌的研究论文-有数据</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Wed, 18 May 2022 02:39:54 GMT</pubDate></item><item><title><![CDATA[对12个单倍型工具进行对比分析]]></title><description><![CDATA[<p dir="auto"><a href="https://www.sciencedirect.com/science/article/abs/pii/S1567134820301088" rel="nofollow ugc">https://www.sciencedirect.com/science/article/abs/pii/S1567134820301088</a></p>
]]></description><link>http://an.forum.genostack.com/topic/652/对12个单倍型工具进行对比分析</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/652/对12个单倍型工具进行对比分析</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Sat, 14 May 2022 09:05:25 GMT</pubDate></item><item><title><![CDATA[An integrated software for virus community sequencing data analysis]]></title><description><![CDATA[<p dir="auto">修复环状参考基因组<br />
root@1f7293c590d6:/$qap FixCircRef /opt/qap/bin/FixCircRef.pl -1 /data/data/SRR6378032_1.fastq.gz,/data/data/SRR6377924_1.fastq.gz,/data/data/SRR6377925_1.fastq.gz -2 /data/data/SRR6378032_2.fastq.gz,/data/data/SRR6377924_2.fastq.gz,/data/data/SRR6377925_2.fastq.gz -r /data/data/HBV_C_AB033556.fasta</p>
<p dir="auto">You are now running subprogram:  FixCircRef</p>
<p dir="auto">WARNING @ [2022-05-24 12:32:34 UTC]: The output directory is not provided!<br />
WARNING @ [2022-05-24 12:32:34 UTC]: Will mkdir /qap_Results_for_FixCircRef_20220524_12h32m34s and use it as the output directory.<br />
INFO    @ [2022-05-24 12:32:34 UTC]: Building Bowtie2 index for /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.fasta.<br />
INFO    @ [2022-05-24 12:32:34 UTC]: /opt/qap/bin/3rdPartyTools/bowtie2/bowtie2-build /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.fasta /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0<br />
Settings:<br />
Output files: "/qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0..bt2"<br />
Line rate: 6 (line is 64 bytes)<br />
Lines per side: 1 (side is 64 bytes)<br />
Offset rate: 4 (one in 16)<br />
FTable chars: 10<br />
Strings: unpacked<br />
Max bucket size: default<br />
Max bucket size, sqrt multiplier: default<br />
Max bucket size, len divisor: 4<br />
Difference-cover sample period: 1024<br />
Endianness: little<br />
Actual local endianness: little<br />
Sanity checking: disabled<br />
Assertions: disabled<br />
Random seed: 0<br />
Sizeofs: void:8, int:4, long:8, size_t:8<br />
Input files DNA, FASTA:<br />
/qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.fasta<br />
Building a SMALL index<br />
Reading reference sizes<br />
Time reading reference sizes: 00:00:00<br />
Calculating joined length<br />
Writing header<br />
Reserving space for joined string<br />
Joining reference sequences<br />
Time to join reference sequences: 00:00:00<br />
bmax according to bmaxDivN setting: 928<br />
Using parameters --bmax 696 --dcv 1024<br />
Doing ahead-of-time memory usage test<br />
Passed!  Constructing with these parameters: --bmax 696 --dcv 1024<br />
Constructing suffix-array element generator<br />
Building DifferenceCoverSample<br />
Building sPrime<br />
Building sPrimeOrder<br />
V-Sorting samples<br />
V-Sorting samples time: 00:00:00<br />
Allocating rank array<br />
Ranking v-sort output<br />
Ranking v-sort output time: 00:00:00<br />
Invoking Larsson-Sadakane on ranks<br />
Invoking Larsson-Sadakane on ranks time: 00:00:00<br />
Sanity-checking and returning<br />
Building samples<br />
Reserving space for 12 sample suffixes<br />
Generating random suffixes<br />
QSorting 12 sample offsets, eliminating duplicates<br />
QSorting sample offsets, eliminating duplicates time: 00:00:00<br />
Multikey QSorting 12 samples<br />
(Using difference cover)<br />
Multikey QSorting samples time: 00:00:00<br />
Calculating bucket sizes<br />
Splitting and merging<br />
Splitting and merging time: 00:00:00<br />
Split 2, merged 4; iterating...<br />
Splitting and merging<br />
Splitting and merging time: 00:00:00<br />
Avg bucket size: 463.5 (target: 695)<br />
Converting suffix-array elements to index image<br />
Allocating ftab, absorbFtab<br />
Entering Ebwt loop<br />
Getting block 1 of 8<br />
Reserving size (696) for bucket 1<br />
Calculating Z arrays for bucket 1<br />
Entering block accumulator loop for bucket 1:<br />
bucket 1: 10%<br />
bucket 1: 20%<br />
bucket 1: 30%<br />
bucket 1: 40%<br />
bucket 1: 50%<br />
bucket 1: 60%<br />
bucket 1: 70%<br />
bucket 1: 80%<br />
bucket 1: 90%<br />
bucket 1: 100%<br />
Sorting block of length 354 for bucket 1<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 355 for bucket 1<br />
Getting block 2 of 8<br />
Reserving size (696) for bucket 2<br />
Calculating Z arrays for bucket 2<br />
Entering block accumulator loop for bucket 2:<br />
bucket 2: 10%<br />
bucket 2: 20%<br />
bucket 2: 30%<br />
bucket 2: 40%<br />
bucket 2: 50%<br />
bucket 2: 60%<br />
bucket 2: 70%<br />
bucket 2: 80%<br />
bucket 2: 90%<br />
bucket 2: 100%<br />
Sorting block of length 521 for bucket 2<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 522 for bucket 2<br />
Getting block 3 of 8<br />
Reserving size (696) for bucket 3<br />
Calculating Z arrays for bucket 3<br />
Entering block accumulator loop for bucket 3:<br />
bucket 3: 10%<br />
bucket 3: 20%<br />
bucket 3: 30%<br />
bucket 3: 40%<br />
bucket 3: 50%<br />
bucket 3: 60%<br />
bucket 3: 70%<br />
bucket 3: 80%<br />
bucket 3: 90%<br />
bucket 3: 100%<br />
Sorting block of length 409 for bucket 3<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 410 for bucket 3<br />
Getting block 4 of 8<br />
Reserving size (696) for bucket 4<br />
Calculating Z arrays for bucket 4<br />
Entering block accumulator loop for bucket 4:<br />
bucket 4: 10%<br />
bucket 4: 20%<br />
bucket 4: 30%<br />
bucket 4: 40%<br />
bucket 4: 50%<br />
bucket 4: 60%<br />
bucket 4: 70%<br />
bucket 4: 80%<br />
bucket 4: 90%<br />
bucket 4: 100%<br />
Sorting block of length 291 for bucket 4<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 292 for bucket 4<br />
Getting block 5 of 8<br />
Reserving size (696) for bucket 5<br />
Calculating Z arrays for bucket 5<br />
Entering block accumulator loop for bucket 5:<br />
bucket 5: 10%<br />
bucket 5: 20%<br />
bucket 5: 30%<br />
bucket 5: 40%<br />
bucket 5: 50%<br />
bucket 5: 60%<br />
bucket 5: 70%<br />
bucket 5: 80%<br />
bucket 5: 90%<br />
bucket 5: 100%<br />
Sorting block of length 579 for bucket 5<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 580 for bucket 5<br />
Getting block 6 of 8<br />
Reserving size (696) for bucket 6<br />
Calculating Z arrays for bucket 6<br />
Entering block accumulator loop for bucket 6:<br />
bucket 6: 10%<br />
bucket 6: 20%<br />
bucket 6: 30%<br />
bucket 6: 40%<br />
bucket 6: 50%<br />
bucket 6: 60%<br />
bucket 6: 70%<br />
bucket 6: 80%<br />
bucket 6: 90%<br />
bucket 6: 100%<br />
Sorting block of length 670 for bucket 6<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 671 for bucket 6<br />
Getting block 7 of 8<br />
Reserving size (696) for bucket 7<br />
Calculating Z arrays for bucket 7<br />
Entering block accumulator loop for bucket 7:<br />
bucket 7: 10%<br />
bucket 7: 20%<br />
bucket 7: 30%<br />
bucket 7: 40%<br />
bucket 7: 50%<br />
bucket 7: 60%<br />
bucket 7: 70%<br />
bucket 7: 80%<br />
bucket 7: 90%<br />
bucket 7: 100%<br />
Sorting block of length 659 for bucket 7<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 660 for bucket 7<br />
Getting block 8 of 8<br />
Reserving size (696) for bucket 8<br />
Calculating Z arrays for bucket 8<br />
Entering block accumulator loop for bucket 8:<br />
bucket 8: 10%<br />
bucket 8: 20%<br />
bucket 8: 30%<br />
bucket 8: 40%<br />
bucket 8: 50%<br />
bucket 8: 60%<br />
bucket 8: 70%<br />
bucket 8: 80%<br />
bucket 8: 90%<br />
bucket 8: 100%<br />
Sorting block of length 225 for bucket 8<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 226 for bucket 8<br />
Exited Ebwt loop<br />
fchr[A]: 0<br />
fchr[C]: 832<br />
fchr[G]: 1857<br />
fchr[T]: 2662<br />
fchr[$]: 3715<br />
Exiting Ebwt::buildToDisk()<br />
Returning from initFromVector<br />
Wrote 4195809 bytes to primary EBWT file: /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.1.bt2<br />
Wrote 936 bytes to secondary EBWT file: /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.2.bt2<br />
Re-opening _in1 and _in2 as input streams<br />
Returning from Ebwt constructor<br />
Headers:<br />
len: 3715<br />
bwtLen: 3716<br />
sz: 929<br />
bwtSz: 929<br />
lineRate: 6<br />
offRate: 4<br />
offMask: 0xfffffff0<br />
ftabChars: 10<br />
eftabLen: 20<br />
eftabSz: 80<br />
ftabLen: 1048577<br />
ftabSz: 4194308<br />
offsLen: 233<br />
offsSz: 932<br />
lineSz: 64<br />
sideSz: 64<br />
sideBwtSz: 48<br />
sideBwtLen: 192<br />
numSides: 20<br />
numLines: 20<br />
ebwtTotLen: 1280<br />
ebwtTotSz: 1280<br />
color: 0<br />
reverse: 0<br />
Total time for call to driver() for forward index: 00:00:01<br />
Reading reference sizes<br />
Time reading reference sizes: 00:00:00<br />
Calculating joined length<br />
Writing header<br />
Reserving space for joined string<br />
Joining reference sequences<br />
Time to join reference sequences: 00:00:00<br />
Time to reverse reference sequence: 00:00:00<br />
bmax according to bmaxDivN setting: 928<br />
Using parameters --bmax 696 --dcv 1024<br />
Doing ahead-of-time memory usage test<br />
Passed!  Constructing with these parameters: --bmax 696 --dcv 1024<br />
Constructing suffix-array element generator<br />
Building DifferenceCoverSample<br />
Building sPrime<br />
Building sPrimeOrder<br />
V-Sorting samples<br />
V-Sorting samples time: 00:00:00<br />
Allocating rank array<br />
Ranking v-sort output<br />
Ranking v-sort output time: 00:00:00<br />
Invoking Larsson-Sadakane on ranks<br />
Invoking Larsson-Sadakane on ranks time: 00:00:00<br />
Sanity-checking and returning<br />
Building samples<br />
Reserving space for 12 sample suffixes<br />
Generating random suffixes<br />
QSorting 12 sample offsets, eliminating duplicates<br />
QSorting sample offsets, eliminating duplicates time: 00:00:00<br />
Multikey QSorting 12 samples<br />
(Using difference cover)<br />
Multikey QSorting samples time: 00:00:00<br />
Calculating bucket sizes<br />
Splitting and merging<br />
Splitting and merging time: 00:00:00<br />
Split 1, merged 6; iterating...<br />
Splitting and merging<br />
Splitting and merging time: 00:00:00<br />
Avg bucket size: 463.5 (target: 695)<br />
Converting suffix-array elements to index image<br />
Allocating ftab, absorbFtab<br />
Entering Ebwt loop<br />
Getting block 1 of 8<br />
Reserving size (696) for bucket 1<br />
Calculating Z arrays for bucket 1<br />
Entering block accumulator loop for bucket 1:<br />
bucket 1: 10%<br />
bucket 1: 20%<br />
bucket 1: 30%<br />
bucket 1: 40%<br />
bucket 1: 50%<br />
bucket 1: 60%<br />
bucket 1: 70%<br />
bucket 1: 80%<br />
bucket 1: 90%<br />
bucket 1: 100%<br />
Sorting block of length 441 for bucket 1<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 442 for bucket 1<br />
Getting block 2 of 8<br />
Reserving size (696) for bucket 2<br />
Calculating Z arrays for bucket 2<br />
Entering block accumulator loop for bucket 2:<br />
bucket 2: 10%<br />
bucket 2: 20%<br />
bucket 2: 30%<br />
bucket 2: 40%<br />
bucket 2: 50%<br />
bucket 2: 60%<br />
bucket 2: 70%<br />
bucket 2: 80%<br />
bucket 2: 90%<br />
bucket 2: 100%<br />
Sorting block of length 638 for bucket 2<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 639 for bucket 2<br />
Getting block 3 of 8<br />
Reserving size (696) for bucket 3<br />
Calculating Z arrays for bucket 3<br />
Entering block accumulator loop for bucket 3:<br />
bucket 3: 10%<br />
bucket 3: 20%<br />
bucket 3: 30%<br />
bucket 3: 40%<br />
bucket 3: 50%<br />
bucket 3: 60%<br />
bucket 3: 70%<br />
bucket 3: 80%<br />
bucket 3: 90%<br />
bucket 3: 100%<br />
Sorting block of length 332 for bucket 3<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 333 for bucket 3<br />
Getting block 4 of 8<br />
Reserving size (696) for bucket 4<br />
Calculating Z arrays for bucket 4<br />
Entering block accumulator loop for bucket 4:<br />
bucket 4: 10%<br />
bucket 4: 20%<br />
bucket 4: 30%<br />
bucket 4: 40%<br />
bucket 4: 50%<br />
bucket 4: 60%<br />
bucket 4: 70%<br />
bucket 4: 80%<br />
bucket 4: 90%<br />
bucket 4: 100%<br />
Sorting block of length 442 for bucket 4<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 443 for bucket 4<br />
Getting block 5 of 8<br />
Reserving size (696) for bucket 5<br />
Calculating Z arrays for bucket 5<br />
Entering block accumulator loop for bucket 5:<br />
bucket 5: 10%<br />
bucket 5: 20%<br />
bucket 5: 30%<br />
bucket 5: 40%<br />
bucket 5: 50%<br />
bucket 5: 60%<br />
bucket 5: 70%<br />
bucket 5: 80%<br />
bucket 5: 90%<br />
bucket 5: 100%<br />
Sorting block of length 425 for bucket 5<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 426 for bucket 5<br />
Getting block 6 of 8<br />
Reserving size (696) for bucket 6<br />
Calculating Z arrays for bucket 6<br />
Entering block accumulator loop for bucket 6:<br />
bucket 6: 10%<br />
bucket 6: 20%<br />
bucket 6: 30%<br />
bucket 6: 40%<br />
bucket 6: 50%<br />
bucket 6: 60%<br />
bucket 6: 70%<br />
bucket 6: 80%<br />
bucket 6: 90%<br />
bucket 6: 100%<br />
Sorting block of length 373 for bucket 6<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 374 for bucket 6<br />
Getting block 7 of 8<br />
Reserving size (696) for bucket 7<br />
Calculating Z arrays for bucket 7<br />
Entering block accumulator loop for bucket 7:<br />
bucket 7: 10%<br />
bucket 7: 20%<br />
bucket 7: 30%<br />
bucket 7: 40%<br />
bucket 7: 50%<br />
bucket 7: 60%<br />
bucket 7: 70%<br />
bucket 7: 80%<br />
bucket 7: 90%<br />
bucket 7: 100%<br />
Sorting block of length 439 for bucket 7<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 440 for bucket 7<br />
Getting block 8 of 8<br />
Reserving size (696) for bucket 8<br />
Calculating Z arrays for bucket 8<br />
Entering block accumulator loop for bucket 8:<br />
bucket 8: 10%<br />
bucket 8: 20%<br />
bucket 8: 30%<br />
bucket 8: 40%<br />
bucket 8: 50%<br />
bucket 8: 60%<br />
bucket 8: 70%<br />
bucket 8: 80%<br />
bucket 8: 90%<br />
bucket 8: 100%<br />
Sorting block of length 618 for bucket 8<br />
(Using difference cover)<br />
Sorting block time: 00:00:00<br />
Returning block of 619 for bucket 8<br />
Exited Ebwt loop<br />
fchr[A]: 0<br />
fchr[C]: 832<br />
fchr[G]: 1857<br />
fchr[T]: 2662<br />
fchr[$]: 3715<br />
Exiting Ebwt::buildToDisk()<br />
Returning from initFromVector<br />
Wrote 4195809 bytes to primary EBWT file: /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.rev.1.bt2<br />
Wrote 936 bytes to secondary EBWT file: /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.rev.2.bt2<br />
Re-opening _in1 and _in2 as input streams<br />
Returning from Ebwt constructor<br />
Headers:<br />
len: 3715<br />
bwtLen: 3716<br />
sz: 929<br />
bwtSz: 929<br />
lineRate: 6<br />
offRate: 4<br />
offMask: 0xfffffff0<br />
ftabChars: 10<br />
eftabLen: 20<br />
eftabSz: 80<br />
ftabLen: 1048577<br />
ftabSz: 4194308<br />
offsLen: 233<br />
offsSz: 932<br />
lineSz: 64<br />
sideSz: 64<br />
sideBwtSz: 48<br />
sideBwtLen: 192<br />
numSides: 20<br />
numLines: 20<br />
ebwtTotLen: 1280<br />
ebwtTotSz: 1280<br />
color: 0<br />
reverse: 1<br />
Total time for backward call to driver() for mirror index: 00:00:00<br />
INFO    @ [2022-05-24 12:32:35 UTC]: Start to map reads to /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.fasta using Bowtie2.<br />
INFO    @ [2022-05-24 12:32:35 UTC]: Running Bowtie2 for paired-end read mapping<br />
INFO    @ [2022-05-24 12:32:35 UTC]: /opt/qap/bin/3rdPartyTools/bowtie2/bowtie2 --very-sensitive-local --threads 1 -x /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0 -1 /data/data/SRR6378032_1.fastq.gz -2 /data/data/SRR6378032_2.fastq.gz -S /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.sam<br />
57699 reads; of these:<br />
57699 (100.00%) were paired; of these:<br />
7821 (13.55%) aligned concordantly 0 times<br />
37033 (64.18%) aligned concordantly exactly 1 time<br />
12845 (22.26%) aligned concordantly &gt;1 times<br />
----<br />
7821 pairs aligned concordantly 0 times; of these:<br />
7622 (97.46%) aligned discordantly 1 time<br />
----<br />
199 pairs aligned 0 times concordantly or discordantly; of these:<br />
398 mates make up the pairs; of these:<br />
101 (25.38%) aligned 0 times<br />
55 (13.82%) aligned exactly 1 time<br />
242 (60.80%) aligned &gt;1 times<br />
99.91% overall alignment rate<br />
INFO    @ [2022-05-24 12:40:54 UTC]: Converting /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.sam to bam file<br />
INFO    @ [2022-05-24 12:40:54 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools view -h -@ 1 -Sb /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.sam &gt; /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.bam<br />
INFO    @ [2022-05-24 12:40:59 UTC]: Sorting bam file /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.bam with coordinates.<br />
INFO    @ [2022-05-24 12:40:59 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools sort -@ 1 -O bam -T 0.PosSorted.1653396059 -o /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.PosSorted.bam /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.bam<br />
INFO    @ [2022-05-24 12:41:03 UTC]: Indexing sorted bam file.<br />
INFO    @ [2022-05-24 12:41:03 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools index /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.PosSorted.bam<br />
INFO    @ [2022-05-24 12:41:03 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools depth -aa /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/0.PosSorted.bam &gt; /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/0.depth<br />
INFO    @ [2022-05-24 12:41:05 UTC]: Rscript /opt/qap/bin/Rscripts/FindDepthInterval.R -i /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/0.depth -o /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/0.interval<br />
INFO    @ [2022-05-24 12:41:05 UTC]: Start to map reads to /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.fasta using Bowtie2.<br />
INFO    @ [2022-05-24 12:41:05 UTC]: Running Bowtie2 for paired-end read mapping<br />
INFO    @ [2022-05-24 12:41:05 UTC]: /opt/qap/bin/3rdPartyTools/bowtie2/bowtie2 --very-sensitive-local --threads 1 -x /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0 -1 /data/data/SRR6377924_1.fastq.gz -2 /data/data/SRR6377924_2.fastq.gz -S /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.sam<br />
58549 reads; of these:<br />
58549 (100.00%) were paired; of these:<br />
13245 (22.62%) aligned concordantly 0 times<br />
33871 (57.85%) aligned concordantly exactly 1 time<br />
11433 (19.53%) aligned concordantly &gt;1 times<br />
----<br />
13245 pairs aligned concordantly 0 times; of these:<br />
7533 (56.87%) aligned discordantly 1 time<br />
----<br />
5712 pairs aligned 0 times concordantly or discordantly; of these:<br />
11424 mates make up the pairs; of these:<br />
11181 (97.87%) aligned 0 times<br />
74 (0.65%) aligned exactly 1 time<br />
169 (1.48%) aligned &gt;1 times<br />
90.45% overall alignment rate<br />
INFO    @ [2022-05-24 12:48:48 UTC]: Converting /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.sam to bam file<br />
INFO    @ [2022-05-24 12:48:48 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools view -h -@ 1 -Sb /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.sam &gt; /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.bam<br />
INFO    @ [2022-05-24 12:48:53 UTC]: Sorting bam file /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.bam with coordinates.<br />
INFO    @ [2022-05-24 12:48:53 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools sort -@ 1 -O bam -T 1.PosSorted.1653396533 -o /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.PosSorted.bam /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.bam<br />
INFO    @ [2022-05-24 12:48:57 UTC]: Indexing sorted bam file.<br />
INFO    @ [2022-05-24 12:48:57 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools index /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.PosSorted.bam<br />
INFO    @ [2022-05-24 12:48:57 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools depth -aa /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/1.PosSorted.bam &gt; /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/1.depth<br />
INFO    @ [2022-05-24 12:48:58 UTC]: Rscript /opt/qap/bin/Rscripts/FindDepthInterval.R -i /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/1.depth -o /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/1.interval<br />
INFO    @ [2022-05-24 12:48:59 UTC]: Start to map reads to /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0.fasta using Bowtie2.<br />
INFO    @ [2022-05-24 12:48:59 UTC]: Running Bowtie2 for paired-end read mapping<br />
INFO    @ [2022-05-24 12:48:59 UTC]: /opt/qap/bin/3rdPartyTools/bowtie2/bowtie2 --very-sensitive-local --threads 1 -x /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/HBV_C_AB033556.2line.fix0 -1 /data/data/SRR6377925_1.fastq.gz -2 /data/data/SRR6377925_2.fastq.gz -S /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.sam<br />
55473 reads; of these:<br />
55473 (100.00%) were paired; of these:<br />
8817 (15.89%) aligned concordantly 0 times<br />
32750 (59.04%) aligned concordantly exactly 1 time<br />
13906 (25.07%) aligned concordantly &gt;1 times<br />
----<br />
8817 pairs aligned concordantly 0 times; of these:<br />
6382 (72.38%) aligned discordantly 1 time<br />
----<br />
2435 pairs aligned 0 times concordantly or discordantly; of these:<br />
4870 mates make up the pairs; of these:<br />
3810 (78.23%) aligned 0 times<br />
935 (19.20%) aligned exactly 1 time<br />
125 (2.57%) aligned &gt;1 times<br />
96.57% overall alignment rate<br />
INFO    @ [2022-05-24 12:55:21 UTC]: Converting /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.sam to bam file<br />
INFO    @ [2022-05-24 12:55:21 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools view -h -@ 1 -Sb /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.sam &gt; /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.bam<br />
INFO    @ [2022-05-24 12:55:26 UTC]: Sorting bam file /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.bam with coordinates.<br />
INFO    @ [2022-05-24 12:55:26 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools sort -@ 1 -O bam -T 2.PosSorted.1653396926 -o /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.PosSorted.bam /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.bam<br />
INFO    @ [2022-05-24 12:55:30 UTC]: Indexing sorted bam file.<br />
INFO    @ [2022-05-24 12:55:30 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools index /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.PosSorted.bam<br />
INFO    @ [2022-05-24 12:55:30 UTC]: /opt/qap/bin/3rdPartyTools/samtools/samtools depth -aa /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/bwa/2.PosSorted.bam &gt; /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/2.depth<br />
INFO    @ [2022-05-24 12:55:31 UTC]: Rscript /opt/qap/bin/Rscripts/FindDepthInterval.R -i /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/2.depth -o /qap_Results_for_FixCircRef_20220524_12h32m34s/tmp/depth/2.interval<br />
INFO    @ [2022-05-24 12:55:32 UTC]: Program completed!</p>
]]></description><link>http://an.forum.genostack.com/topic/651/an-integrated-software-for-virus-community-sequencing-data-analysis</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/651/an-integrated-software-for-virus-community-sequencing-data-analysis</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Sat, 14 May 2022 09:05:04 GMT</pubDate></item><item><title><![CDATA[Deep sequencing of evolving pathogen populations: applications, errors, and bioinformatic solutions]]></title><description><![CDATA[<p dir="auto"><a href="https://microbialinformaticsj.biomedcentral.com/articles/10.1186/2042-5783-4-1" rel="nofollow ugc">https://microbialinformaticsj.biomedcentral.com/articles/10.1186/2042-5783-4-1</a><br />
Deep sequencing of evolving pathogen populations: applications, errors, and bioinformatic solutions<br />
NGS在病原群体中的应用 这个文章中将对其的每个reads 当做群体的一分子</p>
<p dir="auto">we limit our scope to applications of NGS where aligned reads are considered to be a population sample. In this definition of deep sequencing, reads aligning to a given genomic position are each assumed to originate from an individual replicon, revealing a snapshot of the population’s genetic diversity.</p>
<p dir="auto">Sequencing of populations, on the other hand, has the drawback that unless variants co-occur within a read length or read pair, it is difficult to reconstruct individual haplotypes and perform phylogenetic analysis.</p>
<p dir="auto"><img src="/assets/uploads/files/1652491940111-c9ebe4f7-5962-4b22-9db1-d52ca2b46486-image.png" alt="c9ebe4f7-5962-4b22-9db1-d52ca2b46486-image.png" class=" img-responsive img-markdown" /></p>
<p dir="auto">This ability to detect low frequency variants is an important feature of deep sequencing, for example in the context of drug resistance.<br />
深度测序对用于发现低频突变从而来分析耐药性。</p>
<p dir="auto">Sequencing of populations, on the other hand, has the drawback that unless variants co-occur within a read length or read pair, it is difficult to reconstruct individual haplotypes and perform phylogenetic analysis.<br />
深度测序对于构建单倍型和进化分析来说 就很困难。</p>
<p dir="auto">either by simply considering physical linkage of SNVs within individual reads, or by using overlapping reads to <strong>reconstruct longer genome fragments, termed ‘haplotypes’.</strong></p>
]]></description><link>http://an.forum.genostack.com/topic/648/deep-sequencing-of-evolving-pathogen-populations-applications-errors-and-bioinformatic-solutions</link><guid isPermaLink="true">http://an.forum.genostack.com/topic/648/deep-sequencing-of-evolving-pathogen-populations-applications-errors-and-bioinformatic-solutions</guid><dc:creator><![CDATA[anneng]]></dc:creator><pubDate>Fri, 13 May 2022 10:41:12 GMT</pubDate></item></channel></rss>