<?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/31568?offset=310</link>
	<atom:link href="https://bioinformaticsonline.com/related/31568?offset=310" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</guid>
	<pubDate>Sun, 22 Dec 2019 03:48:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</link>
	<title><![CDATA[SViper: Swipe your Structural Variants called on long (ONT/PacBio) reads with short exact (Illumina) reads.]]></title>
	<description><![CDATA[<p>Call sviper</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants
</code></pre>
<p>This will output a&nbsp;<code>polished_variants.vcf</code>&nbsp;file, that contains all the refined variants.</p>
<p>Sometimes it is helpful to look at the polished sequence, e.g. with the IGV browser. In that case you want SViper to output the polished and aligned sequences in a bam file via the option&nbsp;<code>--output-polished-bam</code>:</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants --output-</code>polished-bam</pre><p>Address of the bookmark: <a href="https://github.com/smehringer/SViper" rel="nofollow">https://github.com/smehringer/SViper</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24297/bioinformatics-walkin-at-nii</guid>
  <pubDate>Fri, 04 Sep 2015 21:48:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics WalkIn at NII]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT OF WALK-IN-INTERVIEW</p>

<p>NAME OF THE POST : Bioinformatician (Part time 3 days in a week) (One Position only)</p>

<p>DURATION : One Year</p>

<p>NAME OF THE PROJECT : Next generation sequencing facility</p>

<p>EDUCATIONAL QUALIFICATIONS : At least a Masters degree in Bioinformatics and Bachelors degree in any stream of life sciences</p>

<p>REQUIREMENTS :</p>

<p>Around 5 years of experience and proven track record in next generation sequence data analysis (supported by publications in peer-reviewed journals), ability to analyze transcriptomics, Chip-seq, and small RNA –seq data.</p>

<p>: Should have the ability to analyze raw primary data generated by Illumina next generation sequencing platforms and create / troubleshoot custom analysis Pipelines.</p>

<p>Should have ability to handle all downstream secondary and tertiary data analysis using commercially available as well as open source softwares (transcriptomics, ChIP-seq, small RNA-seq)</p>

<p>Apart from these, the applicant should have knowledge of the following: Programming: Perl and Python. Operating system:</p>

<p>Linux and Windows. NGS Analysis tools: Maq, BWA, Bowtie, SAM tools, BEDTools, MACS, Galaxy, FastQC, Bismark, MEDIPS, Tophat, Cufflinks, AvadisNGS, CLC Genomics Workbench, Galaxy, BaseSpace, Trinity Statistics: Microsoft Excel and R. Database: MySQL Genome Browser: UCSC, Ensemble, IGV, IGB Motif Analysis Tools: MEME Suite, Transfac and RSAT Functional Annotation Tools: DAVID, GeneCodis, Gene Cards Networking Tools: Cytoscape</p>

<p>EMOLUMENTS : The incumbent will be paid a fee of Rs. 2000/- per sitting/ per day.</p>

<p>SCIENTIST NAME : Dr. Arnab Mukhopadhyay,</p>

<p>Staff Scientific V Next generation sequencing facility</p>

<p>SCIENTIST’S E-MAIL ID : arnab@nii.ac.in</p>

<p>WALK IN INTERVIEW ON : 18th September, 2015</p>

<p>REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM</p>

<p>PLEASE NOTE- 1. CANDIDATE MAY FILL UP APPLICATION IN THE PRECRIBED FORMAT ALONG WITH NECESSARY DOCUMENTS FOR VERIFICATION. 2. APPLICATIONS CONTAINING INCOMPLETE INFORMATION SHALL NOT BE ENTERTAINED. 3. DATE OF PASSING THE EXAMINATIONS MUST BE INDICATED CLEARLY. 4. ONLY REGISTERED CANDIDATES WILL BE INTERVIEWED. 5. NO TA/DA WILL BE PAID FOR ATTENDING THE INTERVIEW PRESCRIBED FORM 1. NAME 2. FATHER’S NAME 3. MOTHER’S NAME 4. DATE OF BIRTH 5. SEX (MALE/FEMALE) 6. CATEGORY (SC/ ST/ OBC/ PH) 7. ADDRESS a. (CORRSPONDENCE) b. (PERMANENT) 8. E MAIL, TELEPHONE NO. &amp; MOBILE No (if any) 9. ACADEMIC &amp; PROFESSIONAL QUALIFICATIONS NAME OF EXAMINATION PASSED WITH SUBJECTS YEAR OF PASSING BOARD/ UNIVERSITY PERCENTAGE/ DIVISION REMARKS 10. PAST EXPERIENCE &amp; PRESENT EMPLOYMENT, IF ANY 11. CANDIDATES SHOULD STATE CLEARLY WHETHER THEY HAVE BEEN AWARDED PH.D DEGREE OR THESIS HAS BEEN SUBMITTED. 12. HAVE YOU APPLIED FOR A POSITION EARLIER IN THE INSTITUTE? IF SO:- (1) THE DETAILS OF THE PROJECT AND PROJECT INVESTIGATOR (2) IF CALLED FOR INVERVIEW, RESULTS THEREOF</p>

<p>More at http://www1.nii.res.in/sites/default/files/walkininterview-18sept2015.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24762/postdoctoral-fellowship-in-bioinformatics-at-pesolelab</guid>
  <pubDate>Thu, 01 Oct 2015 07:20:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Fellowship in Bioinformatics at pesolelab]]></title>
  <description><![CDATA[
<p>Job Description: Bioinformatics postdoc positions are available in the area of genomics with main focus on exome and RNAseq technologies by ultra high-throughput sequencing platforms. Successful applicants should have the following qualities:</p>

<p>1) demonstrated experience in Bioinformatics research,<br />2) programing experience (python and/or R, C and C++ are very welcome),<br />3) knowledge of Linux/Unix environment,<br />4) experience in handling deep-seq data,<br />5) highly motivated and hard working, and<br />6) interested to work with a multi-disciplinary team combining bioinformatics, genomics, computational biology approaches with experimental biology.</p>

