<?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/42012?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/42012?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39884/retrieving-taxonomic-information-with-r</guid>
	<pubDate>Thu, 29 Aug 2019 01:38:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39884/retrieving-taxonomic-information-with-r</link>
	<title><![CDATA[Retrieving Taxonomic Information with R]]></title>
	<description><![CDATA[<p>This vignette will introduce users to the retrieval of taxonomic information with&nbsp;<code>myTAI</code>. The&nbsp;<code>taxonomy()</code>&nbsp;function implemented in&nbsp;<code>myTAI</code>&nbsp;relies on the powerful package&nbsp;<a href="https://github.com/ropensci/taxize">taxize</a>. Nevertheless, taxonomic information retrieval has been customized for the&nbsp;<code>myTAI</code>&nbsp;standard and for organism specific information retrieval.</p>
<p>Specifically, the&nbsp;<code>taxonomy()</code>&nbsp;function implemented in&nbsp;<code>myTAI</code>&nbsp;can be used to classify genomes according to phylogenetic classification into Phylostrata (Phylostratigraphy) or to retrieve species specific taxonomic information when performing Divergence Stratigraphy (see&nbsp;<a href="https://cran.r-project.org/web/packages/myTAI/vignettes/Introduction.html">Introduction</a>&nbsp;for details).</p><p>Address of the bookmark: <a href="https://cran.r-project.org/web/packages/myTAI/vignettes/Taxonomy.html" rel="nofollow">https://cran.r-project.org/web/packages/myTAI/vignettes/Taxonomy.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40463/%E2%80%98dockr%E2%80%99-the-r-container</guid>
	<pubDate>Mon, 23 Dec 2019 09:56:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40463/%E2%80%98dockr%E2%80%99-the-r-container</link>
	<title><![CDATA[‘dockr’: the R container]]></title>
	<description><![CDATA[<p><code>dockr</code> 0.8.6 is now available on CRAN. <code>dockr</code> is a minimal toolkit to build a lightweight Docker container image for your R package, in which the package itself is available. The Docker image seeks to mirror your R session as close as possible with respect to R specific dependencies. Both dependencies on CRAN R packages as well as local non-CRAN R packages will be included in the Docker container image.</p>
<p>If you want to know, how Docker works, and why you should consider using Docker, please take a look at the <a href="https://www.docker.com/why-docker" target="_blank">Docker website</a>.</p><p>Address of the bookmark: <a href="https://www.docker.com/why-docker" rel="nofollow">https://www.docker.com/why-docker</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41041/post-doc-computational-biology-bioinformatics-network-biology-data-science-ngs-mfd</guid>
  <pubDate>Sat, 15 Feb 2020 06:13:35 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post Doc Computational Biology, Bioinformatics - Network Biology &amp; Data Science, NGS (m/f/d)]]></title>
  <description><![CDATA[
<p>https://www.jobvector.de/jobs-stellenangebote/biologie-life-sciences/forschung-entwicklung/post-doc-computational-biology-bioinformatics-network-biology-data-science-ngs-129867.html?suid=e522e9793b41817e52ac58d6963b94e2519920df</p>

<p>Requirements<br />Doctoral degree in Bioinformatics, Computational Biology, (Bio)physics/-mathematics, Biochemistry/Biology or similar with strong quantitative and numeric focus<br />Ability to numerically process complex and large data sets<br />Good programming skills (R/Bioconductor and/or Python preferred, Linux is a plus)<br />Experience in analyzing next-generation sequencing data sets using network biology<br />Scientific publication record in applied bioinformatics<br />Familiarity with single cell NGS analyses and other –omics techniques is a plus, but not essential</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43254/quasr-quantification-and-annotation-of-short-reads-in-r</guid>
	<pubDate>Fri, 13 Aug 2021 07:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43254/quasr-quantification-and-annotation-of-short-reads-in-r</link>
	<title><![CDATA[QuasR: Quantification and annotation of short reads in R]]></title>
	<description><![CDATA[<p>The <em><a href="https://bioconductor.org/packages/3.14/QuasR">QuasR</a></em> package (short for <em>Qu</em>antify and <em>a</em>nnotate <em>s</em>hort reads in <em>R</em>) integrates the functionality of several <strong>R</strong> packages (such as <em><a href="https://bioconductor.org/packages/3.14/IRanges">IRanges</a></em> <span>(Lawrence et al. 2013)</span> and <em><a href="https://bioconductor.org/packages/3.14/Rsamtools">Rsamtools</a></em>) and external software (e.g.&nbsp;<code>bowtie</code>, through the <em><a href="https://bioconductor.org/packages/3.14/Rbowtie">Rbowtie</a></em> package, and <code>HISAT2</code>, through the <em><a href="https://bioconductor.org/packages/3.14/Rhisat2">Rhisat2</a></em> package). The package aims to cover the whole analysis workflow of typical high throughput sequencing experiments, starting from the raw sequence reads, over pre-processing and alignment, up to quantification. A single <strong>R</strong> script can contain all steps of a complete analysis, making it simple to document, reproduce or share the workflow containing all relevant details.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/QuasR/inst/doc/QuasR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/QuasR/inst/doc/QuasR.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44362/biostats-book</guid>
	<pubDate>Mon, 14 Aug 2023 03:11:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44362/biostats-book</link>
	<title><![CDATA[Biostats book !]]></title>
	<description><![CDATA[<p>https://practical-stats-med-r.netlify.app/</p><p>Address of the bookmark: <a href="https://practical-stats-med-r.netlify.app/" rel="nofollow">https://practical-stats-med-r.netlify.app/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</guid>
	<pubDate>Thu, 22 Jan 2015 22:29:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</link>
	<title><![CDATA[Bioinformatics Scripts]]></title>
	<description><![CDATA[<p>Some of the useful bioinformatics scripts.</p>
<p>For example ... contig-stats.pl is a Perl script that will automatically describe features of a sequence assembly.</p>
<p>http://milkweedgenome.org/?q=scripts</p><p>Address of the bookmark: <a href="http://milkweedgenome.org/?q=scripts" rel="nofollow">http://milkweedgenome.org/?q=scripts</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/21982/which-bioinformatics-journals-do-you-follow</guid>
	<pubDate>Fri, 10 Apr 2015 12:10:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/21982/which-bioinformatics-journals-do-you-follow</link>
	<title><![CDATA[Which Bioinformatics Journals Do You Follow?]]></title>
	<description><![CDATA[<p><span><span>Which are your favorite bioinformatics journals? The ones that you check every month or so, or that you are subscribed to?</span></span></p>]]></description>
	<dc:creator>Tenzin Paul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:15:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper round THREE ...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22050" length="316" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22570/frequent-words-problem-solution-by-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:38:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22570/frequent-words-problem-solution-by-perl</link>
	<title><![CDATA[Frequent words problem solution by Perl]]></title>
	<description><![CDATA[<div><p>Solved with perl <a href="http://rosalind.info/problems/1a/">http://rosalind.info/problems/1a/</a></p><p>#Find the most frequent k-mers in a string.<br />#Given: A DNA string Text and an integer k.<br />#Return: All most frequent k-mers in Text (in any order).<br /><br />use strict;<br />use warnings;<br /><br />my $string="ACGTTGCATGTCGCATGATGCATGAGAGCT";<br />my $kmer=4; <br />my %myHash;<br />my $max=0;<br /><br />for (my $aa=0; $aa&lt;=(length($string)-4); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $myStr=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp; &nbsp;#print "$myStr\n";<br />&nbsp;&nbsp; &nbsp;my $km=kmerMatch ($string, $myStr, $kmer);<br />&nbsp;&nbsp; &nbsp;if ($km &gt; $max) { $max = $km;}<br />&nbsp;&nbsp; &nbsp;#print "$km\t$myStr\n";<br />&nbsp;&nbsp; &nbsp;$myHash{$myStr}=$km;<br />&nbsp;&nbsp; &nbsp;<br />}<br /><br />#Print all key which have matching values<br />foreach my $name (keys %myHash){<br />&nbsp;&nbsp;&nbsp; print "$name " if $myHash{$name} == $max;<br />}<br /><br />sub kmerMatch { #Check the exact matching kmers with sliding window<br />my ($string, $myStr, $kmer)=@_;<br />my $count=0;<br />for (my $aa=0; $aa&lt;=(length($string)-4); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $myWin=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp; &nbsp;if ($myWin eq $myStr) {<br />&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;#print "$myWin eq $myStr\n";<br />&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;$count++;<br />&nbsp;&nbsp; &nbsp;}<br />}<br />return $count;<br />}</p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22572/clump-finding-problem-solved-with-perl</guid>
	<pubDate>Wed, 10 Jun 2015 00:17:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22572/clump-finding-problem-solved-with-perl</link>
	<title><![CDATA[Clump Finding Problem Solved with Perl]]></title>
	<description><![CDATA[<p>The question at http://rosalind.info/problems/1d/</p><p>Script are moved to&nbsp;http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>