<?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/13226?offset=870</link>
	<atom:link href="https://bioinformaticsonline.com/related/13226?offset=870" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26972/understanding-fastqc-output</guid>
	<pubDate>Fri, 15 Apr 2016 05:47:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26972/understanding-fastqc-output</link>
	<title><![CDATA[Understanding Fastqc Output]]></title>
	<description><![CDATA[<p>Understanding Following table and graphs</p>
<ol>
<li>Duplication level</li>
<li>kmer profile</li>
<li>per base GC content</li>
<li>per base N content</li>
<li>per base quality</li>
<li>per base sequence content</li>
<li>per sequence GC content</li>
<li>per sequence quality</li>
<li>sequence length distribution</li>
</ol>
<p>More at http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/</p><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/</a></p>]]></description>
	<dc:creator>Jit</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/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/27277/binc-2016</guid>
	<pubDate>Wed, 11 May 2016 07:15:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27277/binc-2016</link>
	<title><![CDATA[BINC 2016]]></title>
	<description><![CDATA[<p>Bioinformatics National Certification (BINC) Examination 2016</p><p>Department of Biotechnology, Government of India, New Delhi &amp; Pondicherry University, Puducherry</p><p>Starting of online submission of application : April 13, 2016</p><p>Last date for submission of application : May 13, 2016</p><p>Examination consists of two parts:</p><p>Part - I (Paper - I) : June 12, 2016 (10 AM -12 PM)<br />Part - II (Paper &bull; II &amp; III) : June 26, 2016 (9 AM &bull; 12 PM &amp; 2 PM &bull; 4 PM)</p><p>Objective: Pondicherry University, on behalf of the Department of Biotechnology (DBT),<br />Government of India, will conduct the Bioinformatics National Certification (BING) examination. The objective of this examination is to identify Bioinformatics professionals<br />for further studies as well as to help potential employers in recruitment of candidates having exceptionally good Bioinformatics skills.</p><p>Eligibility : Bachelor degree in Life Sciences, Physical Sciences, Chemical Sciences, Mathematical Sciences, Agriculture, Veterinary, Medicine, Pharmacy, Engineering and Technology are eligible to appear for the examination. They need not have any formal training, diploma or certificate in Bioinformatics.</p><p>Application and syllabus : The online application can be filled from April 13, 2016 to May 13, 2016.</p><p>Syllabus for the examination is available online.</p><p>It consists of five sections:<br />Bioinformatics, Biology, Physical and Chemical Sciences, Mathematics &amp; Statistics and Computer Science &amp; Information Technology.</p><p>Examination : The examination fee is Rs. 600/- for general candidates, Rs. 400/- for women/OBC candidates and Rs. 200 for SC/ST candidates, and no fee for physically challenged candidates.</p><p>The online Part - I (Paper - I) examination is scheduled on June 12,2016 and Part- II (Paper - II and Paper- III) on June 26, 2016. The Paper- I will be of objective type and candidates scoring a minimum of 40% marks in Paper - I will be called to appear in Part II examination.</p><p>Part II examination consists of two papers : The Paper - II will be of short answer type questions of three hours duration while the Paper- III will be a practical examination of two hours duration to test analytical ability and programming skill of candidates.</p><p>Research Fellowships for all the successful candidates those who are interested and qualified in pursuing Ph.D. in India will be awarded. In addition, cash prizes will be awarded to the top 10 successful candidates.</p><p>The details of examination centres, other details and submission of application, please<br />visit:&nbsp;<a href="http://www.pondiuni.edu.in/exams/binc/">http://www.pondiuni.edu.in/exams/binc/</a></p>]]></description>
	<dc:creator>Jit</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>

</channel>
</rss>