<?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/26380?offset=960</link>
	<atom:link href="https://bioinformaticsonline.com/related/26380?offset=960" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</guid>
	<pubDate>Wed, 06 Apr 2016 13:27:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</link>
	<title><![CDATA[PEAR: a fast and accurate Illumina Paired-End reAd mergeR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p>
<p>More at&nbsp;http://www.exelixis-lab.org/web/software/pear</p>
<p>Paper:&nbsp;http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3933873/</p><p>Address of the bookmark: <a href="http://www.exelixis-lab.org/web/software/pear" rel="nofollow">http://www.exelixis-lab.org/web/software/pear</a></p>]]></description>
	<dc:creator>Jit</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/27035/spades</guid>
	<pubDate>Tue, 19 Apr 2016 08:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27035/spades</link>
	<title><![CDATA[SPAdes]]></title>
	<description><![CDATA[<p>SPAdes &ndash; St. Petersburg genome assembler &ndash; is intended for both standard isolates and single-cell MDA bacteria assemblies. This manual will help you to install and run SPAdes. SPAdes version 3.7.1 was released under GPLv2 on March 8, 2016 and can be downloaded from <a href="http://bioinf.spbau.ru/en/spades" target="_blank">http://bioinf.spbau.ru/en/spades</a>.</p>
<p>Manual at http://spades.bioinf.spbau.ru/release3.7.1/manual.html</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/spades" rel="nofollow">http://bioinf.spbau.ru/spades</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</guid>
	<pubDate>Tue, 10 May 2016 07:46:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</link>
	<title><![CDATA[BUSCO: Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs]]></title>
	<description><![CDATA[<ul>
<li><span>High-throughput genomics has revolutionized biological research, however, while the number of sequenced genomes grows by the day, quality assessment of the resulting assembled sequences remains complicated and mostly limited to technical measures like N50.&nbsp;</span></li>
<li></li>
<li><span>BUSCO provides measures for quantitative assessment of genome assembly, gene set, and transcriptome completeness based on evolutionarily informed expectations of gene content from near-universal single-copy orthologs selected from&nbsp;</span><a href="http://orthodb.org/">OrthoDB</a><span>.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments are implemented in open-source software, with comprehensive lineage-specific sets of Benchmarking Universal Single-Copy Orthologs for arthropods, vertebrates, metazoans, fungi, eukaryotes, and bacteria.&nbsp;</span></li>
<li></li>
<li><span>These conserved orthologs are ideal candidates for large-scale phylogenomics studies, and the annotated BUSCO gene models built during genome assessments provide a comprehensive gene predictor training set for use as part of genome annotation pipelines.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments offer intuitive metrics, based on evolutionarily informed expectations of gene content from hundreds of species, to gauge completeness of rapidly accumulating genomic data and satisfy an Iberian's quest for quality - "Busco calidad/qualidade".</span></li>
</ul><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27080/mrfast-micro-read-fast-alignment-search-tool</guid>
	<pubDate>Tue, 26 Apr 2016 03:50:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27080/mrfast-micro-read-fast-alignment-search-tool</link>
	<title><![CDATA[mrFAST:  Micro Read Fast Alignment Search Tool]]></title>
	<description><![CDATA[<p><span>mrFAST is a read mapper that is designed to map short reads to reference genome with a special emphasis on the discovery of structural variation and segmental duplications. mrFAST maps short reads with respect to user defined error threshold, including indels up to 4+4 bp. This manual, describes how to choose the parameters and tune mrFAST with respect to the library settings. mrFAST is designed to find&nbsp;</span><strong><span style="text-decoration: underline;">'all'</span></strong><span>&nbsp; mappings for a given set of reads, however it can return one "best" map location if the relevant parameter is invoked.</span></p>
<p><span>More at&nbsp;http://mrfast.sourceforge.net/manual.html</span></p><p>Address of the bookmark: <a href="http://mrfast.sourceforge.net/manual.html" rel="nofollow">http://mrfast.sourceforge.net/manual.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27211/srbioinformatics-analyst-ngs-ocimumbio</guid>
  <pubDate>Mon, 02 May 2016 04:41:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Sr.Bioinformatics Analyst (NGS) @ OcimumBio]]></title>
  <description><![CDATA[
<p>Sr.Bioinformatics Analyst (NGS)</p>

<p>Experience Required: 3-5 years of experience<br />No of Positions : Multiple<br />Qualifications: Candidates with minimum qualification as M.Sc Bioinformatics with 3-5  years of experience in Life sciences R&amp;D or Pharma Industry.<br />Ph.D candidates with research experience in Bioinformatics with publications in International journal and minimum 2 years of  industry experience in clinical genomics will be preferred for this position.</p>

<p>Requirement:</p>

<p>1.  Must have basic understanding of molecular biology and Genomics.<br />2. Experience in application development or must have expertise in programming using either of Perl/Python.<br />3.  Experience in statistical programming using R/Bioconductor/Matlab.<br />4. Strong concept in statistical and mathematical modelling.<br />5.  Experience in designing and developing the bioinformatics pipeline.<br />6.  Must have minimum 2+ years of hands on experience in NSG data analysis such as RNA-Seq,Exome-Seq ,Chip-Seq and downstream analysis.<br />7. Knowledge in WGS ,WES, Targeted re-sequencing,GWAS and population genomics will be preferred.<br />8. Must have experience working on opensource software/Framework and commercial software for NGS data analysis and reporting.<br />9. Should be aware of handling big data and guiding team members on multiple projects simultaneously.<br />More at http://www.ocimumbio.com/careers1/<br />10. Should have experience coordinating with different groups of clinical research scientist for various project requirements.<br />11. Ability to work as team as well as independently with minimal support.</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>

</channel>
</rss>