<?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/26325?offset=1030</link>
	<atom:link href="https://bioinformaticsonline.com/related/26325?offset=1030" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37223/chopstitch-exon-annotation-and-splice-graph-construction-using-transcriptome-assembly-and-whole-genome-sequencing-data</guid>
	<pubDate>Tue, 03 Jul 2018 04:14:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37223/chopstitch-exon-annotation-and-splice-graph-construction-using-transcriptome-assembly-and-whole-genome-sequencing-data</link>
	<title><![CDATA[ChopStitch: exon annotation and splice graph construction using transcriptome assembly and whole genome sequencing data]]></title>
	<description><![CDATA[ChopStitch is a new method for finding putative exons and constructing splice graphs using an assembled transcriptome and whole genome shotgun sequencing (WGSS) data. ChopStitch identifies exon-exon boundaries in de novo assembled RNA-seq data with the help of a Bloom filter that represents the k-mer spectrum of WGSS reads. The algorithm also detects base substitutions in transcript sequences corresponding to sequencing or assembly errors, haplotype variations, or putative RNA editing events. The primary output of our tool is a FASTA file containing putative exons. Further, exon edges are interrogated for alternative exon-exon boundaries to detect transcript isoforms, which are reported as splice graphs in dot output format.<p>Address of the bookmark: <a href="https://github.com/bcgsc/ChopStitch" rel="nofollow">https://github.com/bcgsc/ChopStitch</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</guid>
	<pubDate>Thu, 14 May 2020 15:09:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</link>
	<title><![CDATA[LR_Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly]]></title>
	<description><![CDATA[<p>LR_Gapcloser is a gap closing tool using long reads from studied species. The long reads could be downloaed from public read archive database (for instance, NCBI SRA database ) or be your own data. Then they are fragmented and aligned to scaffolds using BWA mem algorithm in BWA package. In the package, we provided a compiled bwa, so the user needn't to install bwa. LR_Gapcloser uses the alignments to find the bridging that cross the gap, and then fills the long read original sequence into the genomic gaps.</p><p>Address of the bookmark: <a href="https://github.com/CAFS-bioinformatics/LR_Gapcloser" rel="nofollow">https://github.com/CAFS-bioinformatics/LR_Gapcloser</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29263/srf-bioinformatics-at-bose-institute-india</guid>
  <pubDate>Thu, 29 Sep 2016 09:39:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF Bioinformatics at Bose Institute, India]]></title>
  <description><![CDATA[
<p>Advt. No. S/DPB(CB)/17/2016-17 <br />Junior Research Assistant/ Senior Research Assistant  Job vacancies in Bose Institute on temporary basis<br />Project Title : “Genome wide transcriptome analysis to identity MYMIV-stress related genomic resources of blackgram”<br />Junior Research Assistant <br />Qualification : Good academic record in B.Sc. and M.Sc. in Botany or Biotechnology from reputed Universities. Must have good practical hand, this should be certified by two Senior/reputed PG teachers on a scale of 10. <br />Desirable : Preference will be given to those who already have some research experience (for at least 2 months). <br />Consolidated Pay : Rs. 16,400/- p.m. <br />Age Limit : Below 28 years (relaxable in case of SC/ST/OBC/Women candidates only as per rules).<br />Senior Research Assistant <br />Qualification : B.Sc. in Biotechnology and M.Sc. in Biotechnology or Bioinformatics. Hands on training in Bioinformatics. At least two Research Publications with Bioinformatics components. <br />Desirable : Preference will be given to the candidates who have previous experience in Next Gen Sequencing data analysis of genomic/transcriptome/miRNA. <br />Consolidated Pay : Rs. 18,700/- p.m.  <br />Age Limit : Below 30 years (relaxable in case of SC/ST/OBC/Women candidates only as per rules).</p>

<p>http://www.boseinst.ernet.in/advertisement.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38735/genome-assembly-tutorial-genome-assembly-for-short-and-long-reads</guid>
	<pubDate>Sat, 19 Jan 2019 17:29:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38735/genome-assembly-tutorial-genome-assembly-for-short-and-long-reads</link>
	<title><![CDATA[Genome assembly tutorial &quot;Genome Assembly for short and long reads&quot;]]></title>
	<description><![CDATA[<p>In this lab we will perform de novo genome assembly of a bacterial genome. You will be guided through the genome assembly starting with data quality control, through to building contigs and analysis of the results. At the end of the lab you will know:</p>
<ol>
<li>How to perform basic quality checks on the input data</li>
<li>How to run a short read assembler on Illumina data</li>
<li>How to run a long read assembler on Pacific Biosciences or Oxford Nanopore data</li>
<li>How to improve the accuracy of a long read assembly using short reads</li>
<li>How to assess the quality of an assembly</li>
</ol>
<p>https://bioinformaticsdotca.github.io/high-throughput_biology_2017</p><p>Address of the bookmark: <a href="https://bioinformaticsdotca.github.io/high-throughput_biology_2017_module6_lab" rel="nofollow">https://bioinformaticsdotca.github.io/high-throughput_biology_2017_module6_lab</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29276/murasaki</guid>
	<pubDate>Fri, 30 Sep 2016 10:22:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29276/murasaki</link>
	<title><![CDATA[Murasaki]]></title>
	<description><![CDATA[<p>Murasaki is an anchor alignment program that is</p>
<ul style="margin-left: 16px;">
<li>exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes))</li>
<li>scalable (Arbitrarily parallelizable across multiple nodes using MPI)</li>
<li>memory efficient. (Even a single node with 16GB of ram can handle over 1Gbp of sequence)</li>
<li>unlimited by pattern length or selection</li>
<li>repeat tolerant</li>
</ul>
<p><img src="http://murasaki.dna.bio.keio.ac.jp/9mammals-small.png" width="500" height="375" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki" rel="nofollow">http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38801/genome-assembly-forensics-finding-the-elusive-mis-assembly</guid>
	<pubDate>Sat, 26 Jan 2019 18:02:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38801/genome-assembly-forensics-finding-the-elusive-mis-assembly</link>
	<title><![CDATA[Genome assembly forensics: finding the elusive mis-assembly]]></title>
	<description><![CDATA[<p><span>We present the first collection of tools aimed at automated genome assembly validation. This work formalizes several mechanisms for detecting mis-assemblies, and describes their implementation in our automated validation pipeline, called&nbsp;</span><em>amosvalidate</em><span>. We demonstrate the application of our pipeline in both bacterial and eukaryotic genome assemblies, and highlight several assembly errors in both draft and finished genomes. The software described is compatible with common assembly formats and is released, open-source, at&nbsp;</span><a href="http://amos.sourceforge.net/" target="_blank">http://amos.sourceforge.net</a><span>.</span></p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2397507/&nbsp;</p>
<p>http://amos.sourceforge.net/wiki/index.php/AMOS</p><p>Address of the bookmark: <a href="http://amos.sourceforge.net/wiki/index.php/AMOS" rel="nofollow">http://amos.sourceforge.net/wiki/index.php/AMOS</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</guid>
	<pubDate>Tue, 04 Oct 2016 14:50:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</link>
	<title><![CDATA[MIRO : miRNA omics]]></title>
	<description><![CDATA[<p><span>The MIRO (the miRNA omics) pipeline is a flexible and powerful tool for the analysis of miRNA (or more generall short RNA) expression using short-read deep sequencing data. In its present implementation MIRO is especially adapted for the analysis of reads generated with the Illumina sequencing platform. MIRO allows to preprocess the Solexa-reads, map them flexibly to several reference genomes using one of four different mappers, create differential gene (miRNA) expression profiles and cluster reads using one of several algorithm. MIRO output is furthermore compatible with software such as genome browsers and miRDeep.</span></p><p>Address of the bookmark: <a href="http://seq.crg.es/download/software/Miro/" rel="nofollow">http://seq.crg.es/download/software/Miro/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29410/entrez-direct-e-utilities-on-the-unix-command-line</guid>
	<pubDate>Wed, 19 Oct 2016 08:06:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29410/entrez-direct-e-utilities-on-the-unix-command-line</link>
	<title><![CDATA[Entrez Direct: E-utilities on the UNIX Command Line]]></title>
	<description><![CDATA[<p>Entrez Direct (EDirect) is an advanced method for accessing the NCBI's suite of interconnected databases (publication, sequence, structure, gene, variation, expression, etc.) from a UNIX terminal window. Functions take search terms from command-line arguments. Individual operations are combined to build multi-step queries. Record retrieval and formatting normally complete the process.</p>
<p>EDirect also provides an argument-driven function that simplifies the extraction of data from document summaries or other results that are returned in structured XML format. This can eliminate the need for writing custom software to answer ad hoc questions. Queries can move seamlessly between EDirect commands and UNIX utilities or scripts to perform actions that cannot be accomplished entirely within Entrez.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/books/NBK179288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/books/NBK179288/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</guid>
	<pubDate>Tue, 09 Jun 2020 05:21:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</link>
	<title><![CDATA[StringTie Transcript assembly and quantification for RNA-Seq]]></title>
	<description><![CDATA[<p><strong>StringTie</strong><span>&nbsp;is a fast and highly efficient assembler of RNA-Seq alignments into potential transcripts. It uses a novel network flow algorithm as well as an optional&nbsp;</span><em>de novo</em><span>&nbsp;assembly step to assemble and quantitate full-length transcripts representing multiple splice variants for each gene locus. Its input can include not only alignments of short reads that can also be used by other transcript assemblers, but also alignments of longer sequences that have been assembled from those reads. In order to identify differentially expressed genes between experiments, StringTie's output can be processed by specialized software like&nbsp;</span><a href="https://github.com/alyssafrazee/ballgown">Ballgown</a><span>,&nbsp;</span><a href="http://cole-trapnell-lab.github.io/cufflinks/cuffdiff/index.html">Cuffdiff</a><span>&nbsp;or other programs (DESeq2, edgeR, etc.).</span></p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/" rel="nofollow">https://ccb.jhu.edu/software/stringtie/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>