<?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/40099?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/40099?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</guid>
	<pubDate>Tue, 26 Dec 2017 21:14:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</link>
	<title><![CDATA[PASA: Gene Structure Annotation and Analysis]]></title>
	<description><![CDATA[<p><span>PASA, acronym for Program to Assemble Spliced Alignments, is a eukaryotic genome annotation tool that exploits spliced alignments of expressed transcript sequences to automatically model gene structures, and to maintain gene structure annotation consistent with the most recently available experimental sequence data. PASA also identifies and classifies all splicing variations supported by the transcript alignments.</span></p><p>Address of the bookmark: <a href="http://pasapipeline.github.io/" rel="nofollow">http://pasapipeline.github.io/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36730/bprna-large-scale-automated-annotation-and-analysis-of-rna-secondary-structure</guid>
	<pubDate>Wed, 23 May 2018 03:24:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36730/bprna-large-scale-automated-annotation-and-analysis-of-rna-secondary-structure</link>
	<title><![CDATA[bpRNA: large-scale automated annotation and analysis of RNA secondary structure]]></title>
	<description><![CDATA[<p>bpRNA, a novel annotation tool capable of parsing RNA structures, including complex pseudoknot-containing RNAs, to yield an objective, precise, compact, unambiguous, easily-interpretable description of all loops, stems, and pseudoknots, along with the positions, sequence, and flanking base pairs of each such structural feature.</p>
<p>The bpRNA code is written in perl and requires the Graph perl module. Several additional scripts for analysis are included. The source code is available at http://github.com/hendrixlab/bpRNA.</p><p>Address of the bookmark: <a href="http://github.com/hendrixlab/bpRNA" rel="nofollow">http://github.com/hendrixlab/bpRNA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42405/caretta-%E2%80%93-a-multiple-protein-structure-alignment-and-feature-extraction-suite</guid>
	<pubDate>Fri, 18 Dec 2020 02:09:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42405/caretta-%E2%80%93-a-multiple-protein-structure-alignment-and-feature-extraction-suite</link>
	<title><![CDATA[Caretta – A multiple protein structure alignment and feature extraction suite]]></title>
	<description><![CDATA[<h3>Caretta &ndash;&nbsp;a multiple protein structure alignment and feature extraction suite</h3>
<p><span>Caretta, a multiple structure alignment suite meant for homologous but sequentially divergent protein families which consistently returns accurate alignments with a higher coverage than current state-of-the-art tools. Caretta is available as a GUI and command-line application and additionally outputs an aligned structure feature matrix for a given set of input structures, which can readily be used in downstream steps for supervised or unsupervised machine learning.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.bioinformatics.nl/caretta/" rel="nofollow">http://www.bioinformatics.nl/caretta/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</guid>
	<pubDate>Wed, 27 Dec 2017 20:36:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</link>
	<title><![CDATA[Ra assembler - a de novo DNA assembler for third generation sequencing data]]></title>
	<description><![CDATA[<p>Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).</p>
<p>Ra is in development since 2014 in the form of several separate components that used to be run individually.<br>This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.</p>
<p>Unlike other state-of-the-art assemblers,&nbsp;<span>Ra does not have an error correction step.</span>&nbsp;Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler",&nbsp;<a href="https://github.com/isovic/graphmap">https://github.com/isovic/graphmap</a>) and constructing and reducing an overlap graph (Ra layout,&nbsp;<a href="https://github.com/mariokostelac/ra">https://github.com/mariokostelac/ra</a>).</p><p>Address of the bookmark: <a href="https://github.com/mariokostelac/ra-integrate/" rel="nofollow">https://github.com/mariokostelac/ra-integrate/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</guid>
	<pubDate>Wed, 20 Jun 2018 02:45:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</link>
	<title><![CDATA[SWALO: Scaffolding with assembly likelihood optimization]]></title>
	<description><![CDATA[SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.

Please email your questions, comments, suggestions, and bug reports to atif.bd@gmail.com.<p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</guid>
	<pubDate>Fri, 20 Jul 2018 10:03:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</link>
	<title><![CDATA[Converting a VCF into a FASTA given some reference !]]></title>
	<description><![CDATA[<p>Samtools/BCFtools (Heng Li) provides a Perl script&nbsp;<a href="https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl"><code>vcfutils.pl</code></a>&nbsp;which does this, the function&nbsp;<code>vcf2fq</code>&nbsp;(lines 469-528)</p><p>This script has been modified by others to convert InDels as well, e.g.&nbsp;<a href="https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl">this</a>&nbsp;by David Eccles</p><pre><code><span>./</span><span>vcf2fq</span><span>.</span><span>pl </span><span>-</span><span>f </span><span>&lt;</span><span>input</span><span>.</span><span>fasta</span><span>&gt;</span><span> </span><span>&lt;</span><span>all</span><span>-</span><span>site</span><span>.</span><span>vcf</span><span>&gt;</span><span> </span><span>&gt;</span><span> </span><span>&lt;</span><span>output</span><span>.</span><span>fastq</span><span>&gt;</span></code></pre><p>https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl</p><p>https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>