<?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/36857?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/36857?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41107/machine-learning-in-perl</guid>
	<pubDate>Sun, 16 Feb 2020 15:32:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41107/machine-learning-in-perl</link>
	<title><![CDATA[Machine learning in Perl]]></title>
	<description><![CDATA[<p>this is a fourth blog post in the Machine learning in Perl series, focusing on the&nbsp;<a href="https://metacpan.org/pod/AI::MXNet">AI::MXNet</a>, a Perl interface to Apache MXNet, a modern and powerful machine learning library.</p>
<p>If you're interested in refreshing your memory or just new to the series, please check previous entries over here:&nbsp;<a href="http://blogs.perl.org/users/sergey_kolychev/2017/02/machine-learning-in-perl.html">1</a>&nbsp;<a href="http://blogs.perl.org/users/sergey_kolychev/2017/04/machine-learning-in-perl-part2-a-calculator-handwritten-digits-and-roboshakespeare.html">2</a>&nbsp;<a href="http://blogs.perl.org/users/sergey_kolychev/2017/10/machine-learning-in-perl-part3-deep-convolutional-generative-adversarial-network.html">3</a></p>
<p><a href="https://metacpan.org/pod/AI::MXNet">https://metacpan.org/pod/AI::MXNet</a></p><p>Address of the bookmark: <a href="http://blogs.perl.org/users/sergey_kolychev/2018/07/machine-learning-in-perl-kyuubi-goes-to-a-modelzoo-during-the-starry-night.html" rel="nofollow">http://blogs.perl.org/users/sergey_kolychev/2018/07/machine-learning-in-perl-kyuubi-goes-to-a-modelzoo-during-the-starry-night.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2727/download-mutliple-fasta-file-from-ncbi-in-one-go</guid>
	<pubDate>Wed, 21 Aug 2013 08:13:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2727/download-mutliple-fasta-file-from-ncbi-in-one-go</link>
	<title><![CDATA[Download mutliple fasta file from NCBI in one GO!!]]></title>
	<description><![CDATA[<p>if you have less time, then use three ways mentioned in bookmark link to extract/download all fasta sequences in single click given that you already have a list of GIs or accession IDs .</p>
<p>Alternatively, use one liner perl script:</p>
<p>perl -ne 'if(/^&gt;(\S+)/){$c=$i{$1}}$c?print:chomp;$i{$_}=1 if @ARGV' GIs.txt &gt;sequence.fasta</p>
<p>where GIs.txt contains&nbsp;a list of GIs or accession IDs.</p>
<p>(from :<a href="http://edwards.sdsu.edu/labsite/index.php/robert?start=5">http://edwards.sdsu.edu/labsite/index.php/robert?start=5</a>)</p><p>Address of the bookmark: <a href="http://edwards.sdsu.edu/labsite/index.php/robert/380-ncbi-sequence-or-fasta-batch-download-using-entrez" rel="nofollow">http://edwards.sdsu.edu/labsite/index.php/robert/380-ncbi-sequence-or-fasta-batch-download-using-entrez</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/33842/awesome-perl-frameworks-libraries-and-software-part-5</guid>
	<pubDate>Fri, 07 Jul 2017 04:12:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33842/awesome-perl-frameworks-libraries-and-software-part-5</link>
	<title><![CDATA[Awesome perl frameworks, libraries and software - PART 5]]></title>
	<description><![CDATA[<ul>
<li><a href="https://github.com/robelix/sub2srt">robelix/sub2srt</a>&nbsp;- subtitle converter</li>
<li><a href="https://github.com/reyjrar/graphite-scripts">reyjrar/graphite-scripts</a>&nbsp;- A Collections of Scripts for Working with Graphite</li>
<li><a href="https://github.com/regilero/check_nginx_status">regilero/check_nginx_status</a>&nbsp;- Nagios check for nginx status report</li>
<li><a href="https://github.com/omniti-labs/resmon">omniti-labs/resmon</a>&nbsp;- resmon</li>
<li><a href="https://github.com/motemen/App-htmlcat">motemen/App-htmlcat</a>&nbsp;- redirect stdin to web browser</li>
<li><a href="https://github.com/moose/Moo">moose/Moo</a>&nbsp;- Minimalist Object Orientation (with Moose compatibility)</li>
<li><a href="https://github.com/miyagawa/fastpass">miyagawa/fastpass</a>&nbsp;- Tiny, XS free, standalone and preforking FastCGI daemon for PSGI</li>
<li><a href="https://github.com/miyagawa/Filesys-Notify-Simple">miyagawa/Filesys-Notify-Simple</a>&nbsp;- Simple and dumb file system watcher</li>
<li><a href="https://github.com/mhop/fhem-mirror">mhop/fhem-mirror</a>&nbsp;- Branch 'master' is a read-only-mirror of svn://svn.code.sf.net/p/fhem/code which is updated once a day. On branch 'enocean' I am going to add some Enocean-Devices</li>
<li><a href="https://github.com/lopnor/Plack-App-DAV">lopnor/Plack-App-DAV</a>&nbsp;- simple DAV server for Plack</li>
<li><a href="https://github.com/kazuho/url_compress">kazuho/url_compress</a>&nbsp;- a static PPM-based URL compressor / decompressor</li>
<li><a href="https://github.com/jnthn/6model">jnthn/6model</a>&nbsp;- Just a place that I'm keeping some meta-model prototyping; anything that matters will make it to another repo (e.g. nqp-rx one or Rakudo one) at some point.</li>
<li><a href="https://github.com/jasonhancock/nagios-puppetdb">jasonhancock/nagios-puppetdb</a>&nbsp;- Nagios plugins and pnp4nagios templates related to Puppetlab's PuppetDB project.</li>
<li><a href="https://github.com/goccy/p5-Compiler-Parser">goccy/p5-Compiler-Parser</a>&nbsp;- Create Abstract Syntax Tree for Perl5</li>
<li><a href="https://github.com/cgutteridge/Grinder">cgutteridge/Grinder</a>&nbsp;- Create RDF data from spreadsheets or CSV</li>
<li><a href="https://github.com/c9s/Plack-Middleware-OAuth">c9s/Plack-Middleware-OAuth</a>&nbsp;- Plack Middleware for OAuth1 and OAuth2</li>
<li><a href="https://github.com/bzip2-cuda/bzip2-cuda">bzip2-cuda/bzip2-cuda</a>&nbsp;- Parallel implementation of bzip2 using cuda</li>
<li><a href="https://github.com/alanstevens/ChocoPackages">alanstevens/ChocoPackages</a>&nbsp;- Chocolatey Nuget Packages</li>
<li><a href="https://github.com/SoylentNews/slashcode">SoylentNews/slashcode</a>&nbsp;- The slashcode repository for SoylentNews. The initial code base was uploaded as it appeared on Sourceforge as of the last commit in September 2009</li>
<li><a href="https://github.com/Miserlou/XSS-Harvest">Miserlou/XSS-Harvest</a>&nbsp;- XSS Weaponization</li>
</ul>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39913/twinblast-when-two-is-better-than-one</guid>
	<pubDate>Sat, 07 Sep 2019 08:50:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39913/twinblast-when-two-is-better-than-one</link>
	<title><![CDATA[TwinBLAST: When Two Is Better than One]]></title>
	<description><![CDATA[<p>TwinBLAST is a web-based tool for viewing 2 BLAST reports simultaneouslyside-by-side. It uses ExtJS (www.sencha.com/products/extjs/) to provide 2independently scrollable panels. BioPerl (www.bioperl.org) is used to indexraw BLAST reports and Bio::Graphics is used to draw pictograms of the BLASThits.</p>
<p><a href="https://github.com/IGS/twinblast">https://github.com/IGS/twinblast</a></p>
<p><a href="https://mra.asm.org/content/8/35/e00842-19">https://mra.asm.org/content/8/35/e00842-19</a></p><p>Address of the bookmark: <a href="https://github.com/IGS/twinblast" rel="nofollow">https://github.com/IGS/twinblast</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</guid>
	<pubDate>Thu, 18 May 2017 05:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</link>
	<title><![CDATA[maf2synteny]]></title>
	<description><![CDATA[<p>A tool for converting for recovering synteny blocks from multiple alignment (in MAF fromat)</p>
<p>This tool is a standalone version of Ragout module [<a href="http://fenderglass.github./Ragout">http://fenderglass.github./Ragout</a>]</p><p>Address of the bookmark: <a href="https://github.com/fenderglass/maf2synteny" rel="nofollow">https://github.com/fenderglass/maf2synteny</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>