<?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/37306?offset=420</link>
	<atom:link href="https://bioinformaticsonline.com/related/37306?offset=420" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</guid>
	<pubDate>Fri, 26 Aug 2016 06:00:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</link>
	<title><![CDATA[GeneValidator - Identify problems with predicted genes]]></title>
	<description><![CDATA[<p>GeneValidator helps in identifing problems with gene predictions and provide useful information extracted from analysing orthologs in BLAST databases. The results produced can be used by biocurators and researchers who need accurate gene predictions.</p>
<p>If you would like to use GeneValidator on a few sequences, see our online&nbsp;<a href="http://genevalidator.sbcs.qmul.ac.uk/">GeneValidator Web App</a>&nbsp;-<a href="http://genevalidator.sbcs.qmul.ac.uk/">http://genevalidator.sbcs.qmul.ac.uk</a>.</p>
<p>If you use GeneValidator in your work, please cite us as follows:</p>
<blockquote>
<p><a href="http://bioinformatics.oxfordjournals.org/content/early/2016/02/26/bioinformatics.btw015">Dragan M<span>&Dagger;</span>, Moghul MI<span>&Dagger;</span>, Priyam A, Bustos C &amp; Wurm Y. 2016. GeneValidator: identify problems with protein-coding gene predictions.&nbsp;<em>Bioinformatics</em>, doi: 10.1093/bioinformatics/btw015</a>.</p>
<p>&nbsp;</p>
</blockquote>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/wurmlab/genevalidator" rel="nofollow">https://github.com/wurmlab/genevalidator</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28937/sushi-an-rbioconductor-package-for-visualizing-genomic-data</guid>
	<pubDate>Wed, 31 Aug 2016 08:29:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28937/sushi-an-rbioconductor-package-for-visualizing-genomic-data</link>
	<title><![CDATA[Sushi: An R/Bioconductor package for visualizing genomic data]]></title>
	<description><![CDATA[<p>Sushi: An R/Bioconductor package for visualizing genomic data</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/Sushi/inst/doc/Sushi.pdf" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/Sushi/inst/doc/Sushi.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</guid>
	<pubDate>Thu, 01 Sep 2016 11:47:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</link>
	<title><![CDATA[R-chie]]></title>
	<description><![CDATA[<p><strong>R-chie</strong><span>&nbsp;allows you to make arc diagrams of RNA secondary structures, allowing for easy comparison and overlap of two structures, rank and display basepairs in colour and to also visualize corresponding multiple sequence alignments and co-variation information.</span><br><strong>R4RNA</strong><span>&nbsp;is the R package powering R-chie, available for&nbsp;</span><a href="http://www.e-rna.org/r-chie/download.cgi">download</a><span>&nbsp;and local use for more customized figures and scripting.</span></p>
<p>http://www.e-rna.org/r-chie/plot.cgi?eg=single</p><p>Address of the bookmark: <a href="http://www.e-rna.org/r-chie/plot.cgi?eg=single" rel="nofollow">http://www.e-rna.org/r-chie/plot.cgi?eg=single</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29110/structural-variants-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29110/structural-variants-ppt</link>
	<title><![CDATA[Structural variants PPT]]></title>
	<description><![CDATA[<p>1000 Genomes data tutorial at ASHG</p><p>Structural variants presentation by</p><p>Jan Korbel</p><p>European Molecular Biology Laboratory (EMBL) Heidelberg Genome Biology Research Unit</p><p>Reference:&nbsp;</p><p>https://www.genome.gov/pages/research/der/1000genomesprojecttutorials/structuralvariants-jankorbel.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29110" length="1090837" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29144/fermi</guid>
	<pubDate>Fri, 09 Sep 2016 05:37:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29144/fermi</link>
	<title><![CDATA[FERMI]]></title>
	<description><![CDATA[<p><span>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;</span><span>short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;</span><span>typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;</span><span>collapsed by other assemblers. Its ultimate goal is to find a minimal set of</span><br><span>unitigs to represent all the information in raw reads.</span><br><br><span>Fermi follows the overlap-layout-consensus paradigm and uses the FM-DNA-index&nbsp;</span><span>(FMD-index) as the key data structure. It is inspired by the string graph&nbsp;</span><span>assembler (Simpson and Durbin, 2010 and 2012) and has a similar workflow.</span><br><br><span>As a typical de novo assembler, fermi tends to produce contigs with slightly&nbsp;</span><span>longer N50. However, the major weakness of fermi is the high misassembly rate.&nbsp;</span><span>Although fermi provides a tool to fix misassemblies by using paired-end reads&nbsp;</span><span>to achieve an accuracy comparable to other assemblers, this is not a favorable&nbsp;</span><span>solution.</span><br><br><span>Fermi is designed to be used on a multi-core Linux machine with large shared&nbsp;</span><span>memory. The easiest way to run fermi is to use the run-fermi.pl script. It&nbsp;</span><span>generates a Makefile. The actual assembly is done by invoking make. Premature&nbsp;</span><span>assembly processes can be resumed. Here is an example:</span><br><br><span>run-fermi.pl -dAPe ./fermi -p NA12878 -t16 -f18 reads*.fq.gz &gt; NA12878.mak</span><br><span>make -f NA12878.mak -j16</span></p><p>Address of the bookmark: <a href="https://github.com/lh3/fermi" rel="nofollow">https://github.com/lh3/fermi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29274/strudel</guid>
	<pubDate>Fri, 30 Sep 2016 09:47:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29274/strudel</link>
	<title><![CDATA[Strudel]]></title>
	<description><![CDATA[<p>Strudel is our graphical tool for visualizing genetic and physical maps of genomes for comparative purposes. The application aims to let the user examine their data at a variety of different levels of resolution, from entire maps to individual markers, and explore syntenic relationships between genomes. All browsing and interaction with Strudel happens in real-time &ndash; there is no need to wait while the maps are generated. It is built using Java 1.6 and ships with its own JRE, so there is no need for users to install or update Java.</p><p>Address of the bookmark: <a href="https://ics.hutton.ac.uk/strudel/" rel="nofollow">https://ics.hutton.ac.uk/strudel/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31105/understanding-pacbio</guid>
	<pubDate>Fri, 24 Feb 2017 10:17:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31105/understanding-pacbio</link>
	<title><![CDATA[Understanding PacBio]]></title>
	<description><![CDATA[<p>This tutorial includes resources for learning more about PacBio data and bioinformatics analysis, and includes content suitable for both beginners and experts. Below are links to training modules (webinars and PowerPoint presentations) to help you get started with your data processing, as well as information for specialized applications.</p>
<p>Training Resources:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Bioinformatics-Workshop">Bioinformatics Workshop (Webinars)</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Bioinformatics-Training-Slides">Bioinformatics Training Slides</a></li>
</ul>
<p>Specialized Applications:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/De-Novo-Assembly">De Novo Assembly</a></li>
<li><a href="https://github.com/PacificBiosciences/cDNA_primer/wiki">Transcriptome analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Base-modification-analysis">Base Modification Analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Barcoding">Barcoding</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Data-Analysis-Tools">Data Analysis Tools</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Minor-Variants-and-Phasing-Analysis">Minor Variants and Phasing Analysis</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki" rel="nofollow">https://github.com/PacificBiosciences/Bioinformatics-Training/wiki</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</guid>
	<pubDate>Fri, 04 Nov 2016 05:02:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</link>
	<title><![CDATA[HybPiper]]></title>
	<description><![CDATA[<p>HybPiper was designed for targeted sequence capture, in which DNA sequencing libraries are enriched for gene regions of interest, especially for phylogenetics. HybPiper is a suite of Python scripts that wrap and connect bioinformatics tools in order to extract target sequences from high-throughput DNA sequencing reads.</p>
<p>Targeted bait capture is a technique for sequencing many loci simultaneously based on bait sequences. HybPiper pipeline starts with high-throughput sequencing reads (for example from Illumina MiSeq), and assigns them to target genes using BLASTx or BWA. The reads are distributed to separate directories, where they are assembled separately using SPAdes. The main output is a FASTA file of the (in frame) CDS portion of the sample for each target region, and a separate file with the translated protein sequence.</p>
<p>HybPiper also includes post-processing scripts, run after the main pipeline, to also extract the intronic regions flanking each exon, investigate putative paralogs, and calculate sequencing depth. For more information,&nbsp;<a href="https://github.com/mossmatters/HybPiper/wiki/">please see our wiki</a>.</p>
<p>HybPiper is run separately for each sample (single or paired-end sequence reads). When HybPiper generates sequence files from the reads, it does so in a standardized directory hierarchy. Many of the post-processing scripts rely on this directory hierarchy, so do not modify it after running the initial pipeline. It is a good idea to run the pipeline for each sample from the same directory. You will end up with one directory per run of HybPiper, and some of the later scripts take advantage of this predictable directory structure.</p><p>Address of the bookmark: <a href="https://github.com/mossmatters/HybPiper" rel="nofollow">https://github.com/mossmatters/HybPiper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30074/minia</guid>
	<pubDate>Thu, 08 Dec 2016 05:07:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30074/minia</link>
	<title><![CDATA[Minia]]></title>
	<description><![CDATA[<p>Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia produces results of similar contiguity and accuracy to other de Bruijn assemblers (e.g. Velvet).</p>
<h3>Download</h3>
<p><a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-bin-Linux.tar.gz">Minia 2.0.7 Linux 64-bits binaries</a>&nbsp;(<a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-Source.tar.gz">Source code</a>)&nbsp;<span>(<a href="http://minia.genouest.org/files/minia-1.6906.tar.gz">Legacy codebase</a>)</span></p>
<h3>For the impatient</h3>
<p>A typical Minia command line looks like:</p>
<pre>./minia -in <span>reads.fa</span> -kmer-size <span>31</span> -abundance-min <span>3</span> -out <span>output_prefix</span></pre>
<p>Type</p>
<pre>./minia</pre>
<p><span>for a quick explanation of the parameters.</span></p>
<p>For more information, refer to the&nbsp;<a href="http://minia.genouest.org/files/minia.pdf">manual</a>.</p>
<p><a href="http://kmergenie.bx.psu.edu/">KmerGenie</a>&nbsp;can be used to determine the best k-mer size, minimum abundance of correct k-mers, and genome size estimation for your dataset.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://minia.genouest.org/" rel="nofollow">http://minia.genouest.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30093/velvet-tutorial</guid>
	<pubDate>Fri, 09 Dec 2016 04:19:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30093/velvet-tutorial</link>
	<title><![CDATA[Velvet tutorial]]></title>
	<description><![CDATA[<p><span>The objective of this activity is to help you understand how to run&nbsp;</span><a href="http://evomics.org/resources/software/genomics-software/assembly/velvet/" title="Velvet">Velvet</a><span>&nbsp;in general, how to accurately estimate the insert size of a paired-end library through the use of&nbsp;</span><a href="http://evomics.org/resources/software/genomics-software/assembly/bowtie/" title="Bowtie">Bowtie</a><span>, the primary parameters of velvet, and the process involved in producing a&nbsp;</span><em>de novo</em><span>&nbsp;assembly from Illumina reads.</span></p>
<p>http://evomics.org/learning/assembly-and-alignment/velvet/</p><p>Address of the bookmark: <a href="http://evomics.org/learning/assembly-and-alignment/velvet/" rel="nofollow">http://evomics.org/learning/assembly-and-alignment/velvet/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>