<?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/36758?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/36758?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26993/lastz</guid>
	<pubDate>Mon, 18 Apr 2016 04:41:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26993/lastz</link>
	<title><![CDATA[LASTZ]]></title>
	<description><![CDATA[<p>LASTZ is a program for aligning DNA sequences, a pairwise aligner. Originally designed to handle sequences the size of human chromosomes and from different species, it is also useful for sequences produced by NGS sequencing technologies such as Roche 454.</p>
<p>More at http://www.bx.psu.edu/~rsharris/lastz/</p>
<p>Thesis: http://www.bx.psu.edu/~rsharris/rsharris_phd_thesis_2007.pdf</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/~rsharris/lastz/" rel="nofollow">http://www.bx.psu.edu/~rsharris/lastz/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23174/scaffolding-of-a-bacterial-genome-using-minion-nanopore-sequencing</guid>
	<pubDate>Tue, 07 Jul 2015 16:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23174/scaffolding-of-a-bacterial-genome-using-minion-nanopore-sequencing</link>
	<title><![CDATA[Scaffolding of a bacterial genome using MinION nanopore sequencing]]></title>
	<description><![CDATA[<p><span>Second generation sequencing has revolutionized genomic studies. However, most genomes contain repeated DNA elements that are longer than the read lengths achievable with typical sequencers, so the genomic order of several generated contigs cannot be easily resolved. A new generation of sequencers offering substantially longer reads is emerging, notably the Pacific Biosciences (PacBio) RS II system and the MinION system, released in early 2014 by Oxford Nanopore Technologies through an early access program.</span></p><p>Address of the bookmark: <a href="http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html" rel="nofollow">http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</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/bookmarks/view/26309/ratt</guid>
	<pubDate>Sun, 07 Feb 2016 16:09:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26309/ratt</link>
	<title><![CDATA[RATT]]></title>
	<description><![CDATA[<p><strong>RATT</strong> is software to transfer annotation from a reference (annotated) genome to an unannotated query genome.</p>
<p>It was first developed to transfer annotations between different genome assembly versions. However, it can also transfer annotations between strains and even different species, like <em>Plasmodium chabaudi</em> onto <em> P. berghei</em>, between different Leishmania species or <em>Salmonella enterica</em> onto other Salmonella serotypes. <strong>RATT</strong> is able to transfer any entries present on a reference sequence, such as the systematic id or an annotator's notes; such information would be lost in a <em>de novo</em> annotation.</p>
<p>More at http://ratt.sourceforge.net/</p><p>Address of the bookmark: <a href="http://ratt.sourceforge.net/" rel="nofollow">http://ratt.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</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/26752/rna-seq-de-novo-assembly-using-trinity</guid>
	<pubDate>Wed, 23 Mar 2016 05:53:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</link>
	<title><![CDATA[RNA-Seq De novo Assembly Using Trinity]]></title>
	<description><![CDATA[<p>Trinity, developed at the <a href="http://www.broadinstitute.org">Broad Institute</a> and the <a href="http://www.cs.huji.ac.il">Hebrew University of Jerusalem</a>, represents a novel method for the efficient and robust de novo reconstruction of transcriptomes from RNA-seq data. Trinity combines three independent software modules: Inchworm, Chrysalis, and Butterfly, applied sequentially to process large volumes of RNA-seq reads. Trinity partitions the sequence data into many individual de Bruijn graphs, each representing the transcriptional complexity at at a given gene or locus, and then processes each graph independently to extract full-length splicing isoforms and to tease apart transcripts derived from paralogous genes. Briefly, the process works like so:</p>
<ul>
<li>
<p><em>Inchworm</em> assembles the RNA-seq data into the unique sequences of transcripts, often generating full-length transcripts for a dominant isoform, but then reports just the unique portions of alternatively spliced transcripts.</p>
</li>
<li>
<p><em>Chrysalis</em> clusters the Inchworm contigs into clusters and constructs complete de Bruijn graphs for each cluster. Each cluster represents the full transcriptonal complexity for a given gene (or sets of genes that share sequences in common). Chrysalis then partitions the full read set among these disjoint graphs.</p>
</li>
<li>
<p><em>Butterfly</em> then processes the individual graphs in parallel, tracing the paths that reads and pairs of reads take within the graph, ultimately reporting full-length transcripts for alternatively spliced isoforms, and teasing apart transcripts that corresponds to paralogous genes.</p>
</li>
</ul>
<p>More at https://github.com/trinityrnaseq/trinityrnaseq/wiki</p>
<p>......................................................................................................................................</p>
<p>Download Trinity <a href="https://github.com/trinityrnaseq/trinityrnaseq/releases">here</a>.</p>
<p>Build Trinity by typing 'make' in the base installation directory.</p>
<p>Assemble RNA-Seq data like so:</p>
<pre><code> Trinity --seqType fq --left reads_1.fq --right reads_2.fq --CPU 6 --max_memory 20G 
</code></pre>
<p>Find assembled transcripts as: 'trinity_out_dir/Trinity.fasta'</p><p>Address of the bookmark: <a href="https://github.com/trinityrnaseq/trinityrnaseq/wiki" rel="nofollow">https://github.com/trinityrnaseq/trinityrnaseq/wiki</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</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/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/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/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>