<?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/12944?offset=690</link>
	<atom:link href="https://bioinformaticsonline.com/related/12944?offset=690" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27070/venn-diagrams-on-r-studio</guid>
	<pubDate>Mon, 25 Apr 2016 16:22:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27070/venn-diagrams-on-r-studio</link>
	<title><![CDATA[Venn Diagrams on R Studio]]></title>
	<description><![CDATA[<h3>First step: Install &amp; load &ldquo;VennDiagram&rdquo; package.</h3>
<pre><code><span># install.packages('VennDiagram')</span>
<span>library</span><span>(</span><span>VennDiagram</span><span>)</span>
</code></pre>
<h3>Second step: Load data</h3>
<p>Add filepath if &ldquo;catdoge.csv&rdquo; is not in working-directory.</p>
<pre><code><span>d</span> <span>&lt;-</span> <span>read.csv</span><span>(</span><span>"catdoge.csv"</span><span>)</span></code><br><br></pre><p>Address of the bookmark: <a href="http://rstudio-pubs-static.s3.amazonaws.com/13301_6641d73cfac741a59c0a851feb99e98b.html" rel="nofollow">http://rstudio-pubs-static.s3.amazonaws.com/13301_6641d73cfac741a59c0a851feb99e98b.html</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</guid>
	<pubDate>Tue, 26 Apr 2016 11:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</link>
	<title><![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]></title>
	<description><![CDATA[<p>Canu is a fork of the&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler">Celera Assembler</a>&nbsp;designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.</p>
<p>Canu is a hierachical assembly pipeline which runs in four steps:</p>
<ul>
<li>Detect overlaps in high-noise sequences using&nbsp;<a href="https://github.com/marbl/MHAP" title="MHAP">MHAP</a></li>
<li>Generate corrected sequence consensus</li>
<li>Trim corrected sequences</li>
<li>Assemble trimmed corrected sequences</li>
</ul>
<p>Read the&nbsp;<a href="http://canu.readthedocs.org/" title="docs">documentation</a></p>
<p>New release https://github.com/marbl/canu/releases</p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27216/yass-genomic-similarity-search-tool</guid>
	<pubDate>Mon, 02 May 2016 09:26:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27216/yass-genomic-similarity-search-tool</link>
	<title><![CDATA[YASS :: genomic similarity search tool]]></title>
	<description><![CDATA[<p>YASS is a genomic similarity search tool, for nucleic (DNA/RNA) sequences in fasta or plain text format (<em>it produces local pairwise alignments</em>). Like most of the heuristic pairwise local alignment tools for DNA sequences (FASTA, BLAST, PATTERNHUNTER, BLASTZ/LASTZ, LAST ...), YASS uses <em>seeds</em> to detect potential similarity regions, and then tries to extend them to local alignments. This genomic search tool uses <em>multiple transition constrained spaced seeds</em> that enable to search more fuzzy repeats, as non-coding DNA/RNA. Another simple, but interesting feature is that you can specify the seed pattern used in the search step (as provided for example by <a href="http://bioinfo.lifl.fr/yass/iedera.php">iedera</a>).</p>
<p>Main features of YASS are:</p>
<ul>
<li>multiple, possibly overlapping seeds and a new hit criterion to ensure a good sensitivity/selectivity trade-off</li>
<li>transition-constrained spaced seeds to improve sensitivity (transition mutations are purine to purine [<code>A&lt;-&gt;G</code>] or pyrimidine to pyrimidine [<code>C&lt;-&gt;T</code>])</li>
<li>using different scoring schemes with bit-score and E-value evaluated according to the sequence background frequencies</li>
<li>parameterizable <em>output</em> filter for low complexity repeats</li>
<li>reporting of various alignment statistical parameters (mutation bias along triplets, transition/transversion)</li>
<li>post-processing step to group gapped alignments</li>
</ul><p>Address of the bookmark: <a href="http://bioinfo.lifl.fr/yass/" rel="nofollow">http://bioinfo.lifl.fr/yass/</a></p>]]></description>
	<dc:creator>Jit</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/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27465/stand-alone-programs-for-bioinformatician</guid>
	<pubDate>Sat, 21 May 2016 22:50:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27465/stand-alone-programs-for-bioinformatician</link>
	<title><![CDATA[Stand-alone programs for Bioinformatician]]></title>
	<description><![CDATA[<p>This directory contains applications for stand-alone use, built specifically for a Linux 64-bit machine.</p>
<p>For help on the bigBed and bigWig applications see:<br>http://genome.ucsc.edu/goldenPath/help/bigBed.html<br>http://genome.ucsc.edu/goldenPath/help/bigWig.html</p>
<p>View the file 'FOOTER' to see the usage statement for each of the applications.</p><p>Address of the bookmark: <a href="http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/" rel="nofollow">http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27540/research-associate-bioinformatics-at-manit</guid>
  <pubDate>Thu, 26 May 2016 02:20:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics at MANIT]]></title>
  <description><![CDATA[
<p>Research Associate Jobs opportunity in Maulana Azad National Institute of Technology (MANIT) on contract basis<br />Project : “Screening of Anti-venom potential of medicinal plants from Tribal region of Madhya Pradesh"<br />No. of Post : 01</p>

<p>Qualification : The minimum qualifications are : Ph.D in Bioinformatics/ Biotechnology or allied branches with atleast two publication in SCI journals.<br />Fellowship : The consolidated emoluments of Rs.36, 000/ PM+HRA+MA as per CSIR rules.</p>

<p>How to apply<br />Applications (in prescribed attached format and supporting documents) to be received in the Dr. Rahul Shrivastava, Principal Investigator (CSIR Project), Department of Biological Science and Engineering, Maulana Azad National Institute of Technology, Bhopal – 462003 (MP) on or before 7th June 2016.</p>

<p>More at http://www.web.manit.ac.in/Year%202016/Recruitment%20Contract%20Faculty/Biological/Advertisement%20for%20Antivenome%20project%202.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27685/biodbnet</guid>
	<pubDate>Thu, 02 Jun 2016 11:11:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27685/biodbnet</link>
	<title><![CDATA[BioDBnet]]></title>
	<description><![CDATA[<p><span>Database to Database Conversions</span> </p>
<p>db2db allows for conversions of identifiers from one database to other database identifiers or annotations. To use db2db select the input type of your data, changing the input type automatically changes the output options to the ones specific for the input selected. Then select one or more output types and add your identifiers in the ID list box. Set the remove duplicate values to 'No' if you do not want duplicates to be removed. Clicking on submit then returns a table of your inputs matched against all the outputs selected in the exact order as entered. Results can be limited to a particular taxon by entering it's <a href="https://biodbnet-abcc.ncifcrf.gov/tools/orgTaxon.php">Taxon ID</a>. The performance will vary widely depending on the number of outputs and the options selected. Conversions to a single output with the default options should complete in a few seconds</p><p>Address of the bookmark: <a href="https://biodbnet-abcc.ncifcrf.gov/db/db2db.php" rel="nofollow">https://biodbnet-abcc.ncifcrf.gov/db/db2db.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27701/assistant-professor-bioinformatics-teaching-assistant-at-gujarat-university</guid>
  <pubDate>Sat, 04 Jun 2016 16:04:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor Bioinformatics / Teaching Assistant at Gujarat University]]></title>
  <description><![CDATA[
<p>Assistant Professor Bioinformatics / Teaching Assistant Jobs recruitment in Gujarat University<br />Departments :</p>

<p>M.Sc. Bioinformatics Climate Change and Impacts Management<br />M.Sc. Biotechnology and Clinical Research</p>

<p>Department of Computer Science (Rollwala Computer Centre)<br />Appointment will be on purely contract basis for 11 months on consolidated salary. Reservation as per rules<br /> <br />How to apply<br />All the candidate are here by required to fill up the application form and given to concern Department, Gujarat University, Ahmedabad (Form can be submitted personally or thorough post/courier.) Candidates are supposed to attach the self attested photocopies of their required testimonials along with application form. Last date of receipt of application is 10/06/2016.</p>

<p>More http://www.gujaratuniversity.org.in/web/NWD/NewsEvents/1700_Recruitments%20at%20Gujarat%20University.asp</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</guid>
	<pubDate>Wed, 15 Jun 2016 17:18:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</link>
	<title><![CDATA[LoRMA: a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines]]></title>
	<description><![CDATA[<p>LoRMA is a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines.</p>
<p>Publication:</p>
<ul>
<li>L. Salmela, R. Walve, E. Rivals, and E. Ukkonen: Accurate selfcorrection of errors in long reads using de Bruijn graphs. Accepted to RECOMB-Seq 2016.</li>
</ul>
<p>Download:</p>
<ul>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/LoRMA-0.3.tar.gz">LoRMA 0.3 source files</a></li>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/README.txt">README</a></li>
</ul><p>Address of the bookmark: <a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/" rel="nofollow">https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>