<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34515/metasim-a-sequencing-simulator-for-genomics-and-metagenomics</guid>
	<pubDate>Mon, 04 Dec 2017 07:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34515/metasim-a-sequencing-simulator-for-genomics-and-metagenomics</link>
	<title><![CDATA[MetaSim A Sequencing Simulator for Genomics and Metagenomics.]]></title>
	<description><![CDATA[<p><span>Our software can be used to&nbsp;</span><strong>generate collections of synthetic reads</strong><span>&nbsp;that reflect the diverse taxonomical composition of typical metagenome data sets. Based on a database of given genomes, the program allows the user to&nbsp;</span><strong>design a metagenome</strong><span>&nbsp;by specifying the number of genomes present at different levels of the NCBI taxonomy, and then to collect reads from the metagenome using a&nbsp;</span><strong>simulation of a number of different sequencing technologies</strong><span>. A population sampler optionally produces evolved sequences based on source genomes and a given evolutionary tree.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ab.inf.uni-tuebingen.de/software/metasim/" rel="nofollow">http://ab.inf.uni-tuebingen.de/software/metasim/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34504/minion-gc-an-r-script-to-do-some-qc-on-minion-data</guid>
	<pubDate>Sun, 03 Dec 2017 15:19:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34504/minion-gc-an-r-script-to-do-some-qc-on-minion-data</link>
	<title><![CDATA[MinION_GC: An R script to do some QC on MinION data]]></title>
	<description><![CDATA[<p><span>Other tools focus on getting data out of the fastq or fast5 files, which is slow and computationally intensive. The benefit of this approach is that it works on a single, small, .txt summary file. So it's a lot quicker than most other things out there: it takes about a minute to analyse a 4GB flowcell on my laptop.</span></p>
<p>https://github.com/roblanf/minion_qc</p><p>Address of the bookmark: <a href="https://github.com/roblanf/minion_qc" rel="nofollow">https://github.com/roblanf/minion_qc</a></p>]]></description>
	<dc:creator>Radha Agarkar</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/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34490/collinearity-scripts-to-parse-and-analyse-mcscanx-collinearity-output</guid>
	<pubDate>Wed, 29 Nov 2017 16:47:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34490/collinearity-scripts-to-parse-and-analyse-mcscanx-collinearity-output</link>
	<title><![CDATA[collinearity: scripts to parse and analyse MCScanX collinearity output]]></title>
	<description><![CDATA[<p><span>scripts to parse and analyse MCScanX collinearity output</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/collinearity" rel="nofollow">https://github.com/reubwn/collinearity</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</guid>
	<pubDate>Wed, 29 Nov 2017 16:44:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</link>
	<title><![CDATA[Scripts for the analysis of HGT in genome sequence data.]]></title>
	<description><![CDATA[<p><span>Scripts for the analysis of HGT in genome sequence data</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/hgt" rel="nofollow">https://github.com/reubwn/hgt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34485/phyloxml-xml-for-evolutionary-biology-and-comparative-genomics</guid>
	<pubDate>Wed, 29 Nov 2017 10:04:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34485/phyloxml-xml-for-evolutionary-biology-and-comparative-genomics</link>
	<title><![CDATA[phyloXML:  XML for evolutionary biology and comparative genomics]]></title>
	<description><![CDATA[<p><a href="http://www.biomedcentral.com/1471-2105/10/356/">phyloXML</a><span>&nbsp;(</span><a href="http://www.phyloxml.org/examples_syntax/phyloxml_syntax_example_1.html">example</a><span>) is an&nbsp;</span><a href="http://en.wikipedia.org/wiki/XML">XML</a><span>&nbsp;language designed to describe phylogenetic trees (or networks) and associated data. PhyloXML provides elements for commonly used features, such as taxonomic information, gene names and identifiers, branch lengths, support values, and gene duplication and speciation events. Using these standardized elements allows interoperability between various applications and databases. Furthermore, both due to extensible nature of XML itself and the provision of &lt;property&gt; elements by phyloXML, extensibility as well as domain specific applications are ensured. The structure of phyloXML is described by&nbsp;</span><a href="http://en.wikipedia.org/wiki/XML_Schema_%28W3C%29">XML Schema Definition (XSD)</a><span>&nbsp;language.</span></p><p>Address of the bookmark: <a href="http://www.phyloxml.org/" rel="nofollow">http://www.phyloxml.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</guid>
	<pubDate>Wed, 29 Nov 2017 07:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</link>
	<title><![CDATA[Ribbon: Visualizing complex genome alignments and structural variation:]]></title>
	<description><![CDATA[<p>Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.</p>
<p>Local installation:</p>
<p>You can install Ribbon locally from Github by following the instructions here:&nbsp;<a href="https://github.com/MariaNattestad/ribbon" target="_blank">https://github.com/MariaNattestad/Ribbon</a></p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures</guid>
	<pubDate>Wed, 29 Nov 2017 05:39:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures</link>
	<title><![CDATA[Bioinformatics lectures !]]></title>
	<description><![CDATA[<div>
<div>
<div>Computational Biology is a&nbsp;<em style="font-size: 12.8px; font-weight: normal;">huge</em>&nbsp;field of study, that touches upon many distinct algorithmic and biological areas of study. What we are able to cover in this course will depend, in part, on the pace at which we move, which I will attempt to adjust as appropriate. However, here is a tentative list of topics I hope to cover this semester (not necessarily in order).
<ul>
<li>Optimal sequence alignment (global, local, and glocal alignment &amp;mdash with constant &amp; affine gap penalties</li>
<li>Algorithms and data structures for efficient text indexing and&nbsp;<em>exact</em>&nbsp;search</li>
<li>Heuristics for read&nbsp;<em>alignment</em>&nbsp;and&nbsp;<em>mapping</em>&nbsp;&amp;mdash mapping DNA-seq and RNA-seq reads</li>
<li>Genome assembly &amp;mdash k-mers, De Brujin graph construction and representation, long-read technology and read-overlap graph assembly</li>
<li>Motif finding via Gibbs sampling</li>
<li>Gene finding &amp;mdash statistical models for&nbsp;<em>ab initio</em>&nbsp;and evidence-guided prediction of genes</li>
<li>RNA-seq and transcriptomics &amp;mdash transcript assembly, abundance estimation and differential expression testing</li>
<li>Phylogenetics &amp;mdash The small and large phylogeny problem; parsimony, maximum likelihood and Bayesian methods</li>
</ul>
</div>
</div>
</div><p>Address of the bookmark: <a href="https://rob-p.github.io/CSE549F16/lectures/" rel="nofollow">https://rob-p.github.io/CSE549F16/lectures/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34477/computational-genomics-applied-comparative-genomics</guid>
	<pubDate>Wed, 29 Nov 2017 05:11:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34477/computational-genomics-applied-comparative-genomics</link>
	<title><![CDATA[Computational Genomics: Applied Comparative Genomics]]></title>
	<description><![CDATA[<p><span>The primary goal of the course is for students to be grounded in theory and leave the course empowered to conduct independent genomic analyses.</span><span>&nbsp;We will study the leading computational and quantitative approaches for comparing and analyzing genomes starting from raw sequencing data. The course will focus on human genomics and human medical applications, but the techniques will be broadly applicable across the tree of life. The topics will include genome assembly &amp; comparative genomics, variant identification &amp; analysis, gene expression &amp; regulation, personal genome analysis, and cancer genomics. The grading will be based on assignments, a midterm exam, class presentations, and a significant class project. There are no formal course prerequisites, although the course will require familiarity with UNIX scripting and/or programming to complete the assignments and course project.</span></p><p>Address of the bookmark: <a href="https://github.com/schatzlab/appliedgenomics" rel="nofollow">https://github.com/schatzlab/appliedgenomics</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>