<?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/39190?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/39190?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42280/urmap-an-ultra-fast-read-mapper</guid>
	<pubDate>Thu, 29 Oct 2020 23:03:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42280/urmap-an-ultra-fast-read-mapper</link>
	<title><![CDATA[URMAP, an ultra-fast read mapper]]></title>
	<description><![CDATA[<p><span>URMAP, a new read mapping algorithm. URMAP is an order of magnitude faster than BWA with comparable accuracy on several validation tests. On a Genome in a Bottle (GIAB) variant calling test with 30&times; coverage 2&times;150 reads, URMAP achieves high accuracy (precision 0.998, sensitivity 0.982 and F-measure 0.990) with the strelka2 caller. However, GIAB reference variants are shown to be biased against repetitive regions which are difficult to map and may therefore pose an unrealistically easy challenge to read mappers and variant callers.</span></p>
<p><span>More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7320720/</span></p><p>Address of the bookmark: <a href="https://github.com/rcedgar/urmap" rel="nofollow">https://github.com/rcedgar/urmap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/23582/integrative-rna-and-chip-seq-analysis-of-regulatory-t-cells</guid>
	<pubDate>Tue, 04 Aug 2015 05:03:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/23582/integrative-rna-and-chip-seq-analysis-of-regulatory-t-cells</link>
	<title><![CDATA[Integrative RNA and ChIP-Seq analysis of regulatory T-cells]]></title>
	<description><![CDATA[<p><a href="http://www.strand-ngs.com/learn/white-papers#rna-chip" target="_blank" title="strand ngs white paper">Integrative RNA and ChIP-Seq analysis of regulatory T-cells&nbsp;</a><span>, a Strand NGS application note describes how integrated multi-omics functionality in Strand NGS was used to find the regulatory role of FoxP3 in T-regulatory and T-helper cells. Learn how the gene expression profiles from RNA-Seq and FoxP3 DNA-protein binding sites from ChIP-Seq are integrated. For mor information,&nbsp;</span><a href="http://www.strand-ngs.com/contact/sales" target="_blank" title="strand ngs contact">please write to us</a></p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36616/srbreak-a-read-depth-and-split-read-framework-to-identify-breakpoints-of-different-events-inside-simple-copy-number-variable-regions</guid>
	<pubDate>Tue, 15 May 2018 04:42:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36616/srbreak-a-read-depth-and-split-read-framework-to-identify-breakpoints-of-different-events-inside-simple-copy-number-variable-regions</link>
	<title><![CDATA[SRBreak: A Read-Depth and Split-Read Framework to Identify Breakpoints of Different Events Inside Simple Copy-Number Variable Regions]]></title>
	<description><![CDATA[SRBreak is a read-depth and split-read package written in R for identifying copy-number variants in next-generation sequencing datasets.

Note: SBReak was designed to work for multiple samples. It can work for &gt;= 2 samples, but we suggest that users should use &gt;= 5 samples as in the work tested in our paper.<p>Address of the bookmark: <a href="https://github.com/hoangtn/SRBreak" rel="nofollow">https://github.com/hoangtn/SRBreak</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35148/mojolicious-a-next-generation-web-framework-for-the-perl-programming-language</guid>
	<pubDate>Fri, 12 Jan 2018 16:48:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35148/mojolicious-a-next-generation-web-framework-for-the-perl-programming-language</link>
	<title><![CDATA[mojolicious: a next generation web framework for the Perl programming language.]]></title>
	<description><![CDATA[<p><span>Back in the early days of the web, many people learned Perl because of a wonderful Perl library called&nbsp;</span><a href="https://metacpan.org/module/CGI" target="_blank">CGI</a><span>. It was simple enough to get started without knowing much about the language and powerful enough to keep you going, learning by doing was much fun. While most of the techniques used are outdated now, the idea behind it is not. Mojolicious is a new endeavor to implement this idea using bleeding edge technologies.</span></p>
<h2>Features</h2>
<ul>
<li>An amazing&nbsp;<strong>real-time web framework</strong>, allowing you to easily grow single file prototypes into well-structured MVC web applications.
<ul>
<li>Powerful out of the box with RESTful routes, plugins, commands, Perl-ish templates, content negotiation, session management, form validation, testing framework, static file server, CGI/<a href="http://plackperl.org/" target="_blank">PSGI</a>&nbsp;detection, first class Unicode support and much more for you to discover.</li>
</ul>
</li>
<li>A powerful&nbsp;<strong>web development toolkit</strong>, that you can use for all kinds of applications, independently of the web framework.
<ul>
<li>Full stack HTTP and WebSocket client/server implementation with IPv6, TLS, SNI, IDNA, HTTP/SOCKS5 proxy, UNIX domain socket, Comet (long polling), Promises/A+, keep-alive, connection pooling, timeout, cookie, multipart and gzip compression support.</li>
<li>Built-in non-blocking I/O web server, supporting multiple event loops as well as optional pre-forking and hot deployment, perfect for building highly scalable web services.</li>
<li>JSON and HTML/XML parser with CSS selector support.</li>
</ul>
</li>
<li>Very clean, portable and object-oriented pure-Perl API with no hidden magic and no requirements besides Perl 5.24.0 (versions as old as 5.10.1 can be used too, but may require additional CPAN modules to be installed)</li>
<li>Fresh code based upon years of experience developing&nbsp;<a href="http://catalystframework.org/" target="_blank">Catalyst</a>, free and open source.</li>
<li>Hundreds of 3rd party&nbsp;<a href="https://metacpan.org/requires/distribution/Mojolicious">extensions</a>&nbsp;and high quality spin-off projects like the&nbsp;<a href="https://metacpan.org/pod/Minion">Minion</a>&nbsp;job queue.</li>
</ul>
<p>http://mojolicious.org/</p><p>Address of the bookmark: <a href="http://mojolicious.org/" rel="nofollow">http://mojolicious.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38489/biotite-a-general-framework-for-computational-biology</guid>
	<pubDate>Mon, 17 Dec 2018 18:52:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38489/biotite-a-general-framework-for-computational-biology</link>
	<title><![CDATA[Biotite: A general framework for computational biology]]></title>
	<description><![CDATA[<p><span>The package is open source and freely available at GitHub (</span><span><a href="https://github.com/biotite-dev/biotite" target="_blank">https://github.com/biotite-dev/biotite</a></span><span>). This package is simple to use especially for the beginners in programming and computationally efficient because of the implementation of Numpy and Cython.&nbsp;Biotite consists of four sub packages: sequence, structure, databases, and application. The&nbsp;</span><em>sequence</em><span>&nbsp;and&nbsp;</span><em>structure</em><span>&nbsp;modules serve for the analysis of sequence and structural data analysis respectively,&nbsp;</span><em>database</em><span>&nbsp;downloads files from the other databases such as RCSB PDB, and&nbsp;</span><em>application</em><span>&nbsp;provides interface for external software.&nbsp;</span></p>
<p><span><span>The&nbsp;</span><em>Biotite</em><span>&nbsp;package bundles popular tasks in computational biology into an unifying framework, which is easy to use on the one hand side, but is also computationally efficient due to intensive usage of&nbsp;</span><em>NumPy</em><span>&nbsp;and&nbsp;</span><em>Cython</em><span>. This package focuses on working with sequence and structure data and supports various file formats and analysis and manipulation functions.</span></span></p><p>Address of the bookmark: <a href="https://github.com/biotite-dev/biotite" rel="nofollow">https://github.com/biotite-dev/biotite</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42201/rosettaantibodydesign-rabd-a-general-framework-for-computational-antibody-design</guid>
	<pubDate>Sun, 20 Sep 2020 06:03:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42201/rosettaantibodydesign-rabd-a-general-framework-for-computational-antibody-design</link>
	<title><![CDATA[RosettaAntibodyDesign (RAbD): A general framework for computational antibody design]]></title>
	<description><![CDATA[<p><strong>RosettaAntibodyDesign (RAbD)</strong>&nbsp;is a generalized framework for the design of antibodies, in which a user can easily tailor the run to their project needs.&nbsp;<strong>The algorithm is meant to sample the diverse sequence, structure, and binding space of an antibody-antigen complex.</strong>&nbsp;It can be used for a multitude of project types, from denovo design to redesigns that improve binding affinity, optimize stability, or manipulate function.</p>
<p>The framework is based on rigorous bioinformatic analysis and rooted very much on our&nbsp;<a href="https://www.ncbi.nlm.nih.gov/pubmed/21035459">recent clustering</a>&nbsp;of antibody CDR regions. It uses the&nbsp;<strong>North/Dunbrack CDR definition</strong>&nbsp;as outlined in the North/Dunbrack clustering paper.</p>
<p>More at</p>
<p>https://www.rosettacommons.org/docs/latest/application_documentation/antibody/RosettaAntibodyDesign</p>
<p>https://bio-jade.readthedocs.io/en/latest/installation.html</p><p>Address of the bookmark: <a href="https://www.rosettacommons.org/docs/latest/application_documentation/antibody/RosettaAntibodyDesign" rel="nofollow">https://www.rosettacommons.org/docs/latest/application_documentation/antibody/RosettaAntibodyDesign</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</guid>
	<pubDate>Mon, 22 May 2017 05:43:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</link>
	<title><![CDATA[BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly]]></title>
	<description><![CDATA[<p>This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at&nbsp;<a href="mailto:kklam@eecs.berkeley.edu">kklam@eecs.berkeley.edu</a>. My name is Ka-Kit Lam.</p>
<p>https://github.com/kakitone/MetaFinisherSC</p>
<p>https://github.com/kakitone/BIGMAC</p><p>Address of the bookmark: <a href="https://github.com/kakitone/BIGMAC" rel="nofollow">https://github.com/kakitone/BIGMAC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</guid>
	<pubDate>Fri, 05 Jan 2018 04:02:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</link>
	<title><![CDATA[ECTOOLS: Long Read Correction and other Correction tools]]></title>
	<description><![CDATA[<p>Long Read Correction and other Correction tools</p>
<p>This package is a loose collection of scripts. To run the correction<br>routine see the section below. Descriptions of the other scripts<br>are at the bottom of this file.</p>
<p>Contact: gurtowsk@cshl.edu</p>
<p>In short, the correction algorithm takes as input the unitigs from a short read assembly and uses them to correct long read data. More background information for the algorithm can be found:<br>http://schatzlab.cshl.edu/presentations/2013-06-18.PBUserMeeting.pdf</p><p>Address of the bookmark: <a href="https://github.com/jgurtowski/ectools" rel="nofollow">https://github.com/jgurtowski/ectools</a></p>]]></description>
	<dc:creator>Jit</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/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</guid>
	<pubDate>Wed, 06 Apr 2016 13:27:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</link>
	<title><![CDATA[PEAR: a fast and accurate Illumina Paired-End reAd mergeR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p>
<p>More at&nbsp;http://www.exelixis-lab.org/web/software/pear</p>
<p>Paper:&nbsp;http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3933873/</p><p>Address of the bookmark: <a href="http://www.exelixis-lab.org/web/software/pear" rel="nofollow">http://www.exelixis-lab.org/web/software/pear</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>