<?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/19087?offset=1340</link>
	<atom:link href="https://bioinformaticsonline.com/related/19087?offset=1340" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/41496/new-machine-learning-packages-in-r</guid>
	<pubDate>Fri, 27 Mar 2020 12:11:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/41496/new-machine-learning-packages-in-r</link>
	<title><![CDATA[New Machine Learning Packages in R]]></title>
	<description><![CDATA[<h3 id="machine-learning">Machine Learning</h3><p><a href="https://cran.r-project.org/package=autokeras">autokeras</a>&nbsp;v1.0.1: Implements an interface to&nbsp;<a href="https://autokeras.com/">AutoKeras</a>, an open source software library for automated machine learning. See&nbsp;<a href="https://cran.r-project.org/web/packages/autokeras/readme/README.html">README</a>&nbsp;for an example.</p><p><a href="https://cran.r-project.org/package=MTPS">MTPS</a>&nbsp;v0.1.9: Implements functions to predict simultaneous multiple outcomes based on revised stacking algorithms as described in&nbsp;<a href="denied:doi:10.1093/bioinformatics/btz531">Xing et al. (2019)</a>. See the&nbsp;<a href="https://cran.r-project.org/web/packages/MTPS/vignettes/Guide.html">vignette</a>&nbsp;to get started.</p><p><a href="https://cran.r-project.org/package=quanteda.textmodels">quanteda.textmodels</a>&nbsp;v0.9.1: Implements methods for scaling models and classifiers based on sparse matrix objects representing textual data. It includes implementations of the&nbsp;<a href="denied:doi:10.1017/S0003055403000698">Laver et al. (2003)</a>&nbsp;wordscores model, the&nbsp;<a href="denied:arxiv:1710.08963">Perry &amp; Benoit&rsquo;s (2017)</a>&nbsp;class affinity scaling model, and the&nbsp;<a href="denied:doi:10.1111/j.1540-5907.2008.00338.x">Slapin &amp; Proksch (2008)</a>&nbsp;wordfish model. See the&nbsp;<a href="https://cran.r-project.org/web/packages/quanteda.textmodels/vignettes/textmodel_performance.html">vignette</a>&nbsp;to get started.</p><p><a href="https://cran.r-project.org/package=SeqDetect">SeqDetect</a>&nbsp;v1.0.7: Implements the automaton model found in&nbsp;<a href="https://ieeexplore.ieee.org/document/8910574">Krleža, Vrdoljak &amp; Brčić (2019)</a>&nbsp;to detect and process sequences. See the&nbsp;<a href="https://cran.r-project.org/web/packages/SeqDetect/vignettes/SequentialDetector.pdf">vignette</a>&nbsp;for examples and theory.</p><p><a href="https://cran.r-project.org/package=studyStrap">studyStrap</a>&nbsp;v1.0.0: Implements multi-Study Learning algorithms such as Merging, Study-Specific Ensembling (Trained-on-Observed-Studies Ensemble), the Study Strap, and the Covariate-Matched Study Strap. and offers over 20 similarity measures. See&nbsp;<a href="denied:doi:10.1101/856385">Kishida, et al. (2019)</a>&nbsp;for background and the&nbsp;<a href="https://cran.r-project.org/web/packages/studyStrap/vignettes/vignette.html">vignette</a>&nbsp;for how to use the package.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</guid>
	<pubDate>Fri, 01 Apr 2022 19:05:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</link>
	<title><![CDATA[R Shiny in Life Sciences – Top 7 Dashboard Examples]]></title>
	<description><![CDATA[<p><span>&nbsp;R Shiny is one of the easiest ways for developers to make production-ready dashboards when speed and functionality are crucial. Shiny is approachable with a lot of documentation available, and because of this, a lot of developers/researchers with non-coding backgrounds are able to produce some impressive results. The whole ecosystem is easy to get your head around and pretty much limitless with regard to what you can do.</span></p><p>Address of the bookmark: <a href="https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/" rel="nofollow">https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</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/42204/g-nest-the-gene-neighborhood-scoring-tool</guid>
	<pubDate>Fri, 25 Sep 2020 20:09:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42204/g-nest-the-gene-neighborhood-scoring-tool</link>
	<title><![CDATA[G-NEST: The Gene NEighborhood Scoring Tool]]></title>
	<description><![CDATA[<p><span>The Gene NEighborhood Scoring Tool (G-NEST) combines genomic location, gene expression, and evolutionary sequence conservation data to score putative gene neighborhoods across all window sizes. Primary author of final code = William F. Martin. Example data files are in the separate repository.</span></p><p>Address of the bookmark: <a href="https://github.com/dglemay/G-NEST" rel="nofollow">https://github.com/dglemay/G-NEST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</guid>
	<pubDate>Tue, 16 Mar 2021 05:41:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</link>
	<title><![CDATA[DAVI: Deep learning-based tool for alignment and single nucleotide variant identification]]></title>
	<description><![CDATA[<p>DAVI consists of models for both global and local alignment and for variant calling. We have evaluated the performance of DAVI against existing state-of-the-art tool sets and found that its accuracy and performance is comparable to existing tools used for bench-marking. We further demonstrate that while existing tools are based on data generated from a specific sequencing technology, the models proposed in DAVI are generic and can be used across different NGS technologies as well as across different species</p>
<p>https://iopscience.iop.org/article/10.1088/2632-2153/ab7e19/pdf</p><p>Address of the bookmark: <a href="https://github.com/gguptaiitd/NEAT" rel="nofollow">https://github.com/gguptaiitd/NEAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33866/perlbrew-admin-free-perl-installation-management-tool</guid>
	<pubDate>Wed, 12 Jul 2017 03:53:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33866/perlbrew-admin-free-perl-installation-management-tool</link>
	<title><![CDATA[Perlbrew: admin-free perl installation management tool.]]></title>
	<description><![CDATA[<p>perlbrew is an admin-free perl installation management tool. The latest version is 0.79, read the release note:&nbsp;<a href="https://perlbrew.pl/Release-0.79.html">Release 0.79</a>.&nbsp;</p>
<p>Copy &amp; Paste this line into your terminal:</p>
<pre><code>\curl -L https://install.perlbrew.pl | bash
</code></pre>
<p>Or, if your system does not have curl but something else:</p>
<pre><code># Linux
\wget -O - https://install.perlbrew.pl | bash

# FreeBSD
\fetch -o- https://install.perlbrew.pl | sh
</code></pre>
<p>If you prefer to install with cpan, there are two steps:</p>
<pre><code>sudo cpan App::perlbrew
perlbrew init
</code></pre>
<p>If it is installed with cpan, the perlbrew executable should be installed as&nbsp;<code>/usr/bin/perlbrew</code>&nbsp;or&nbsp;<code>/usr/local/bin/perlbrew</code>. For all users who want to use perlbrew, a prior&nbsp;<code>perlbrew init</code>&nbsp;needs to be executed.</p>
<p>The default perlbrew root directory is&nbsp;<code>~/perl5/perlbrew</code>, which can be changed by setting&nbsp;<code>PERLBREW_ROOT</code>environment variable before the installation and initialization. For more advanced installation process, please read&nbsp;<a href="http://metacpan.org/module/App::perlbrew">the perlbrew document</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://perlbrew.pl/" rel="nofollow">https://perlbrew.pl/</a></p>]]></description>
	<dc:creator>Jit</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/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>