<p>Our research interest covers different areas of bioinformatics and genomics in order to achieve a deeper understanding of gene and genome structure and function (please look at our PubMed publications for more details about our research http://www.ncbi.nlm.nih.gov/pubmed/?term=pesole+g).</p>

<p>Interested applicants should email the curriculum vitae to Prof. Graziano Pesole at graziano.pesole@uniba.it or Dr. Ernesto Picardi at Ernesto.picardi@uniba.it.</p>

<p>Start date: immediate</p>

<p>Duration: up to 24 months<br />Contact Person (Referent): Ernesto Picardi<br />Ref. E-Mail: ernesto.picardi@uniba.it<br />Tel: +390805443308<br />Fax: +390805443317</p>

<p>Group Web Page: http://www.pesolelab.it/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43254/quasr-quantification-and-annotation-of-short-reads-in-r</guid>
	<pubDate>Fri, 13 Aug 2021 07:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43254/quasr-quantification-and-annotation-of-short-reads-in-r</link>
	<title><![CDATA[QuasR: Quantification and annotation of short reads in R]]></title>
	<description><![CDATA[<p>The <em><a href="https://bioconductor.org/packages/3.14/QuasR">QuasR</a></em> package (short for <em>Qu</em>antify and <em>a</em>nnotate <em>s</em>hort reads in <em>R</em>) integrates the functionality of several <strong>R</strong> packages (such as <em><a href="https://bioconductor.org/packages/3.14/IRanges">IRanges</a></em> <span>(Lawrence et al. 2013)</span> and <em><a href="https://bioconductor.org/packages/3.14/Rsamtools">Rsamtools</a></em>) and external software (e.g.&nbsp;<code>bowtie</code>, through the <em><a href="https://bioconductor.org/packages/3.14/Rbowtie">Rbowtie</a></em> package, and <code>HISAT2</code>, through the <em><a href="https://bioconductor.org/packages/3.14/Rhisat2">Rhisat2</a></em> package). The package aims to cover the whole analysis workflow of typical high throughput sequencing experiments, starting from the raw sequence reads, over pre-processing and alignment, up to quantification. A single <strong>R</strong> script can contain all steps of a complete analysis, making it simple to document, reproduce or share the workflow containing all relevant details.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/QuasR/inst/doc/QuasR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/QuasR/inst/doc/QuasR.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26332/pilon</guid>
	<pubDate>Mon, 08 Feb 2016 15:56:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26332/pilon</link>
	<title><![CDATA[Pilon]]></title>
	<description><![CDATA[<p>Pilon is a software tool which can be used to:</p>
<ul>
<li>Automatically improve draft assemblies</li>
<li>Find variation among strains, including large event detection</li>
</ul>
<p>Pilon requires as input a FASTA file of the genome along with one or more BAM files of reads aligned to the input FASTA file. Pilon uses read alignment analysis to identify inconsistencies between the input genome and the evidence in the reads. It then attempts to make improvements to the input genome, including:</p>
<ul>
<li>Single base differences</li>
<li>Small indels</li>
<li>Larger indel or block substitution events</li>
<li>Gap filling</li>
<li>Identification of local misassemblies, including optional opening of new gaps</li>
</ul>
<p>More at https://github.com/broadinstitute/pilon/wiki</p><p>Address of the bookmark: <a href="https://github.com/broadinstitute/pilon/wiki" rel="nofollow">https://github.com/broadinstitute/pilon/wiki</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26414/advanced-bash-scripting-guide</guid>
	<pubDate>Thu, 18 Feb 2016 04:50:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26414/advanced-bash-scripting-guide</link>
	<title><![CDATA[Advanced Bash-Scripting Guide]]></title>
	<description><![CDATA[<p>This tutorial assumes no previous knowledge of scripting or programming, yet progresses rapidly toward an intermediate/advanced level of instruction <em>. . . all the while sneaking in little nuggets of <span>UNIX</span>&reg; wisdom and lore</em>. It serves as a textbook, a manual for self-study, and as a reference and source of knowledge on shell scripting techniques. The exercises and heavily-commented examples invite active reader participation, under the premise that <tt><strong>the only way to really learn scripting is to write scripts</strong></tt>.</p>
<p>This book is suitable for classroom use as a general introduction to programming concepts.</p>
<p>More at http://tldp.org/LDP/abs/html/</p><p>Address of the bookmark: <a href="http://tldp.org/LDP/abs/html/" rel="nofollow">http://tldp.org/LDP/abs/html/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/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>

</channel>
</rss>