<?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/40208?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/40208?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37306/genome-u-plot-a-whole-genome-visualization</guid>
	<pubDate>Fri, 13 Jul 2018 19:50:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37306/genome-u-plot-a-whole-genome-visualization</link>
	<title><![CDATA[Genome U-Plot: a whole genome visualization]]></title>
	<description><![CDATA[<p><span>Genome U-Plot for producing clear and intuitive graphs that allows researchers to generate novel insights and hypotheses by visualizing SVs such as deletions, amplifications, and chromoanagenesis events. The main features of the Genome U-Plot are its layered layout, its high spatial resolution and its improved aesthetic qualities.&nbsp;</span></p>
<p><span>https://github.com/gaitat/GenomeUPlot</span></p><p>Address of the bookmark: <a href="https://github.com/gaitat/GenomeUPlot" rel="nofollow">https://github.com/gaitat/GenomeUPlot</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26499/katju-lab</guid>
  <pubDate>Fri, 26 Feb 2016 03:25:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Katju Lab]]></title>
  <description><![CDATA[
<p>TheLab seek to understand the genetic factors contributing to genomic variation and phenotypic diversity.  To this end, we employ molecular and bioinformatic tools to study evolutionary processes at the level of populations, both experimental and natural, and genomes.  Our research interests encompass a wide range of topics, including the evolution of organellar and nuclear genomes, gene duplication and the origin of novel function, and the fitness and phenotypic consequences of mutation in evolution. For details regards ongoing projects, please see the Research page.</p>

<p>http://katjulab.com/research.html</p>
]]></description>
</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/27967/linux-command-line-exercises-for-ngs-data-processing</guid>
	<pubDate>Wed, 22 Jun 2016 07:59:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27967/linux-command-line-exercises-for-ngs-data-processing</link>
	<title><![CDATA[Linux command line exercises for NGS data processing]]></title>
	<description><![CDATA[<p>The purpose of this tutorial is to introduce students to the frequently used tools for NGS analysis as well as giving experience in writing one-liners. Copy the required files to your current directory, change directory (<code>cd</code>) to the <code>linuxTutorial</code> folder, and do all the processing inside:</p>
<pre><span>[uzi@quince-srv2 ~/]$</span> cp -r /home/opt/MScBioinformatics/linuxTutorial .
<span>[uzi@quince-srv2 ~/]$</span> cd linuxTutorial
<span>[uzi@quince-srv2 ~/linuxTutorial]$</span>
</pre>
<p>I have deliberately chosen <code>Awk</code> in the exercises as it is a language in itself and is used more often to manipulate NGS data as compared to the other command line tools such as <code>grep</code>, <code>sed</code>, <code>perl</code> etc. Furthermore, having a command on <code>awk</code> will make it easier to understand advanced tutorials such as <a href="http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/Illumina_workflow.html">Illumina Amplicons Processing Workflow</a>. <br><br> In <code>Linux</code>, we use a shell that is a program that takes your commands from the keyboard and gives them to the operating system. Most Linux systems utilize Bourne Again SHell (<code>bash</code>), but there are several additional shell programs on a typical Linux system such as <code>ksh</code>, <code>tcsh</code>, and <code>zsh</code>. To see which shell you are using, type</p>
<pre><span>[uzi@quince-srv2 ~/linuxTutorial]$</span> echo $SHELL

<span>/bin/bash
</span></pre><p>Address of the bookmark: <a href="http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/linux.html" rel="nofollow">http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/linux.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</guid>
	<pubDate>Tue, 06 Sep 2016 03:58:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</link>
	<title><![CDATA[Genome STRiP]]></title>
	<description><![CDATA[<p><strong>Genome STRiP</strong><span>&nbsp;(Genome STRucture In Populations) is a suite of tools for discovering and genotyping structural variations using sequencing data. The methods are designed to detect shared variation using data from multiple individuals.</span><br><br><span>Genome STRiP looks both across and within a set of sequenced genomes to detect variation. The methods are adaptive and support heterogeneous data sets, including variations in sequencing depth, read lengths and mixtures of paired and single-end reads. A minimum of 20 to 30 genomes are required to get acceptable results, but the method gains power across genomes and processing more genomes provide better results.</span><br><br><span>To run discovery or genotyping on a single sequenced genome or a small set of genomes, you need to call your data against a background population, such as a set of genomes from the 1000 Genomes Project.&nbsp; The background population does not need to be matched to the target individuals.</span></p><p>Address of the bookmark: <a href="http://software.broadinstitute.org/software/genomestrip/" rel="nofollow">http://software.broadinstitute.org/software/genomestrip/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</guid>
	<pubDate>Thu, 18 Aug 2016 09:57:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</link>
	<title><![CDATA[RepeatModeler]]></title>
	<description><![CDATA[<p><span>RepeatModeler is a de-novo repeat family identification and modeling package. At the heart of RepeatModeler are two de-novo repeat finding programs ( RECON and RepeatScout ) which employ complementary computational methods for identifying repeat element boundaries and family relationships from sequence data. RepeatModeler assists in automating the runs of RECON and RepeatScout given a genomic database and uses the output to build, refine and classify consensus models of putative interspersed repeats.</span></p><p>Address of the bookmark: <a href="http://www.repeatmasker.org/RepeatModeler.html" rel="nofollow">http://www.repeatmasker.org/RepeatModeler.html</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/29123/artemis-comparison-tool-act</guid>
	<pubDate>Wed, 07 Sep 2016 03:54:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</link>
	<title><![CDATA[Artemis Comparison Tool (ACT)]]></title>
	<description><![CDATA[<p><span>ACT is a Java application for displaying pairwise comparisons between two or more DNA sequences. It can be used to identify and analyse regions of similarity and difference between genomes and to explore conservation of synteny, in the context of the entire sequences and their annotation.&nbsp;It can read complete EMBL,&nbsp;GENBANK and GFF entries or sequences in FASTA or raw format.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act" rel="nofollow">http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</guid>
	<pubDate>Mon, 05 Sep 2016 09:50:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</link>
	<title><![CDATA[NGS Tutorial]]></title>
	<description><![CDATA[<p><span>These tutorials are written for hundreds of bioinformaticians trying to cope with large volume of next-generation sequencing (NGS) data. NGS technologies brought a dramatic shift in the world of sequencing. Merely five years back, genome sequencing of higher eukaryotes used to be very expensive endeavor. To get a genome of interest sequenced, hundreds of scientists had to raise funds together by writing a joint white-paper and petitioning to various government agencies. The tasks of sequencing and assembly were handled by dedicated sequencing facilities, of which only a few existed around the globe. Naturally, the capacities at those sequencing facilities were significantly constrained from high volume of requests</span></p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/index.php" rel="nofollow">http://www.homolog.us/Tutorials/index.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>