<?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/30550?offset=180</link>
	<atom:link href="https://bioinformaticsonline.com/related/30550?offset=180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<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/26306/busco</guid>
	<pubDate>Sun, 07 Feb 2016 16:02:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26306/busco</link>
	<title><![CDATA[BUSCO]]></title>
	<description><![CDATA[<p>Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs</p>
<p>More at http://busco.ezlab.org/</p><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26356/spines</guid>
	<pubDate>Tue, 09 Feb 2016 05:07:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26356/spines</link>
	<title><![CDATA[Spines]]></title>
	<description><![CDATA[<div id="content-header">
<h1>Spines</h1>
</div>
<div id="node-1301">
<div>
<div>
<p><a href="http://www.broadinstitute.org/ftp/distribution/software/spines/"><em>Spines</em></a> is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages: <em>Satsuma,</em> a highly parallelized program for high-sensitivity, genome-wide synteny; <em>Papaya,</em> an all-purpose alignment tool for less diverged sequences; and <em>SLAP,</em> a context-sensitive local aligner for diverged sequences with large gaps.</p>
<p>Access <em>Spines</em> <a href="http://www.broadinstitute.org/ftp/distribution/software/spines/">here</a>.</p>
</div>
</div>
</div>
<p>http://www.broadinstitute.org/science/programs/genome-biology/spines</p><p>Address of the bookmark: <a href="http://www.broadinstitute.org/science/programs/genome-biology/spines" rel="nofollow">http://www.broadinstitute.org/science/programs/genome-biology/spines</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26409/ucsc-genome-browser-and-blat-software</guid>
	<pubDate>Thu, 18 Feb 2016 03:18:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26409/ucsc-genome-browser-and-blat-software</link>
	<title><![CDATA[UCSC Genome Browser and Blat software !]]></title>
	<description><![CDATA[<p>This directory contains Genome Browser and Blat application binaries built for standalone <br>command-line use on various supported Linux and UNIX platforms. To determine which set of binaries <br>to download, type "uname -a" on the command line to display your machine type. In most cases the <br>usage statement for the application can be viewed by running the binary with no arguments. <br><br>The UCSC Genome Browser and Blat software are free for academic, nonprofit, and personal use. A <br>license is required for commercial download and installation of these binaries, with the exception <br>of items built from the following source code directories, which are freely available for all uses:<br><br>&nbsp;- kent/src/utils (includes big* tools)<br>&nbsp;- kent/src/lib<br>&nbsp;- kent/src/hg/autoSql<br>&nbsp;- kent/src/hg/autoXml<br><br>For information about commercial licensing of the Genome Browser software, see <br>http://genome.ucsc.edu/license/. The Blat and In-Silico PCR software may be commercially<br>licensed through Kent Informatics (http://www.kentinformatics.com).</p>
<p>More at http://hgdownload.cse.ucsc.edu/admin/exe/</p><p>Address of the bookmark: <a href="http://hgdownload.cse.ucsc.edu/admin/exe/" rel="nofollow">http://hgdownload.cse.ucsc.edu/admin/exe/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26573/efficient-genome-searching-with-biostrings-and-the-bsgenome-data-package</guid>
	<pubDate>Mon, 07 Mar 2016 05:18:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26573/efficient-genome-searching-with-biostrings-and-the-bsgenome-data-package</link>
	<title><![CDATA[Efficient genome searching with Biostrings and the BSgenome data package]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf" rel="nofollow">https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf</a></p>]]></description>
	<dc:creator>Aasha</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29343/accnet</guid>
	<pubDate>Fri, 07 Oct 2016 05:22:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29343/accnet</link>
	<title><![CDATA[AccNET]]></title>
	<description><![CDATA[<p><span>AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.</span></p>
<p><span>More at&nbsp;https://www.youtube.com/watch?v=vdGuy1GAJrQ</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/accnet/" rel="nofollow">https://sourceforge.net/projects/accnet/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</guid>
	<pubDate>Fri, 20 May 2016 19:08:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</link>
	<title><![CDATA[Hagfish - assess an assembly through creative use of coverage plots]]></title>
	<description><![CDATA[<p>Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of&nbsp;<em style="font-size: 12.8px;">de novo</em>&nbsp;genome assembly or identification of structural variation in a genome re-sequencing experiment.</p>
<p>Hagfish requires a reference sequence and a&nbsp;<span>paired end</span>&nbsp;re-sequencing data set. Hagfish has more power the larger the insert size of the paired end library is.</p>
<p>Quick links:&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Install">Installation</a>,<a href="https://github.com/mfiers/hagfish/wiki/Operation">Operation</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/ReadMappers">Read mappers</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Scripts">Hagfish scripts</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Plots">Hagfish plots</a></p><p>Address of the bookmark: <a href="https://github.com/mfiers/hagfish" rel="nofollow">https://github.com/mfiers/hagfish</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</guid>
	<pubDate>Fri, 26 Aug 2016 07:26:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</link>
	<title><![CDATA[Gene Finding and Predictions]]></title>
	<description><![CDATA[<p><span>In this exercise, a previously annotated gene will be used to measure the accuracy of different gene finding approaches. GRAIL, GENSCAN,&nbsp;</span><tt>geneid</tt><span>, FGENESH, GenomeScan, GrailEXP and GENEWISE will be used to annotate the sequence. Both search by signal, content and homology (protein and cDNA sequences) methods will be employed in order to improve the ab initio results. Weak conservation of Start codons will lead to wrong prediction of initial exons in most cases.</span></p>
<p>http://genome.crg.es/courses/Bioinformatics2003_genefinding/</p><p>Address of the bookmark: <a href="http://genome.crg.es/courses/Bioinformatics2003_genefinding/" rel="nofollow">http://genome.crg.es/courses/Bioinformatics2003_genefinding/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:12:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</link>
	<title><![CDATA[Assembly tutorial PPT]]></title>
	<description><![CDATA[<p>Saved Cornell University assembly workshop PPT.</p><p>Reference:&nbsp;</p><p>http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29108" length="1617402" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</guid>
	<pubDate>Fri, 09 Sep 2016 05:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</link>
	<title><![CDATA[OPERA : Optimal Paired-End Read Assembler]]></title>
	<description><![CDATA[<p>OPERA (Optimal Paired-End Read Assembler) is a sequence assembly program (<a href="http://en.wikipedia.org/wiki/Sequence_assembly">http://en.wikipedia.org/wiki/Sequence_assembly</a>). It uses information from paired-end/mate-pair/long reads to order and orient the intermediate contigs/scaffolds assembled in a genome assembly project, in a process known as Scaffolding. OPERA is based on an exact algorithm that is guaranteed to minimize the discordance of scaffolds with the information provided by the paired-end/mate-pair/long reads (for further details see Gao et al, 2011).</p>
<p>Note that since the original publication, we have made significant changes to OPERA (v1.0 onwards) including refinements to its basic algorithm (to reduce local errors, improve efficiency etc.) and incorporated features that are important for scaffolding large genomes (multi-library support, better repeat-handling etc.), in addition to other scalability and usability improvements (bam and gzip support, smaller memory footprint). We therefore encourage you to download and use our latest version: OPERA-LG. In our benchmarks, it has significantly improved corrected N50 and reduced the number of scaffolding errors. Furthermore, our latest release contains the wrapper script OPERA-long-read that enables scaffolding with long-reads from third-generation sequencing technologies (PacBio or Oxford Nanopore). The manuscript describing the new features and algorithms is available at&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y">Genome Biology</a>. We look forward to getting your feedback to improve it further.</p><p>Address of the bookmark: <a href="https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/" rel="nofollow">https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>