<?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/43957?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/43957?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35286/alfred-bam-statistics-and-feature-counting</guid>
	<pubDate>Tue, 23 Jan 2018 05:28:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35286/alfred-bam-statistics-and-feature-counting</link>
	<title><![CDATA[Alfred: BAM Statistics and Feature Counting]]></title>
	<description><![CDATA[<p>The easiest way to get Alfred is to download a statically linked binary from the&nbsp;<a href="https://github.com/tobiasrausch/alfred/releases/">Alfred github release page</a>. Alternatively, you can build Alfred from source. Alfred dependencies are included as submodules so you need to do a recursive clone.</p>
<p><code>git clone --recursive https://github.com/tobiasrausch/alfred.git</code></p>
<p><code>cd alfred/</code></p>
<p><code>make all</code></p>
<p>https://github.com/tobiasrausch/alfred/</p><p>Address of the bookmark: <a href="https://gear.embl.de/alfred" rel="nofollow">https://gear.embl.de/alfred</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/35868/simpson-lab</guid>
  <pubDate>Tue, 06 Mar 2018 08:59:09 -0600</pubDate>
  <link></link>
  <title><![CDATA[Simpson Lab]]></title>
  <description><![CDATA[
<p>We are the Statistical Bioinformatics group in the Institute for Adaptive and Neural Computation in the School of Informatics at the University of Edinburgh. The group is led by Dr. Ian Simpson who is a Lecturer in Biological Informatics in the School of Informatics at Edinburgh University. Details to follow....</p>

<p>http://statbio.github.io</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44601/free-resources-to-learn-statistics</guid>
	<pubDate>Sat, 06 Jul 2024 10:30:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44601/free-resources-to-learn-statistics</link>
	<title><![CDATA[Free resources to learn statistics]]></title>
	<description><![CDATA[<p><span>Welcome to the course notes for&nbsp;</span><span>STAT 414: Introduction to Probability Theory</span><span>. These notes are designed and developed by Penn State's&nbsp;</span><a href="https://science.psu.edu/stat">Department of Statistics</a><span>&nbsp;and offered as open educational resources. These notes are free to use under Creative Commons license&nbsp;</span><a href="https://creativecommons.org/licenses/by-nc/4.0/">CC BY-NC 4.0</a><span>.</span></p>
<p>&nbsp;</p>
<p>A free online version of the second edition of the book based on Stat 110,&nbsp;<em>Introduction to Probability</em>&nbsp;by Joe Blitzstein and Jessica Hwang,&nbsp;is now available at&nbsp;<a href="http://probabilitybook.net/" title="http://probabilitybook.net">http://probabilitybook.net</a></p>
<p>Print copies are available via&nbsp;<a href="https://www.crcpress.com/Introduction-to-Probability-Second-Edition/Blitzstein-Hwang/p/book/9781138369917" title="">CRC Press</a>,&nbsp;<a href="https://amzn.to/2Ubh7D8" title="">Amazon</a>, and elsewhere.&nbsp;</p>
<p>Stat110x is also available as an&nbsp;edX course.&nbsp;Free signup at&nbsp;<a href="https://www.edx.org/course/introduction-to-probability-0" title="https://www.edx.org/course/introduction-to-probability-0">https://www.edx.org/course/introduction-to-probability-0</a></p>
<p>The edX course focuses on animations, interactive features, readings, and problem-solving, and&nbsp;is&nbsp;<strong>complementary</strong>&nbsp;to the Stat 110 lecture videos on YouTube, which are available at&nbsp;<a href="https://goo.gl/i7njSb" title="https://goo.gl/i7njSb">https://goo.gl/i7njSb</a></p>
<p>The Stat110x animations are available within the course and at&nbsp;<a href="https://goo.gl/g7pqTo" title="">https://goo.gl/g7pqTo</a></p>
<p><a href="https://projects.iq.harvard.edu/stat110/home">https://projects.iq.harvard.edu/stat110/home</a>&nbsp;</p><p>Address of the bookmark: <a href="https://online.stat.psu.edu/stat414/" rel="nofollow">https://online.stat.psu.edu/stat414/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2727/download-mutliple-fasta-file-from-ncbi-in-one-go</guid>
	<pubDate>Wed, 21 Aug 2013 08:13:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2727/download-mutliple-fasta-file-from-ncbi-in-one-go</link>
	<title><![CDATA[Download mutliple fasta file from NCBI in one GO!!]]></title>
	<description><![CDATA[<p>if you have less time, then use three ways mentioned in bookmark link to extract/download all fasta sequences in single click given that you already have a list of GIs or accession IDs .</p>
<p>Alternatively, use one liner perl script:</p>
<p>perl -ne 'if(/^&gt;(\S+)/){$c=$i{$1}}$c?print:chomp;$i{$_}=1 if @ARGV' GIs.txt &gt;sequence.fasta</p>
<p>where GIs.txt contains&nbsp;a list of GIs or accession IDs.</p>
<p>(from :<a href="http://edwards.sdsu.edu/labsite/index.php/robert?start=5">http://edwards.sdsu.edu/labsite/index.php/robert?start=5</a>)</p><p>Address of the bookmark: <a href="http://edwards.sdsu.edu/labsite/index.php/robert/380-ncbi-sequence-or-fasta-batch-download-using-entrez" rel="nofollow">http://edwards.sdsu.edu/labsite/index.php/robert/380-ncbi-sequence-or-fasta-batch-download-using-entrez</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26968/scalce</guid>
	<pubDate>Fri, 15 Apr 2016 05:09:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26968/scalce</link>
	<title><![CDATA[SCALCE]]></title>
	<description><![CDATA[<p><span>SCALCE (</span><code>/skeɪlz/</code><span>, a.k.a. boosting&nbsp;</span><span style="text-decoration: underline;">S</span><span>equence&nbsp;</span><span style="text-decoration: underline;">C</span><span>ompression&nbsp;</span><span style="text-decoration: underline;">A</span><span>lgorithms using&nbsp;</span><span style="text-decoration: underline;">L</span><span>ocally&nbsp;</span><span style="text-decoration: underline;">C</span><span>onsistent</span><span style="text-decoration: underline;">E</span><span>ncoding) is a tool for compressing FASTQ files. It is designed specifically for the Illumina-generated FASTQ files, but supports any valid FASTQ with consistent read lengths.&nbsp;</span></p>
<p><span>More at&nbsp;http://sfu-compbio.github.io/scalce/</span></p><p>Address of the bookmark: <a href="http://sfu-compbio.github.io/scalce/" rel="nofollow">http://sfu-compbio.github.io/scalce/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</guid>
	<pubDate>Fri, 13 May 2016 04:54:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</link>
	<title><![CDATA[cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cleaning your data in this way is often required: Reads from small-RNA sequencing contain the 3&rsquo; sequencing adapter because the read is longer than the molecule that is sequenced. Amplicon reads start with a primer sequence. Poly-A tails are useful for pulling out RNA from your sample, but often you don&rsquo;t want them to be in your reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite <a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a> .</p><p>Address of the bookmark: <a href="https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart" rel="nofollow">https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart</a></p>]]></description>
	<dc:creator>Radha Agarkar</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/44571/panacus-a-counting-tool-for-pangenome-graphs</guid>
	<pubDate>Fri, 14 Jun 2024 14:42:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</link>
	<title><![CDATA[Panacus : A Counting Tool for Pangenome Graphs]]></title>
	<description><![CDATA[<p dir="auto"><code>panacus</code>&nbsp;is a tool for calculating statistics for&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA</a>&nbsp;files. It supports GFA files with&nbsp;<code>P</code>&nbsp;and&nbsp;<code>W</code>&nbsp;lines, but requires that the graph is&nbsp;<code>blunt</code>, i.e., nodes do not overlap and consequently, each link (<code>L</code>) points from the end of one segment (<code>S</code>) to the start of another.</p>
<p dir="auto"><code>panacus</code>&nbsp;supports the following calculations:</p>
<ul dir="auto">
<li>coverage histogram</li>
<li>pangenome growth statistics</li>
<li>path-/group-resolved coverage table</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marschall-lab/panacus" rel="nofollow">https://github.com/marschall-lab/panacus</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2335/embo-practical-course-bioinformatics-large-scale-data-at-shenzhen-china</guid>
  <pubDate>Wed, 14 Aug 2013 09:50:56 -0500</pubDate>
  <link></link>
  <title><![CDATA[EMBO Practical Course, Bioinformatics, large-scale data, at Shenzhen, China]]></title>
  <description><![CDATA[
<p>This international advanced course will provide training on bioinformatics and statistics methods for genomic research. It will give insight into how biological knowledge can be generated from high-throughput sequencing (DNA-Seq, RNA-seq, ChIP-seq) experiments and will illustrate how to analyze such data. The course covers both the underlying statistical and algorithmic concepts, and the practice of how to automate and code such analyses using the scripting language R.</p>

<p>17 Nov 2013 -22 Nov 2013</p>

<p>More at http://events.embo.org/13-large-scale-data/</p>

<p>Online Registration: https://www.conference-service.com/pc13-47/welcome.cgi</p>
]]></description>
</item>

</channel>
</rss>