<?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/33586?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/33586?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37592/benchmarking-perl-module</guid>
	<pubDate>Sat, 25 Aug 2018 11:40:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37592/benchmarking-perl-module</link>
	<title><![CDATA[Benchmarking Perl Module !]]></title>
	<description><![CDATA[<p>The benchmark module is a great tool to know the time the code takes to run. The output is usually in terms of CPU time. This module provides us with a way to optimize our code. With the advent of petascale computing and other multicore processor it is becoming a neccesity to know about the CPU time taken by our perl program.</p><p>This is the simple way to use the module</p><blockquote><p>Example1:</p><p>use Benchmark;</p><p>$first_time = Benchmark-&gt;new;</p><p>our code&hellip;&hellip;</p><p>$second_time = Benchmark-&gt;new;</p><p>$final_difference = timediff($first_time,$second_time);</p><p>print &ldquo;the code took, timestr($final_difference),&rdquo;\n&rdquo;;</p></blockquote><p>that was a very simple way to know the time diff , we can use it to know the time taken by some part of the code in the program.</p><blockquote><p>More sophisticated way:</p><p>use Benchmark;<br />sub first {</p><p>my(arguments) = @_;</p><p>}</p><p>timethese(100, { first =&gt; &lsquo;first_sub(arguments)&rsquo;});</p><p>The first argument to timethese is 100 (evaluate 100 times).</p></blockquote><p>Hope this very small tutorial with Benchmark will help people get started.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<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/file/view/36952/getoptspl-file</guid>
	<pubDate>Fri, 15 Jun 2018 04:43:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/36952/getoptspl-file</link>
	<title><![CDATA[getopts.pl file]]></title>
	<description><![CDATA[
<p>SSPACE_longread complain for getopts.pl file. </p>

<p>To resolve this, download and have in SSPACED-Longreads folder. </p>

<p>Cheers :)</p>
]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/36952" length="942" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27348/ngago-challenge-crispr</guid>
	<pubDate>Tue, 17 May 2016 03:31:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27348/ngago-challenge-crispr</link>
	<title><![CDATA[NgAgo challenge CRISPR !!]]></title>
	<description><![CDATA[<p><a href="http://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3547.html" target="_blank" title="A recent Nature Biotechnology paper"><strong>A recent Nature Biotechnology paper</strong></a>&nbsp;from Chunyu Han&rsquo;s lab,&nbsp;DNA-guided genome editing using the&nbsp;<em>Natronobacterium gregoryi&nbsp;</em>Argonaute,&nbsp;is a must-read for genome editing folks who want to learn about NgAgo. Their team sums up NgAgo&rsquo;s potential pluses this way (<strong>emphasis</strong>&nbsp;mine):</p><blockquote><p>&ldquo;The useful features of NgAgo for genome editing include the following.<strong>First, it has a low tolerance to guide&ndash;target mismatch</strong>. A single nucleotide mismatch at each position of the gDNA impaired the cleavage efficiency of NgAgo, and mismatches at three positions completely blocked cleavage in our experiments.&nbsp;<strong>Second, 5&prime; phosphorylated short ssDNAs are rare in mammalian cells, which minimizes the possibility of cellular oligonucleotides misguiding NgAgo</strong>.<strong>Third, NgAgo follows a &lsquo;one-guide-faithful&rsquo; rule,</strong>&nbsp;that is, a guide can only be loaded when NgAgo protein is in the process of expression, and, once loaded, NgAgo cannot swap its gDNA with other free ssDNA at 37 &deg;C. All of these features could minimize off-target effects.&nbsp;<strong>Finally, it is easy to design and synthesize ssDNAs and to adjust their concentration</strong>, which is difficult with the Cas9-sgRNA system, if the sgRNA is expressed from a plasmid and the normal dosage of an ssDNA guide is only ~1/10 of that of a sgRNA expression plasmid.</p></blockquote><p>NgAgo might be a more orderly way and perhaps even simpler way to go about genome editing than CRISPR, but the jury is still out on that until there are more papers and data. The NgAgo edit efficiency at this preliminary stage of technology development seems very strong. See the pics below</p><p><img src="http://i1.wp.com/www.ipscell.com/wp-content/uploads/2016/05/NgAgo1.jpg" alt="image" width="1311" height="559" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>Reference:&nbsp;http://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3547.html</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44387/creating-genetic-maps-from-gbs-data</guid>
	<pubDate>Fri, 08 Sep 2023 06:31:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44387/creating-genetic-maps-from-gbs-data</link>
	<title><![CDATA[Creating Genetic Maps from GBS data]]></title>
	<description><![CDATA[<p><span>Genetic map, as the name suggest is simply knowing the relative positions of specific sequences across the genome. There are various methods to generate them, but most popular method is to use a cross between the known parents and examining their progenies. These kinds of crosses to create specific group of individuals of known ancestry is called as mapping population. Many types of mapping population exist. Here we will use the data collected from a Recombinant Inbred Line (RIL) (through selfing) to create a genetic map.</span></p><p>Address of the bookmark: <a href="https://bioinformaticsworkbook.org/dataAnalysis/GenomeAssembly/GeneticMaps/creating-genetic-maps.html" rel="nofollow">https://bioinformaticsworkbook.org/dataAnalysis/GenomeAssembly/GeneticMaps/creating-genetic-maps.html</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</guid>
	<pubDate>Sat, 25 Jan 2020 13:28:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</link>
	<title><![CDATA[DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.]]></title>
	<description><![CDATA[<p><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.</span></p>
<p><span><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on&nbsp;</span><a href="https://github.com/google/nucleus">Nucleus</a><span>, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the&nbsp;</span><a href="https://www.tensorflow.org/">TensorFlow</a><span>&nbsp;machine learning framework.</span></span></p>
<p><span><a href="https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html">https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html</a></span></p>
<p><span><a href="https://www.biorxiv.org/content/10.1101/092890v6">https://www.biorxiv.org/content/10.1101/092890v6</a></span></p>
<p><span><img src="https://4.bp.blogspot.com/-2KlXZO60sWE/WiGc8qlZfxI/AAAAAAAACOs/s1pNiKI8jsAvJLr1E_po5udDO8eObm_awCLcBGAs/s640/image3.png" width="640" height="427" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/google/deepvariant" rel="nofollow">https://github.com/google/deepvariant</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44898/genomad-identification-of-mobile-genetic-elements</guid>
	<pubDate>Sun, 31 Aug 2025 06:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44898/genomad-identification-of-mobile-genetic-elements</link>
	<title><![CDATA[geNomad: Identification of mobile genetic elements]]></title>
	<description><![CDATA[<p><span>geNomad is a tool that identifies virus and plasmid genomes from nucleotide sequences. It provides state-of-the-art classification performance and can be used to quickly find mobile genetic elements from genomes, metagenomes, or metatranscriptomes.</span></p><p>Address of the bookmark: <a href="https://portal.nersc.gov/genomad" rel="nofollow">https://portal.nersc.gov/genomad</a></p>]]></description>
	<dc:creator>LEGE</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>

</channel>
</rss>