<?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=570</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=570" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</guid>
	<pubDate>Sun, 09 Dec 2018 19:06:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</link>
	<title><![CDATA[DECIPHER; a software toolset for deciphering and managing biological sequences efficiently using the R]]></title>
	<description><![CDATA[<p><span>DECIPHER is a software toolset that can be used for deciphering and managing biological sequences efficiently using the&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;programming language. The&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;package is distributed as platform independent source code under the&nbsp;</span><a href="http://www.gnu.org/copyleft/gpl.html">GPL version 3 license</a><span>. Some functionality of the program is accessible online through web tools.</span></p>
<p><span style="font-size: medium; text-align: justify;">&nbsp;</span></p><p>Address of the bookmark: <a href="http://www2.decipher.codes/" rel="nofollow">http://www2.decipher.codes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38381/repeatmasker-compatible-blast-tool</guid>
	<pubDate>Fri, 07 Dec 2018 08:13:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38381/repeatmasker-compatible-blast-tool</link>
	<title><![CDATA[RepeatMasker compatible blast tool]]></title>
	<description><![CDATA[<p><span>RMBlast is a RepeatMasker compatible version of the standard NCBI blastn program. The primary difference between this distribution and the NCBI distribution is the addition of a new program "rmblastn" for use with RepeatMasker and RepeatModeler.</span></p>
<p>RMBlast supports RepeatMasker searches by adding a few necessary features to the stock NCBI blastn program. These include:</p>
<ul>
<li>Support for custom matrices ( without KA-Statistics ).</li>
<li>Support for cross_match-like complexity adjusted scoring. Cross_match is Phil Green's seeded smith-waterman search algorithm.</li>
<li>Support for cross_match-like masklevel filtering.</li>
</ul>
<p>https://anaconda.org/bioconda/rmblast</p><p>Address of the bookmark: <a href="http://www.repeatmasker.org/RMBlast.html" rel="nofollow">http://www.repeatmasker.org/RMBlast.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38378/gwaspro-a-high-performance-genome-wide-association-analysis-server</guid>
	<pubDate>Fri, 07 Dec 2018 08:04:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38378/gwaspro-a-high-performance-genome-wide-association-analysis-server</link>
	<title><![CDATA[GWASpro: A High-Performance Genome-Wide Association Analysis Server]]></title>
	<description><![CDATA[<p>GWASpro supports building complex design matrices, by which complex experimental designs that may include replications, treatments, locations and times, can be accounted for in the linear mixed model (LMM). GWASpro is optimized to handle GWAS data that may consist of up to 10 million markers and 10,000 samples from replicable lines or hybrids. GWASpro provides an interface that significantly reduces the learning curve for new GWAS investigators.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://bioinfo.noble.org/GWASPRO/" rel="nofollow">https://bioinfo.noble.org/GWASPRO/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38316/simba-a-genome-assembly-project-management-system</guid>
	<pubDate>Thu, 29 Nov 2018 08:52:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38316/simba-a-genome-assembly-project-management-system</link>
	<title><![CDATA[SIMBA: a Genome Assembly Project Management System]]></title>
	<description><![CDATA[<p><span>SIMBA</span><span>, SImple Manager for Bacterial Assemblies, is a Web interface for managing assembly projects of bacterial genomes. SIMBA was created to assist bioinformaticians to assemble bacterial genomes sequenced with NextGeneration Sequencing (NGS) platforms quickly, easily and effectively. SIMBA also is open source tool, i.e., can be freely downloaded, shared and modified.</span></p><p>Address of the bookmark: <a href="http://ufmg-simba.sourceforge.net/" rel="nofollow">http://ufmg-simba.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38310/sisrs-site-identification-from-short-read-sequences</guid>
	<pubDate>Wed, 28 Nov 2018 08:56:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38310/sisrs-site-identification-from-short-read-sequences</link>
	<title><![CDATA[SISRS: Site Identification from Short Read Sequences]]></title>
	<description><![CDATA[<p>Next-gen sequence data such as Illumina HiSeq reads. Data must be sorted into folders by taxon (e.g. species or genus). Paired reads in fastq format must be specified by _R1 and _R2 in the (otherwise identical) filenames. Paired and unpaired reads must have a fastq file extension.</p><p>Address of the bookmark: <a href="https://github.com/rachelss/SISRS" rel="nofollow">https://github.com/rachelss/SISRS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</guid>
	<pubDate>Tue, 27 Nov 2018 04:43:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</link>
	<title><![CDATA[lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data]]></title>
	<description><![CDATA[<p><span>lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.</span></p>
<p>lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/lordfast" rel="nofollow">https://github.com/vpc-ccg/lordfast</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Tue, 27 Nov 2018 03:38:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;sequencing reads. It does this with a deep&nbsp;<a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a>&nbsp;classifier, using many of the&nbsp;<a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a>&nbsp;that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p>
<ul>
<li><span>Reasons to use Deepbinner</span>:
<ul>
<li>To minimise the number of unclassified reads (use Deepbinner by itself).</li>
<li>To minimise the number of misclassified reads (use Deepbinner in conjunction with Albacore demultiplexing).</li>
<li>You plan on running signal-level downstream analyses, like&nbsp;<a href="https://github.com/jts/nanopolish">Nanopolish</a>. Deepbinner can&nbsp;<a href="https://github.com/rrwick/Deepbinner#using-deepbinner-before-basecalling">demultiplex the fast5 files</a>which makes this easier.</li>
</ul>
</li>
<li><span>Reasons to&nbsp;<em>not</em>&nbsp;use Deepbinner</span>:
<ul>
<li>You only have basecalled reads not the raw fast5 files (which Deepbinner requires).</li>
<li>You have a small/slow computer. Deepbinner is more computationally intensive than&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>.</li>
<li>You used a sequencing/barcoding kit other than&nbsp;<a href="https://github.com/rrwick/Deepbinner/blob/master/models">the ones Deepbinner was trained on</a>.</li>
</ul>
</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38233/kubeflow-an-open-community-driven-project-to-make-it-easy-to-deploy-and-manage-an-ml-stack-on-kubernetes</guid>
	<pubDate>Fri, 16 Nov 2018 15:05:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38233/kubeflow-an-open-community-driven-project-to-make-it-easy-to-deploy-and-manage-an-ml-stack-on-kubernetes</link>
	<title><![CDATA[Kubeflow: an open, community driven project to make it easy to deploy and manage an ML stack on Kubernetes]]></title>
	<description><![CDATA[<p><span>The Kubeflow project is dedicated to making deployments of machine learning (ML) workflows on Kubernetes simple, portable and scalable. Our goal is not to recreate other services, but to provide a straightforward way to deploy best-of-breed open-source systems for ML to diverse infrastructures. Anywhere you are running Kubernetes, you should be able to run Kubeflow.</span></p><p>Address of the bookmark: <a href="https://www.kubeflow.org/" rel="nofollow">https://www.kubeflow.org/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</guid>
	<pubDate>Thu, 15 Nov 2018 12:48:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</link>
	<title><![CDATA[NovoGraph: building whole genome graphs from long-read-based de novo assemblies]]></title>
	<description><![CDATA[<p><span>NovoGraph: building whole genome graphs from long-read-based de novo assemblies</span></p>
<p><span><span>An algorithmically novel approach to construct a genome graph representation of long-read-based&nbsp;</span><em>de novo</em><span>&nbsp;sequence assemblies. We then provide a proof of principle by creating a genome graph of seven ethnically-diverse human genomes.</span></span></p>
<p>&nbsp;</p>
<p>https://f1000research.com/articles/7-1391/v1</p><p>Address of the bookmark: <a href="https://github.com/NCBI-Hackathons/NovoGraph" rel="nofollow">https://github.com/NCBI-Hackathons/NovoGraph</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38215/pwhatshap-a-parallel-high-performance-version-of-whatshap</guid>
	<pubDate>Wed, 14 Nov 2018 08:20:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38215/pwhatshap-a-parallel-high-performance-version-of-whatshap</link>
	<title><![CDATA[pWhatsHap: a parallel, high-performance version of WhatsHap]]></title>
	<description><![CDATA[<div id="ASec4">
<p>Given the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineered&nbsp;pWhatsHap, a parallel, high-performance version of&nbsp;WhatsHap.&nbsp;pWhatsHap&nbsp;is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on&nbsp;WhatsHap,&nbsp;pWhatsHap&nbsp;exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-core architectures allows for a relevant reduction of the execution time for haplotyping, while the provided results enjoy the same high accuracy as that provided by&nbsp;WhatsHap, which increases with coverage.</p>
</div>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1170-y</p><p>Address of the bookmark: <a href="https://bitbucket.org/whatshap/whatshap" rel="nofollow">https://bitbucket.org/whatshap/whatshap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>