<?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/22920?offset=1260</link>
	<atom:link href="https://bioinformaticsonline.com/related/22920?offset=1260" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27113/picard</guid>
	<pubDate>Fri, 29 Apr 2016 08:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27113/picard</link>
	<title><![CDATA[Picard]]></title>
	<description><![CDATA[<p>Picard is a set of command line tools for manipulating high-throughput sequencing (HTS) data and formats such as SAM/BAM/CRAM and VCF. These file formats are defined in the <a href="http://samtools.github.io/hts-specs/">Hts-specs</a> repository. See especially the <a href="http://samtools.github.io/hts-specs/SAMv1.pdf">SAM specification</a> and the <a href="http://samtools.github.io/hts-specs/VCFv4.3.pdf">VCF specification</a>.</p>
<p>Note that the information on this page is targeted at end-users. For developers, the source code, building instructions and implementation/development resources are available on <a href="https://github.com/broadinstitute/picard">GitHub</a>.</p>
<p>The Picard toolkit is open-source under the <a href="https://tldrlegal.com/license/mit-license">MIT license</a> and free for all uses.</p>
<p>Enjoy!</p><p>Address of the bookmark: <a href="http://broadinstitute.github.io/picard/" rel="nofollow">http://broadinstitute.github.io/picard/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26712/post-doctoral-fellow-jobs-opportunity-in-srm-university</guid>
  <pubDate>Thu, 17 Mar 2016 11:20:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[Post-Doctoral Fellow Jobs opportunity in SRM University]]></title>
  <description><![CDATA[
<p>Post-Doctoral Fellow Jobs opportunity in SRM University</p>

<p>Essential qualification : Ph.D. in Bioinformatics/Biotechnology/Genetics/Computational Biology.Understanding of genomics data and advanced knowledge of Java, and C/C++ as the programming languages and the scripting language like perl and/or Python, SQL is preferred. Experience in High Performance Computing, data architecture, database development is desirable</p>

<p>Fellowship: Rs 35,000 /-<br /> <br />How to apply</p>

<p>Candidates are requested to send their CV, and a brief summary of research experience by e-mail careers.genetics@ktr.srmuniv.ac.in  on or before 30/03/2016.</p>

<p>More at http://www.srmuniv.ac.in/jobs-applications-for-position-of-post-doctoral-fellow</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26823/srf-at-nrcpb-new-deslhi</guid>
  <pubDate>Fri, 25 Mar 2016 04:53:11 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF at NRCPB, New Deslhi]]></title>
  <description><![CDATA[
<p>NRCPB Recruitment 2016 – Walk in for SRF &amp; Young Professional Posts: National Research Centre on Plant Biotechnology (NRCPB) has announced a notification for the recruitment of Senior Research Fellow &amp; Young Professional Scheme vacancies for the project “NPTC Co-ordinating Cell” on temporary &amp; co-terminus basis. Eligible candidates may walk in interview on 29-03-2016 at 10.00 AM. Other details like age limit, educational qualification, selection process &amp; how to apply are given below…</p>

<p>NRCPB Vacancy Details:<br />Total No.of Posts: 02 <br />Name of the Posts:<br />1. Senior Research Fellow: 01 Post<br />2. Young Professional Scheme: 01 Post</p>

<p>Age Limit: Candidates maximum age should be 35 years. Age relaxation 5 years for SC/ ST/ OBC and women candidates as per ICAR rules.</p>

<p>Educational Qualification: Candidates should posses M.Sc/ M.Tech/ M.C.A. in Molecular Biology/ Biotechnology/ Life Sciences/ Allied Sciences/ Agricultural Sciences/ Computer Science/ Bioinformatics with 1st division or 60% marks or equivalent.</p>

<p>Selection Process: Candidates will be selected based on interview.</p>

<p>How to Apply: Eligible candidates may attend the interview along with four copies of biodata, original certificates, attested photocopies of each of the certificates and an attested copy of recent passport size photograph at NRCPB, LBS Building, Pusa Campus, New Delhi- 110012 on 29-03-2016 at 10.00 AM.</p>

<p>Important Dates:<br />Date &amp; Time of Interview: 29-03-2016 at 10.00 AM.<br />Venue: NRCPB, LBS Building, Pusa Campus, New Delhi-110012.</p>

<p>Read more: http://www.nrcpb.res.in/content/walk-interview-srf-and-yp</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26876/one-year-internship-in-computational-biology-bioinformatics</guid>
  <pubDate>Mon, 04 Apr 2016 05:35:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[One-Year Internship In Computational Biology &amp; Bioinformatics]]></title>
  <description><![CDATA[
<p>This one-year internship program has an inter-disciplinary curriculum that rests on research strengths and infrastructure at the computational biology &amp; bioinformatics facility at Rajiv Gandhi Centre for Biotechnology . Using live demonstration platforms of high end genomic analysis systems including next generation sequencing, advanced proteomics platforms, advanced bio-imaging, student seminars in addition to computer laboratory based courses, interns will get state of the art exposure and training in application of bioinformatics to biomedical research.The internship involves 8 months of hands on training in wet and dry laboratory methods and a four-month dissertation. This internship program is designed for students who would like to gain good knowledge and experience in Bioinformatics as a prelude to taking up a PhD course or look for employment opportunities. The subjects covered during the internship will include but not limited to: <br />• Systems Biology<br />• Genomic Informatics<br />• Proteomic Informatics<br />• Biomedical Text Mining<br />• Ontologies<br />• Data Integration<br />• Data Mining<br />• Protein Structure &amp; Function<br />• Metabolomics<br />• Molecular Evolution<br />• Pathways &amp; Networks<br />• Resource Development<br />• Scripting &amp; Algorithms<br />Qualifications: Admission to the Internship requires a first class degree in Engineering Sciences (Biotechnology/Computer Science), Medical/Dental/Pharmaceutical Sciences (MBBS or BDS or BAM or B.Pharm) or a Masters degree in Life Science, Medical Laboratory Technology, Biotechnology, Bioinformatics or Computer Science.<br />Internship Fees: The internship fee for the 12-month program is Rupees 70,000 (Rupees Seventy thousand). This is payable as an initial admission fee of Rs. 10,000 followed by payments of Rs. 6,000 monthly from months 3 to 9. The final completion certificate will be given after payment of all fees. <br />Mode of Selection: Selection will be based on interview and the top 5 candidates will be shortlisted for the program.<br />Location: Thiruvananthapuram</p>

<p>More at http://rgcb.res.in/TrainingPrograms/internship.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</guid>
	<pubDate>Wed, 06 Apr 2016 08:21:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</link>
	<title><![CDATA[Sequence assembly with MIRA 4]]></title>
	<description><![CDATA[<p>MIRA is a multi-pass DNA sequence data assembler/mapper for whole genome and EST/RNASeq projects. MIRA assembles/maps reads gained by</p>
<div>
<ul>
<li>
<p>electrophoresis sequencing (aka Sanger sequencing)</p>
</li>
<li>
<p>454 pyro-sequencing (GS20, FLX or Titanium)</p>
</li>
<li>
<p>Ion Torrent</p>
</li>
<li>
<p>Solexa (Illumina) sequencing</p>
</li>
<li>
<p>(in development) Pacific Biosciences sequencing</p>
</li>
</ul>
</div>
<p>into contiguous sequences (called <span><em>contigs</em></span>). One can use the sequences of different sequencing technologies either in a single assembly run (a <span><em>true hybrid assembly</em></span>) or by mapping one type of data to an assembly of other sequencing type (a <span><em>semi-hybrid assembly (or mapping)</em></span>) or by mapping a data against consensus sequences of other assemblies (a <span><em>simple mapping</em></span>).</p>
<p>The MIRA acronym stands for <span><strong>M</strong></span>imicking <span><strong>I</strong></span>ntelligent <span><strong>R</strong></span>ead <span><strong>A</strong></span>ssembly and the program pretty well does what its acronym says (well, most of the time anyway). It is the Swiss army knife of sequence assembly that I've used and developed during the past 14 years to get assembly jobs I work on done efficiently - and especially accurately. That is, without me actually putting too much manual work into it.</p>
<p>More at http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</p><p>Address of the bookmark: <a href="http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html" rel="nofollow">http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</a></p>]]></description>
	<dc:creator>Priya Singh</dc:creator>
</item>
<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/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>

</channel>
</rss>