<?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/27238?offset=430</link>
	<atom:link href="https://bioinformaticsonline.com/related/27238?offset=430" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/27098/bioinformatics-faculty-at-tnu</guid>
  <pubDate>Wed, 27 Apr 2016 10:07:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Faculty at TNU]]></title>
  <description><![CDATA[
<p>TNU is hiring faculty as Professors, Associate Professors and Assistant Professors in the following research and teaching programs.</p>

<p>Basic Sciences</p>

<p>Biotechnology &amp; Bioinformatics</p>

<p>Qualifications are as per UGC norms. Please visit www.ugc.ac.in.</p>

<p>Educational, Age and experience requirements will be relaxed in exceptional cases.</p>

<p>Interested candidates are requested to apply with their complete CV with list of Publications, Patents, Industry and teaching experience at Undergraduate and Postgraduate level along with other relevant information to hr@tnu.in </p>

<p>Provide names and contact details of at least two references for confidential evaluation. </p>

<p>We follow Central University pay scales and few additional perks.     </p>

<p>TNU follows highly liberal HR Policy with no salary constraint for exceptional candidates.</p>

<p>Applications are invited for the positions of - Professor, Associate Professor &amp; Assistant Professor.<br />https://drive.google.com/file/d/0B0Y1Fpxmzyd3OHQ3aUNYa3hZY2c/view?usp=sharing</p>

<p>Reference<br />- Times of India, Ascent as on 20.04.2016.</p>
]]></description>
</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/news/view/27235/supposedly-educational-r</guid>
	<pubDate>Tue, 03 May 2016 16:43:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27235/supposedly-educational-r</link>
	<title><![CDATA[Supposedly Educational R]]></title>
	<description><![CDATA[<p>R 3.3.0 (codename &ldquo;Supposedly Educational&rdquo;)&nbsp;was <a href="http://r.789695.n4.nabble.com/R-3-3-0-is-released-td4720368.html" target="_blank">released today</a>.&nbsp;You can get the latest binaries version <strong><a href="http://cran.rstudio.com/" target="_blank">from here</a>.</strong>&nbsp;(or the .tar.gz&nbsp;<strong>source</strong> code from <a href="http://cran.r-project.org/src/base/R-3/R-3.3.0.tar.gz" target="_blank">here</a>).&nbsp;The full list of new features and bug fixes is provided below.</p><p>If you are using <strong>Windows&nbsp;</strong>you can easily upgrade to the latest version of R using <a href="http://cran.r-project.org/web/packages/installr/" target="_blank">the installr package</a>. Simply run the following code in Rgui:</p><div><table width="710">
<tbody>
<tr id="p613882">
<td id="p61388code2">
<pre><span style="color: #0000ff; font-weight: bold;">install.<span>packages</span></span><span style="color: #080;">(</span><span style="color: #ff0000;">"installr"</span><span style="color: #080;">)</span> <span style="color: #228b22;"># install </span>
setInternet2<span style="color: #080;">(</span>TRUE<span style="color: #080;">)</span>
installr<span style="color: #080;">::</span><span>updateR</span><span style="color: #080;">(</span><span style="color: #080;">)</span> <span style="color: #228b22;"># updating R.</span></pre>
</td>
</tr>
</tbody>
</table></div><p><span>Running &ldquo;updateR()&rdquo; will detect if there is a new R version available, and if so it will download+install it (etc.). There is also <a href="http://www.r-statistics.com/2015/06/a-step-by-step-screenshots-tutorial-for-upgrading-r-on-windows/" target="_blank">a&nbsp;step by step tutorial (with screenshots) on how to upgrade R on Windows, using the <em>installr</em></a>&nbsp;package. If you only see the option to upgrade to an older version of R, then change your mirror or try again in a few hours (it usually take around 24 hours for all CRAN mirrors to get the latest version of R).</span></p><p><em>I try to keep the <a href="https://github.com/talgalili/installr" target="_blank">installr</a> package updated and useful, so if you have any suggestions or remarks on the package &ndash; you are invited to <a href="https://github.com/talgalili/installr/issues" target="_blank">open an issue in the github page</a>.</em></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/27279/do-you-think-its-important-for-everyone-to-pass-binc-exam</guid>
	<pubDate>Wed, 11 May 2016 07:25:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/27279/do-you-think-its-important-for-everyone-to-pass-binc-exam</link>
	<title><![CDATA[Do you think it's important for everyone to pass BINC exam?]]></title>
	<description><![CDATA[<p><span>The Department of Biotechnology (DBT), Government of India has instituted BINC examination with the objective of evaluating the Bioinformatics knowledge &amp; skills of students. Do you think it is important ?</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/27316/sample-binc-question-paper-2016-part1</guid>
	<pubDate>Fri, 13 May 2016 03:41:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/27316/sample-binc-question-paper-2016-part1</link>
	<title><![CDATA[Sample BINC question paper 2016 - part1]]></title>
	<description><![CDATA[<p>Please download the sample bioinformatics question paper for BINC 2016</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/27316" length="40276" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27328/platanus</guid>
	<pubDate>Fri, 13 May 2016 05:12:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27328/platanus</link>
	<title><![CDATA[Platanus]]></title>
	<description><![CDATA[<p>Platanus is a novel <em>de novo</em> sequence assembler that can reconstruct genomic sequences of<br> highly heterozygous diploids from massively parallel shotgun sequencing data.</p>
<p>The latest version is <a href="http://platanus.bio.titech.ac.jp/platanus/?page_id=14">1.2.4</a>.</p>
<p>To cite Platanus, please use the following:</p>
<p>Kajitani R, Toshimoto K, Noguchi H, Toyoda A, Ogura Y, Okuno M, Yabana M, Harada M, Nagayasu E, Maruyama H, Kohara Y, Fujiyama A, Hayashi T, Itoh T, &ldquo;Efficient de novo assembly of highly heterozygous genomes from whole-genome shotgun short reads&rdquo;.&nbsp;Genome Res. 2014 Aug;24(8):1384-95. doi: 10.1101/gr.170720.113. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/24755901">abstract</a> |<a href="http://genome.cshlp.org/content/24/8/1384.long"> full text</a>]</p><p>Address of the bookmark: <a href="http://platanus.bio.titech.ac.jp/" rel="nofollow">http://platanus.bio.titech.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/27412/navin-lab</guid>
  <pubDate>Wed, 18 May 2016 16:40:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[Navin Lab]]></title>
  <description><![CDATA[
<p>NAvin laboratory has pioneered the development of single cell sequencing technologies.  They apply these tools to study complex biological processes that occur in human cancers including tumor initation, clonal evolution, invasion, metastasis and chemoresistance.  These processes have previously been difficult to study with genomic technologies using bulk tissues</p>

<p>More at http://www.navinlab.com/navinlab/home.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27453/senior-project-fellow-bioinformatics-at-nbri</guid>
  <pubDate>Sat, 21 May 2016 21:01:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Project Fellow Bioinformatics at NBRI]]></title>
  <description><![CDATA[
<p>Walk In Interview No. 03/Project/2016<br />Senior Project Fellow Bioinformatics Job vacancies in CSIR- National Botanical Research Institute (NBRI), Lucknow<br />Area III: Molecular Biology &amp; Biotechnology<br />Qualification : 1st Class M.Sc. in Bioinformatics/Biotechnology/ Life Science /Biochemistry/Botany with 2 years research experience and at least one publication in SCI Journal or 1st class M.Tech in Bioinformatics<br />Age : 32 years<br />Salary : Rs.18000<br />How to apply<br />Date &amp; Venue of Interview For Area III: 27-05-2016 at 11.00 A.M. at Conference Room, T.N. Khushoo Block, NBRI, Lucknow.</p>

<p>http://www.nbri.res.in/temp.php</p>
]]></description>
</item>

</channel>
</rss>