<?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/34748?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/34748?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</guid>
	<pubDate>Tue, 28 Jan 2020 03:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</link>
	<title><![CDATA[VG: variation graph data structures, interchange formats, alignment, genotyping, and variant calling methods]]></title>
	<description><![CDATA[<p><em>Variation graphs</em>&nbsp;provide a succinct encoding of the sequences of many genomes. A variation graph (in particular as implemented in vg) is composed of:</p>
<ul>
<li><em>nodes</em>, which are labeled by sequences and ids</li>
<li><em>edges</em>, which connect two nodes via either of their respective ends</li>
<li><em>paths</em>, describe genomes, sequence alignments, and annotations (such as gene models and transcripts) as walks through nodes connected by edges</li>
</ul><p>Address of the bookmark: <a href="https://github.com/vgteam/vg" rel="nofollow">https://github.com/vgteam/vg</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</guid>
	<pubDate>Sun, 03 Apr 2022 20:35:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</link>
	<title><![CDATA[Merfin: improved variant filtering, assembly evaluation and polishing via k-mer validation]]></title>
	<description><![CDATA[<p><span>Merfin, a&nbsp;</span><em>k</em><span>-mer based variant-filtering algorithm for improved accuracy in genotyping and genome assembly polishing. Merfin evaluates each variant based on the expected&nbsp;</span><em>k</em><span>-mer multiplicity in the reads, independently of the quality of the read alignment and variant caller&rsquo;s internal score. Merfin increased the precision of genotyped calls in several benchmarks, improved consensus accuracy and reduced frameshift errors when applied to human and nonhuman assemblies built from Pacific Biosciences HiFi and continuous long reads or Oxford Nanopore reads, including the first complete human genome. Moreover, we introduce assembly quality and completeness metrics that account for the expected genomic copy numbers.</span></p>
<p><span>More at&nbsp;https://www.nature.com/articles/s41592-022-01445-y</span></p>
<p><img src="https://media.springernature.com/full/springer-static/image/art%3A10.1038%2Fs41592-022-01445-y/MediaObjects/41592_2022_1445_Fig1_HTML.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/arangrhie/merfin" rel="nofollow">https://github.com/arangrhie/merfin</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37666/ensembl-variation-calculated-variant-consequences</guid>
	<pubDate>Sun, 09 Sep 2018 19:17:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37666/ensembl-variation-calculated-variant-consequences</link>
	<title><![CDATA[Ensembl Variation - Calculated variant consequences]]></title>
	<description><![CDATA[<p><span>For each variant that is mapped to the reference genome, we identify all overlapping Ensembl transcripts. We then use a rule-based approach to predict the effects that each allele of the variant may have on each transcript. The set of consequence terms, defined by the&nbsp;</span><a href="http://www.sequenceontology.org/">Sequence Ontology</a><span>&nbsp;(SO), that can be currently assigned to each combination of an allele and a transcript is shown in the table below. Note that each allele of each variant may have a different effect in different transcripts.</span></p>
<p><span><img src="https://www.ensembl.org/info/genome/variation/prediction/consequences.jpg" width="1280" height="570" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://www.ensembl.org/info/genome/variation/prediction/predicted_data.html" rel="nofollow">https://www.ensembl.org/info/genome/variation/prediction/predicted_data.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Fri, 29 Jun 2018 03:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[AfterQC: Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data
AfterQC can simply go through all fastq files in a folder and then output three folders: good, bad and QC folders, which contains good reads, bad reads and the QC results of each fastq file/pair.
Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other Illumina 1.8 or newer formats

The author has reimplemented this tool in C++ with multithreading support to make it much faster. The new tool is called fastp and can be found at: https://github.com/OpenGene/fastp . If you prefer a C++ based tool, please use fastp instead.

https://github.com/OpenGene/AfterQC<p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/933/world-of-omics</guid>
	<pubDate>Tue, 16 Jul 2013 17:11:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/933/world-of-omics</link>
	<title><![CDATA[World of Omics]]></title>
	<description><![CDATA[<p>How many variants of "omics" techniques presently in use ?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4100/should-you-get-sequenced-not-all-bad-genes-predict-disease</guid>
	<pubDate>Thu, 29 Aug 2013 15:10:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4100/should-you-get-sequenced-not-all-bad-genes-predict-disease</link>
	<title><![CDATA[Should you get sequenced? Not all bad genes predict disease]]></title>
	<description><![CDATA[<p><span>&ldquo;What we really don&rsquo;t know yet is whether the predictive aspects of the genome are going to turn out to be beneficial or potentially harmful&rdquo;</span></p>
<p><span><span>&ldquo;As we roll out genomic medicine we are fighting against this society-wide misconception that having the bad gene means you&rsquo;re going to get the disease. That&rsquo;s only true in a very few cases.&rdquo;</span></span></p>
<p><span><span><strong>Source</strong>:Today Health</span></span></p><p>Address of the bookmark: <a href="http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154" rel="nofollow">http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4208/latest-paper-on-comparison-of-mapping-tools</guid>
	<pubDate>Tue, 03 Sep 2013 18:00:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4208/latest-paper-on-comparison-of-mapping-tools</link>
	<title><![CDATA[Latest paper on comparison of mapping tools]]></title>
	<description><![CDATA[<p>A. Hatem, D. Bozdag, A. E. Toland, U. V. Catalyurek "Benchmarking short sequence mapping tools" BMC Bioinformatics, 14(1):184, 2013.</p>
<p>http://bmi.osu.edu/hpc/software/benchmark/</p>
<p><a href="http://bmi.osu.edu/hpc/software/pmap/pmap.html">http://bmi.osu.edu/hpc/software/pmap/pmap.html</a></p>
<p>Other similiar papers:</p>
<p><a href="http://online.liebertpub.com/doi/pdf/10.1089/cmb.2012.0022">http://online.liebertpub.com/doi/pdf/10.1089/cmb.2012.0022</a></p>
<p><a href="http://bioinformatics.oxfordjournals.org/content/28/24/3169">http://bioinformatics.oxfordjournals.org/content/28/24/3169</a></p>
<p>Some new Mapping tool links:<a href="http://bmi.osu.edu/hpc/software/benchmark/"></a></p>
<p><strong>GSNAP</strong></p>
<p><a href="http://research-pub.gene.com/gmap/"></a><a href="http://research-pub.gene.com/gmap/">http://research-pub.gene.com/gmap/</a></p>
<p><strong>RMAP</strong></p>
<p><a href="http://rulai.cshl.edu/rmap/"></a><a href="http://rulai.cshl.edu/rmap/">http://rulai.cshl.edu/rmap/</a></p>
<p><strong>mrsFAST</strong></p>
<p><a href="http://mrsfast.sourceforge.net/Home"></a><a href="http://mrsfast.sourceforge.net/Home">http://mrsfast.sourceforge.net/Home</a></p>
<p><a href="http://sourceforge.net/projects/mrsfast/files/mrsfast-ultra-3.1.0/">http://sourceforge.net/projects/mrsfast/files/mrsfast-ultra-3.1.0/</a></p>
<p><strong>BFAST</strong></p>
<p><a href="http://sourceforge.net/apps/mediawiki/bfast/index.php?title=Main_Page">http://sourceforge.net/apps/mediawiki/bfast/index.php?title=Main_Page</a></p>
<p><strong>SHRiMP (for&nbsp;AB SOLiD color-space reads)</strong></p>
<p><a href="http://compbio.cs.toronto.edu/shrimp/">http://compbio.cs.toronto.edu/shrimp/</a></p>
<p><strong>RazerA 3</strong></p>
<p><a href="http://www.seqan.de/projects/razers/">http://www.seqan.de/projects/razers/</a></p><p>Address of the bookmark: <a href="http://www.biomedcentral.com/1471-2105/14/184" rel="nofollow">http://www.biomedcentral.com/1471-2105/14/184</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>