<?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/45286?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/45286?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/31502/perl-way-to-check-if-an-array-contains-values</guid>
	<pubDate>Thu, 09 Mar 2017 17:17:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/31502/perl-way-to-check-if-an-array-contains-values</link>
	<title><![CDATA[Perl way to check if an array contains values]]></title>
	<description><![CDATA[<p><span>Perl is always is known for their flexibility (<span>There is more than one way to do it</span>). </span></p><p><span>Followings are the quick way to check if a value exist in an array.</span></p><blockquote><p><span>do_something </span><span>if</span><span> </span><span>'flour'</span><span> </span><span>~~</span><span> </span><span>@ingredients</span><span> &nbsp; </span><span># ~~ operand. &nbsp; BEWARE: it is broken.</span><span><br /><br />do_something </span><span>if</span><span> grep </span><span>{</span><span>$_ eq </span><span>'flour'</span><span>}</span><span> </span><span>@ingredients</span><span> </span><span># grep (slower than 'any')</span><span><br /><br />do_something </span><span>if</span><span> any </span><span>{</span><span>$_ eq </span><span>'flour'</span><span>}</span><span> </span><span>@ingredients</span><span> </span><span># List::MoreUtils / Util::Any</span><span><br /><br />do_something </span><span>if</span><span> any</span><span>(</span><span>@ingredients</span><span>)</span><span> eq </span><span>'flour'</span><span> &nbsp; </span><span># use syntax 'junction';</span><span><br /><br />do_something </span><span>if</span><span> </span><span>@ingredients</span><span>-&gt;</span><span>contains</span><span>(</span><span>'flour'</span><span>)</span><span> &nbsp; </span><span># added with autobox</span></p></blockquote>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36644/tacoa-taxonomic-classification-of-environmental-genomic-fragments-using-a-kernelized-nearest-neighbor-approach</guid>
	<pubDate>Tue, 15 May 2018 09:52:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36644/tacoa-taxonomic-classification-of-environmental-genomic-fragments-using-a-kernelized-nearest-neighbor-approach</link>
	<title><![CDATA[TACOA: Taxonomic classification of environmental genomic fragments using a kernelized nearest neighbor approach]]></title>
	<description><![CDATA[TACOA is a software that can accurately predict the taxonomic origin of genomic fragments from metagenomic data sets by combining the advantages of the k -NN approach with a smoothing kernel function. 

TACOA can be easily installed and run on a desktop computer, therefore allowing researchers to locally analyze their metagenomic sequence data or integrate it into their pipelines.<p>Address of the bookmark: <a href="http://www.cebitec.uni-bielefeld.de/index.php/2-uncategorised/99-tacoa" rel="nofollow">http://www.cebitec.uni-bielefeld.de/index.php/2-uncategorised/99-tacoa</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34504/minion-gc-an-r-script-to-do-some-qc-on-minion-data</guid>
	<pubDate>Sun, 03 Dec 2017 15:19:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34504/minion-gc-an-r-script-to-do-some-qc-on-minion-data</link>
	<title><![CDATA[MinION_GC: An R script to do some QC on MinION data]]></title>
	<description><![CDATA[<p><span>Other tools focus on getting data out of the fastq or fast5 files, which is slow and computationally intensive. The benefit of this approach is that it works on a single, small, .txt summary file. So it's a lot quicker than most other things out there: it takes about a minute to analyse a 4GB flowcell on my laptop.</span></p>
<p>https://github.com/roblanf/minion_qc</p><p>Address of the bookmark: <a href="https://github.com/roblanf/minion_qc" rel="nofollow">https://github.com/roblanf/minion_qc</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4408/fourth-branch-of-life</guid>
	<pubDate>Mon, 09 Sep 2013 21:48:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4408/fourth-branch-of-life</link>
	<title><![CDATA[Fourth Branch of Life]]></title>
	<description><![CDATA[<p>Scientist have found the biggest viruses known, pandoraviruses which opened up entirely /completely... new questions questions and raise objections to in science. It even suggesting a fourth domain of life.</p><p>The new visrus are about one micron&mdash;a thousandth of a millimeter&mdash;in length, the newfound genus Pandoravirus dwarfs other viruses, which range in size from about 50 nanometers up to 100 nanometers. A genus is a taxonomic ranking between species and family.</p><p>Find&nbsp; more at @ http://www.nature.com/scitable/blog/viruses101/newly_found_pandoraviruses_hint_at</p><p>http://news.nationalgeographic.co.uk/news/2013/07/130718-viruses-pandoraviruses-science-biology-evolution/</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/38226/ncbi-to-assist-in-virus-hunting-data-science-hackathon</guid>
	<pubDate>Thu, 15 Nov 2018 12:55:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/38226/ncbi-to-assist-in-virus-hunting-data-science-hackathon</link>
	<title><![CDATA[NCBI to assist in Virus Hunting Data Science Hackathon]]></title>
	<description><![CDATA[<p>NCBI Hackathon are pleased to announce the second installment of the&nbsp;<a href="https://ncbiinsights.ncbi.nlm.nih.gov/2017/11/30/ncbi-southern-california-genomics-hackathon-january/" target="_blank">SoCal Bioinformatics Hackathon</a>. From January 9-11, 2019, the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/" target="_blank">NCBI</a>&nbsp;will help run a bioinformatics hackathon in Southern California hosted by the&nbsp;<a href="http://www.csrc.sdsu.edu/" target="_blank">Computational Sciences Research Center</a>&nbsp;at&nbsp;<a href="http://www.sdsu.edu/" target="_blank">San Diego State University</a>!</p><p><span>NCBI Hackathon</span>&nbsp;specifically looking for folks who have experience in computational virus hunting or adjacent fields to identify known, taxonomically-definable and novel viruses from a few hundred thousand metagenomic datasets that we&rsquo;ll put on cloud infrastructure. This event is for researchers, including students and postdocs, who are already engaged in the use of bioinformatics data or in the development of pipelines for virological analyses from high-throughput experiments. If this describes you, please&nbsp;<a href="https://goo.gl/forms/kDnSG0IAZD62XQRe2" target="_blank">apply</a>! The event is open to anyone selected for the hackathon and willing to travel to SDSU (see below).</p><p>https://ncbiinsights.ncbi.nlm.nih.gov/2018/11/09/ncbi-sdsu-virus-hunting-data-science-hackathon-january-2019/</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43940/langya-virus-update</guid>
	<pubDate>Fri, 12 Aug 2022 05:31:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43940/langya-virus-update</link>
	<title><![CDATA[Langya Virus Update !]]></title>
	<description><![CDATA[<p>https://www.ncbi.nlm.nih.gov/nuccore/OM101125,OM101126,OM101127,OM101128,OM101129,OM101130?</p><p>Zoonotic Henipavirus</p><p>https://pubmed.ncbi.nlm.nih.gov/35921459/</p><p>https://www.ncbi.nlm.nih.gov/nuccore/OM069646,,OM069567,OM069568,OM069569,OM069570,OM069571,OM069572,OM069573,OM069574,OM069575,OM069576,OM069577,OM069578,OM069579,OM069580,OM069581,OM069582,OM069583,OM069584,OM069585,OM069586,OM069587,OM069588,OM069589,OM069590,OM069591,OM069592,OM069593,OM069594,OM069595,OM069596,OM069597,OM069598,OM069599,OM069600,OM069601,OM069602,OM069603,OM069604,OM069605,OM069606,OM069607,OM069608,OM069609,OM069610,OM069611,OM069612,OM069613,OM069614,OM069615,OM069616,OM069617,OM069618,OM069619,OM069620,OM069621,OM069622,OM069623,OM069624,OM069625,OM069626,OM069627,OM069628,OM069629,OM069630,OM069631,OM069632,OM069633,OM069634,OM069635,OM069636,OM069637,OM069638,OM069639,OM069640,OM069641,OM069642,OM069643,OM069644,OM069645,OM069646</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</guid>
	<pubDate>Mon, 05 Aug 2024 23:01:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</link>
	<title><![CDATA[UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment]]></title>
	<description><![CDATA[<p>UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment</p>
<ul>
<li>
<p>Using state of the art tools, easily extended for other viruses</p>
</li>
<li>
<p>Tool and database updates for critical components via Conda</p>
</li>
<li>
<p>Built using modern design patterns with Conda and Snakemake</p>
</li>
<li>
<p>Extensible and easy to customize</p>
</li>
<li>
<p>Submission Ready Genomes</p>
</li>
<li>
<p>Customizable reporting with comprehensive visualization</p>
</li>
</ul>
<p>https://ikim-essen.github.io/uncovar/</p>
<p>Github&nbsp;https://github.com/IKIM-Essen/uncovar</p>
<p>&nbsp;</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ikim-essen.github.io/uncovar/" rel="nofollow">https://ikim-essen.github.io/uncovar/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</guid>
	<pubDate>Fri, 31 Jan 2020 02:36:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</link>
	<title><![CDATA[Complete genome sequence of Wuhan seafood market pneumonia virus is out !]]></title>
	<description><![CDATA[<p>Wuhan-Hu-1 claimed at least 40 lives and infected at least 1300 others in China. Cases are now being reported from Thailand, Singapore, Malaysia, South Korea, Japan, Vietnam, Nepal, France, Australia and even as far as the US.&nbsp;On Jan 10 2020, while news of the first fatality was barely trickling in, the <a href="https://www.ncbi.nlm.nih.gov/nuccore/MN908947">29,903 letters</a> constituting the viral genome from an affected individual in Wuhan had already been elucidated (even though a few corrections were made subsequently). All the viral genome sequences from affected individuals are very very close to each other. Several are identical and none has more than 5 differences (99.983% similarity). This strongly suggests that transmission into humans came from a single pointed source and happened very recently, between Sep-Dec 2019.</p><p>Check out the detail at https://www.ncbi.nlm.nih.gov/nuccore/MN908947</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43088/iva-accurate-de-novo-assembly-of-rna-virus-genomes</guid>
	<pubDate>Wed, 23 Jun 2021 07:51:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43088/iva-accurate-de-novo-assembly-of-rna-virus-genomes</link>
	<title><![CDATA[IVA: accurate de novo assembly of RNA virus genomes]]></title>
	<description><![CDATA[<p>IVA (Iterative Virus Assembler) designed specifically for read pairs sequenced at highly variable depth from RNA virus samples. We tested IVA on datasets from 140 sequenced samples from human immunodeficiency virus-1 or influenza-virus-infected people and demonstrated that IVA outperforms all other virus de novo assemblers.</p>
<p><strong> Availability and implementation: </strong> The software runs under Linux, has the GPLv3 licence and is freely available from http://sanger-pathogens.github.io/iva</p>
<p>https://pubmed.ncbi.nlm.nih.gov/25725497/</p><p>Address of the bookmark: <a href="https://github.com/sanger-pathogens/iva" rel="nofollow">https://github.com/sanger-pathogens/iva</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</guid>
	<pubDate>Mon, 06 Mar 2017 03:44:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</link>
	<title><![CDATA[MetaBAT:  An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities]]></title>
	<description><![CDATA[<p>MetaBAT, An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities</p>
<p>Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (&gt;200kb) in 3 hours, where 621 genome bins are &gt;50% complete with &lt;5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.</p><p>Address of the bookmark: <a href="https://bitbucket.org/berkeleylab/metabat" rel="nofollow">https://bitbucket.org/berkeleylab/metabat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>