<?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/35272?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/35272?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34699/biological-file-format-tutorial</guid>
	<pubDate>Sun, 17 Dec 2017 18:13:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34699/biological-file-format-tutorial</link>
	<title><![CDATA[Biological file format tutorial]]></title>
	<description><![CDATA[<p>This section explains some of the commonly used file formats in bioinformatics. The information provided here is basic and designed to help users to distinguish the difference between different formats. Please refer user manual or other information resources on web for more details.</p>
<ol>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_fasta">FASTA</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_fastq">FASTQ</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_sam">SAM</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_bam">BAM</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_vcf">VCF</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_gff">GFF</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_gtf">GTF</a></li>
</ol><p>Address of the bookmark: <a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/" rel="nofollow">https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</guid>
	<pubDate>Fri, 01 Nov 2019 00:20:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</link>
	<title><![CDATA[Kalign: fast multiple sequence alignment program for biological sequences.]]></title>
	<description><![CDATA[<p><span>Kalign is a fast multiple sequence alignment program for biological sequences.</span></p>
<p>Align sequences and output the alignment in MSF format:</p>
<pre><code>kalign -i BB11001.tfa -f msf  -o out.msf
</code></pre>
<p>Align sequences and output the alignment in clustal format:</p>
<pre><code>kalign -i BB11001.tfa -f clu -o out.clu
</code></pre>
<p>Re-align sequences in an existing alignment:</p>
<pre><code>kalign -i BB11001.msf  -o out.afa
</code></pre>
<p>Reformat existing alignment:</p>
<pre><code>kalign -i BB11001.msf -r afa -o out.afa</code></pre><p>Address of the bookmark: <a href="https://github.com/TimoLassmann/kalign" rel="nofollow">https://github.com/TimoLassmann/kalign</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Mon, 13 Nov 2017 05:10:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[<p><span>Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data</span><br><code>AfterQC</code><span>&nbsp;can simply go through all fastq files in a folder and then output three folders:&nbsp;</span><span>good</span><span>,&nbsp;</span><span>bad</span><span>&nbsp;and&nbsp;</span><span>QC</span><span>&nbsp;folders, which contains good reads, bad reads and the QC results of each fastq file/pair.</span><br><span>Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other&nbsp;</span><a href="http://support.illumina.com/help/SequencingAnalysisWorkflow/Content/Vault/Informatics/Sequencing_Analysis/CASAVA/swSEQ_mCA_FASTQFiles.htm">Illumina 1.8 or newer formats</a></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34504/minion-gc-an-r-script-to-do-some-qc-on-minion-data</guid>
	<pubDate>Sun, 03 Dec 2017 15:19:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34504/minion-gc-an-r-script-to-do-some-qc-on-minion-data</link>
	<title><![CDATA[MinION_GC: An R script to do some QC on MinION data]]></title>
	<description><![CDATA[<p><span>Other tools focus on getting data out of the fastq or fast5 files, which is slow and computationally intensive. The benefit of this approach is that it works on a single, small, .txt summary file. So it's a lot quicker than most other things out there: it takes about a minute to analyse a 4GB flowcell on my laptop.</span></p>
<p>https://github.com/roblanf/minion_qc</p><p>Address of the bookmark: <a href="https://github.com/roblanf/minion_qc" rel="nofollow">https://github.com/roblanf/minion_qc</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Fri, 10 Aug 2018 18:41:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[<p>The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at&nbsp;<a href="https://github.com/wdecoster/nanopack" target="">https://github.com/wdecoster/nanopack</a>, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at&nbsp;<a href="http://nanoplot.bioinf.be/" target="">http://nanoplot.bioinf.be</a>&nbsp;and command line tools.</p>
<p>&nbsp;https://academic.oup.com/bioinformatics/article/34/15/2666/4934939</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanoQC" rel="nofollow">https://github.com/wdecoster/nanoQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</guid>
	<pubDate>Thu, 20 Dec 2018 12:03:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</link>
	<title><![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]></title>
	<description><![CDATA[<p><span>The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps:&nbsp;</span><em>prune</em><span>,&nbsp;</span><em>partition</em><span>,&nbsp;</span><em>rescue</em><span>,&nbsp;</span><em>optimize</em><span>&nbsp;and&nbsp;</span><em>build</em><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tangerzhang/ALLHiC/wiki" rel="nofollow">https://github.com/tangerzhang/ALLHiC/wiki</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</guid>
	<pubDate>Mon, 07 Jan 2019 10:35:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</link>
	<title><![CDATA[kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data]]></title>
	<description><![CDATA[<p><strong>kallisto</strong>&nbsp;is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of&nbsp;<em>pseudoalignment</em>&nbsp;for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data,&nbsp;<strong>kallisto</strong>&nbsp;can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and&nbsp;<strong>kallisto</strong>&nbsp;is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks&nbsp;<strong>kallisto</strong>&nbsp;significantly outperforms existing tools.&nbsp;<strong>kallisto</strong>&nbsp;is described in detail in:</p>
<p>Nicolas L Bray, Harold Pimentel, P&aacute;ll Melsted and Lior Pachter,&nbsp;<a href="http://www.nature.com/nbt/journal/v34/n5/full/nbt.3519.html">Near-optimal probabilistic RNA-seq quantification</a>, Nature Biotechnology&nbsp;<strong>34</strong>, 525&ndash;527 (2016), doi:10.1038/nbt.3519</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallisto/about" rel="nofollow">https://pachterlab.github.io/kallisto/about</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40525/heatmaply-popular-graphical-method-for-visualizing-high-dimensional-data</guid>
	<pubDate>Sat, 11 Jan 2020 07:34:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40525/heatmaply-popular-graphical-method-for-visualizing-high-dimensional-data</link>
	<title><![CDATA[heatmaply: popular graphical method for visualizing high-dimensional data]]></title>
	<description><![CDATA[<p>This work is based on ggplot2 and plotly.js engine. It produces similar heatmaps as d3heatmap, with the advantage of speed (plotly.js is able to handle larger size matrix), and the ability to zoom from the dendrogram.</p>
<p>heatmaply also provides an interface based around the&nbsp;<a href="https://cran.r-project.org/package=plotly">plotly R package</a>. This interface can be used by choosing&nbsp;<code>plot_method = "plotly"</code>&nbsp;instead of the default&nbsp;<code>plot_method = "ggplot"</code>. This interface can provide smaller objects and faster rendering to disk in many cases and provides otherwise almost identical features.</p>
<p>Documentation for this package is also available as a&nbsp;<a href="https://cran.r-project.org/package=pkgdown">pkgdown</a>&nbsp;site:&nbsp;<a href="http://talgalili.github.io/heatmaply/">http://talgalili.github.io/heatmaply/</a></p><p>Address of the bookmark: <a href="http://talgalili.github.io/heatmaply/articles/heatmaply.html" rel="nofollow">http://talgalili.github.io/heatmaply/articles/heatmaply.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</guid>
	<pubDate>Tue, 28 Jan 2020 03:44:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</link>
	<title><![CDATA[vt: a variant tool set that discovers short variants from Next Generation Sequencing data.]]></title>
	<description><![CDATA[<p><span>vt is a variant tool set that discovers short variants from Next Generation Sequencing data.</span></p>
<p><span><a href="https://genome.sph.umich.edu/wiki/Vt">https://genome.sph.umich.edu/wiki/Vt</a></span></p>
<p><a href="https://github.com/atks/vt">https://github.com/atks/vt</a></p><p>Address of the bookmark: <a href="https://genome.sph.umich.edu/wiki/Vt" rel="nofollow">https://genome.sph.umich.edu/wiki/Vt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>