<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/43850?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/43850?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44489/proksee</guid>
	<pubDate>Wed, 27 Mar 2024 11:11:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44489/proksee</link>
	<title><![CDATA[Proksee]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p>
<fieldset><legend>Please Cite the Following</legend>
<div>Grant JR, Enns E, Marinier E, Mandal A, Herman EK, Chen C, Graham M, Van Domselaar G, and Stothard P</div>
<div><a href="https://pubmed.ncbi.nlm.nih.gov/37140037/">Proksee: in-depth characterization and visualization of bacterial genomes</a></div>
<div>Nucleic Acids Research, 2023, gkad326, https://doi.org/10.1093/nar/gkad326</div>
</fieldset><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36015/repeat-aware-repeat-aware-scaffolding-evaluation-framework-by-igor-mandric</guid>
	<pubDate>Wed, 21 Mar 2018 18:10:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36015/repeat-aware-repeat-aware-scaffolding-evaluation-framework-by-igor-mandric</link>
	<title><![CDATA[repeat-aware: Repeat aware scaffolding evaluation framework by Igor Mandric]]></title>
	<description><![CDATA[<p>Genome scaffolding is a classical challenging problem in bioinformatics. It refers to joining assembly contigs into chains (called scaffolds). The join between two contigs A and B is considered correct if:</p>
<ul>
<li>Their relative orientation is correct</li>
<li>Their relative order is correct</li>
<li>The gap estimate is similar to the true distance on the reference</li>
</ul>
<p>The problem of scaffolding validation is also a challenging one. One of the main issues which hinders from an adequate scaffolding evaluation are genome repeats. The previous standard for evaluation&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/gb-2014-15-3-r42">(Hunt et al.,&nbsp;<em>Genome Biology</em>, 2014)</a>&nbsp;did not take into account repeats. In this evaluation framework, repeats are taken into account.</p>
<p style="text-align: center;"><a href="https://camo.githubusercontent.com/9675b90205e5bc0dc0b6b84b321b00bc87d8d88e/687474703a2f2f616c616e2e63732e6773752e6564752f7265706561742d61776172652f6669677572652e706e67" target="_blank"><img src="https://camo.githubusercontent.com/9675b90205e5bc0dc0b6b84b321b00bc87d8d88e/687474703a2f2f616c616e2e63732e6773752e6564752f7265706561742d61776172652f6669677572652e706e67" width="75%" alt="image" style="border: 0px;"></a></p>
<p>The new evaluation framework considers the optimal assignment of contigs in the output scaffolding to contigs in the reference scaffolding in the sense of the number of correct links.</p>
<p>&nbsp;</p>
<p>https://github.com/mandricigor/repeat-aware</p><p>Address of the bookmark: <a href="https://github.com/mandricigor/repeat-aware" rel="nofollow">https://github.com/mandricigor/repeat-aware</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39626/geval-genome-evaluation-browser</guid>
	<pubDate>Tue, 18 Jun 2019 05:39:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39626/geval-genome-evaluation-browser</link>
	<title><![CDATA[gEVAL: Genome Evaluation Browser]]></title>
	<description><![CDATA[<p>The&nbsp;<strong>gEVAL Browser</strong>&nbsp;allows the evaluation of genome assemblies through its tools and pre-computed analyses.</p>
<p>The strength of this browser is the ability to navigate an up to date assembly and identify problematic regions and assist in strategizing potential solutions for these issues.</p>
<p>This facilitates the improvement of overall assemblies to a &ldquo;gold&rdquo; standard for release as reference genomes</p><p>Address of the bookmark: <a href="https://geval.sanger.ac.uk/index.html" rel="nofollow">https://geval.sanger.ac.uk/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</guid>
	<pubDate>Thu, 04 Oct 2018 16:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</link>
	<title><![CDATA[VariantBam: Filtering and profiling of next-generational sequencing data using region-specific rules]]></title>
	<description><![CDATA[<p>VariantBam is a tool to extract/count specific sets of sequencing reads from next-generational sequencing files. To save money, disk space and I/O, one may not want to store an entire BAM on disk. In many cases, it would be more efficient to store only those read-pairs or reads who intersect some region around the variant locations. Alternatively, if your scientific question is focused on only one aspect of the data (e.g. breakpoints), many reads can be removed without losing the information relevant to the problem.</p>
<h5>&nbsp;</h5><p>Address of the bookmark: <a href="https://github.com/broadinstitute/VariantBam" rel="nofollow">https://github.com/broadinstitute/VariantBam</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38445/orthoani-an-improved-algorithm-and-software-for-calculating-average-nucleotide-identity</guid>
	<pubDate>Wed, 12 Dec 2018 08:36:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38445/orthoani-an-improved-algorithm-and-software-for-calculating-average-nucleotide-identity</link>
	<title><![CDATA[OrthoANI: An improved algorithm and software for calculating average nucleotide identity]]></title>
	<description><![CDATA[<p><span>OAT uses OrthoANI to measure the overall similarity between two genome sequences. ANI and OrthoANI are comparable algorithms: they share the same species demarcation cut-off at 95~96% and large comparison studies have demonstrated both algorithms to produce near identical reciprocal similarities. Details of the OrthoANI algorithm is given in (Lee et al. 2015). OAT employs an easy-to-follow Graphical User Interface that allow researchers to calculate OrthoANI values between genomes of interest without unfamiliar Command Line Environments. Moreover, the OAT_cmd command-line software can be integrated into preexisting bioinformatics pipelines.&nbsp;</span></p><p>Address of the bookmark: <a href="https://www.ezbiocloud.net/tools/orthoani" rel="nofollow">https://www.ezbiocloud.net/tools/orthoani</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40891/musket-a-multistage-k-mer-spectrum-based-corrector</guid>
	<pubDate>Tue, 04 Feb 2020 23:24:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40891/musket-a-multistage-k-mer-spectrum-based-corrector</link>
	<title><![CDATA[Musket - a multistage k-mer spectrum based corrector]]></title>
	<description><![CDATA[<p><strong>Musket</strong><span>&nbsp;is a well-established leading next-generation sequencing read error correction algorithm targetting Illumina sequencing. This corrector employs the&nbsp;</span><em>k</em><span>-mer spectrum approach and introduces three correction techniques in a multistage workflow. Our performance evaluation results, in terms of correction quality and de novo genome assembly measures, reveal that Musket is consistently one of the top performing substitution-error-based correctors.</span></p><p>Address of the bookmark: <a href="http://musket.sourceforge.net/homepage.htm" rel="nofollow">http://musket.sourceforge.net/homepage.htm</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37509/vcftools-perform-common-tasks-with-vcf-files-such-as-file-validation-file-merging-intersecting-complements</guid>
	<pubDate>Tue, 07 Aug 2018 10:01:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37509/vcftools-perform-common-tasks-with-vcf-files-such-as-file-validation-file-merging-intersecting-complements</link>
	<title><![CDATA[VCFtools: perform common tasks with VCF files such as file validation, file merging, intersecting, complements]]></title>
	<description><![CDATA[<p>VCFtools contains a Perl API (<a href="http://vcftools.sourceforge.net/perl_module.html#Vcf.pm">Vcf.pm</a>) and a number of Perl scripts that can be used to perform common tasks with VCF files such as file validation, file merging, intersecting, complements, etc. The Perl tools support all versions of the VCF specification (3.2, 3.3, 4.0, 4.1 and 4.2), nevertheless, the users are encouraged to use the latest versions VCFv4.1 or VCFv4.2. The VCFtools in general have been used mainly with diploid data, but the Perl tools aim to support polyploid data as well. Run any of the Perl scripts with the&nbsp;<strong>--help</strong>&nbsp;switch to obtain more help.</p>
<p>Many of the&nbsp;<strong>Perl scripts require that the VCF files are compressed by&nbsp;<span>bgzip</span>&nbsp;and indexed by&nbsp;<span>tabix</span></strong>&nbsp;(both tools are part of the tabix package, available for&nbsp;<a href="https://sourceforge.net/projects/samtools/files/tabix/">download here</a>). The VCF files can be compressed and indexed using the following commands</p>
<p>bgzip my_file.vcf<br>tabix -p vcf my_file.vcf.gz</p>
<p>&nbsp;</p>
<p>http://vcftools.sourceforge.net/perl_module.html</p><p>Address of the bookmark: <a href="http://vcftools.sourceforge.net/perl_module.html" rel="nofollow">http://vcftools.sourceforge.net/perl_module.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41222/best-practices-for-variant-calling-with-the-gatk</guid>
	<pubDate>Sat, 22 Feb 2020 03:07:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41222/best-practices-for-variant-calling-with-the-gatk</link>
	<title><![CDATA[Best Practices for Variant Calling with the GATK]]></title>
	<description><![CDATA[<p>The presentations below were filmed during the March 2015 GATK Workshop, part of the BroadE Workshop series. At the time of this workshop, the current version of Broad&rsquo;s Genome Analysis Toolkit (GATK) was version 3.3.</p>
<div>
<div>
<div>
<div>
<div>
<div>
<div>
<div>
<div>
<ul>
<li><a href="https://software.broadinstitute.org/gatk/">Genome Analysis Toolkit</a></li>
</ul>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<table>
<tbody style="vertical-align: top;">
<tr>
<td>03/19/15</td>
<td>Introduction to High-Throughput Sequencing data formats and methods</td>
<td>Joel Thibault</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeY3g1M1ZjVjFrZ2s/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6696">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Introduction to the GATK</td>
<td>Geraldine Van der Auwera</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeVEJ1Z1pXUF9Ib3M/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6707">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Mapping, processing, and duplicate marking with Picard tools</td>
<td>Matt Sooknah</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeaGVrbE1GVV9SQkE/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6706">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Mapping and processing RNAseq</td>
<td>Ami Levy-Moonshine</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeLUkwUm5vTGl4bG8/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6705">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Indel realignment</td>
<td>Mark Fleharty</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeLTFzNndsNDBuVms/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6704">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Base quality score recalibration</td>
<td>David Roazen</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeZk1rMXpTYmZzTXc/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6703">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Introduction to variant discovery: calling cohorts</td>
<td>Louis Bergelson</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeQUFYUFRmM1hhRUE/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6702">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Variant calling and joint genotyping</td>
<td>Sheila Chandran</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeYzVTUGs0bjM3M1E/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6701">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Variant quality score recalibration</td>
<td>Bertrand Haas</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeSEpwRkNVQm4wdkE/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6700">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Introduction to working with variants</td>
<td>Yossi Farjoun</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWec0NqUTN2WTRuWWs/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6699">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Genotype refinement</td>
<td>Laura Gauthier</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeMzFldVF5SUp4dWM/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6698">Video</a></td>
</tr>
<tr>
<td>03/19/15</td>
<td>Annotation and variant evaluation</td>
<td>David Benjamin</td>
<td><a href="https://docs.google.com/file/d/0B2dK2q40HDWeWi1YMm42bWdpRE0/preview" target="_blank">PDF</a></td>
<td><a href="https://www.broadinstitute.org/node/6697">Video</a></td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.broadinstitute.org/partnerships/education/broade/best-practices-variant-calling-gatk-1" rel="nofollow">https://www.broadinstitute.org/partnerships/education/broade/best-practices-variant-calling-gatk-1</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</guid>
	<pubDate>Mon, 05 Aug 2024 23:01:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</link>
	<title><![CDATA[UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment]]></title>
	<description><![CDATA[<p>UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment</p>
<ul>
<li>
<p>Using state of the art tools, easily extended for other viruses</p>
</li>
<li>
<p>Tool and database updates for critical components via Conda</p>
</li>
<li>
<p>Built using modern design patterns with Conda and Snakemake</p>
</li>
<li>
<p>Extensible and easy to customize</p>
</li>
<li>
<p>Submission Ready Genomes</p>
</li>
<li>
<p>Customizable reporting with comprehensive visualization</p>
</li>
</ul>
<p>https://ikim-essen.github.io/uncovar/</p>
<p>Github&nbsp;https://github.com/IKIM-Essen/uncovar</p>
<p>&nbsp;</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ikim-essen.github.io/uncovar/" rel="nofollow">https://ikim-essen.github.io/uncovar/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>