<?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/31343?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/31343?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26414/advanced-bash-scripting-guide</guid>
	<pubDate>Thu, 18 Feb 2016 04:50:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26414/advanced-bash-scripting-guide</link>
	<title><![CDATA[Advanced Bash-Scripting Guide]]></title>
	<description><![CDATA[<p>This tutorial assumes no previous knowledge of scripting or programming, yet progresses rapidly toward an intermediate/advanced level of instruction <em>. . . all the while sneaking in little nuggets of <span>UNIX</span>&reg; wisdom and lore</em>. It serves as a textbook, a manual for self-study, and as a reference and source of knowledge on shell scripting techniques. The exercises and heavily-commented examples invite active reader participation, under the premise that <tt><strong>the only way to really learn scripting is to write scripts</strong></tt>.</p>
<p>This book is suitable for classroom use as a general introduction to programming concepts.</p>
<p>More at http://tldp.org/LDP/abs/html/</p><p>Address of the bookmark: <a href="http://tldp.org/LDP/abs/html/" rel="nofollow">http://tldp.org/LDP/abs/html/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28117/quin%E2%80%99s-web-server</guid>
	<pubDate>Mon, 27 Jun 2016 10:44:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28117/quin%E2%80%99s-web-server</link>
	<title><![CDATA[QuIN’s web server]]></title>
	<description><![CDATA[<p><span>Recent studies of the human genome have indicated that regulatory elements (e.g. promoters and enhancers) at distal genomic locations can interact with each other via chromatin folding and affect gene expression levels. Genomic technologies for mapping interactions between DNA regions, e.g., ChIA-PET and HiC, can generate genome-wide maps of interactions between regulatory elements. These interaction datasets are important resources to infer distal gene targets of non-coding regulatory elements and to facilitate prioritization of critical loci for important cellular functions. With the increasing diversity and complexity of genomic information and public ontologies, making sense of these datasets demands integrative and easy-to-use software tools. Moreover, network representation of chromatin interaction maps enables effective data visualization, integration, and mining. Currently, there is no software that can take full advantage of network theory approaches for the analysis of chromatin interaction datasets. To fill this gap, we developed a web-based application, QuIN, which enables: 1) building and visualizing chromatin interaction networks, 2) annotating networks with user-provided private and publicly available functional genomics and interaction datasets, 3) querying network components based on gene name or chromosome location, and 4) utilizing network based measures to identify and prioritize critical regulatory targets and their direct and indirect interactions.&nbsp;</span></p>
<p><strong>AVAILABILITY:</strong><span>&nbsp;QuIN&rsquo;s web server is available at&nbsp;</span><a href="http://quin.jax.org/">http://quin.jax.org</a><span>&nbsp;QuIN is developed in Java and JavaScript, utilizing an Apache Tomcat web server and MySQL database and the source code is available under the GPLV3 license available on GitHub:</span><a href="https://github.com/UcarLab/QuIN/">https://github.com/UcarLab/QuIN/</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004809" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004809</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29654/randomness-and-probability</guid>
	<pubDate>Tue, 08 Nov 2016 07:17:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29654/randomness-and-probability</link>
	<title><![CDATA[Randomness and Probability]]></title>
	<description><![CDATA[<p>Randomness and Probability</p><p>Randomness and probability are two differnet concepts: probaility is a measure (according to measure theory) which measures the randomness. Randomness is the object to be measured by probability.&nbsp;For example, probability is a mapping from randomness to the real number between 0 and 1. The similar examples are that the entropy measures the uncertanity; product of length and width measures the area of rectangle etc.</p><p><strong>Please see &ldquo;A mathematical theory of ability measure&rdquo; by N. Kong ets for more examples to answer&nbsp;this question.</strong></p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29654" length="598559" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29693/bioistats-online-course</guid>
	<pubDate>Thu, 10 Nov 2016 04:22:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29693/bioistats-online-course</link>
	<title><![CDATA[Bioistats Online course]]></title>
	<description><![CDATA[<p><span>One of our primary focuses will be to develop an understanding of the various ways in which we can assign a probability to some chance event. We'll also learn the&nbsp;</span><strong>fundamental&nbsp;</strong><span><strong>properties of probability</strong>, investigate how probability behaves, and learn how to calculate the probability of a new chance event.</span></p>
<p><span>This book is handy understanding basic concepts.</span></p><p>Address of the bookmark: <a href="https://onlinecourses.science.psu.edu/stat414/node/287" rel="nofollow">https://onlinecourses.science.psu.edu/stat414/node/287</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30002/excavator2tool</guid>
	<pubDate>Wed, 30 Nov 2016 04:09:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30002/excavator2tool</link>
	<title><![CDATA[EXCAVATOR2tool]]></title>
	<description><![CDATA[<p><span>EXCAVATOR2 is a collection of bash, R and Fortran scripts and codes that analyses Whole Exome Sequencing (WES) data to identify CNVs. EXCAVATOR2 enhances the identification of all genomic CNVs, both overlapping and non-overlapping targeted exons by integrating the analysis of In-targets and Off- targets reads. Specifically, it improves the precision of calling CNVs overlapping targeted exons from WES data and enlarges the spectrum of detectable CNVs to off-target events.</span><br><span>EXCAVATOR2 can be effectively employed for the identification of CNVs in small as well as large-scale re-sequencing population and cancer studies. Lastly, it&rsquo;s of particular interest that all WES experiments can be re-analysed using our method with the beneficial effect to identify novelCNVs in extra-exonic regions by having the full-genome CN profile.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/excavator2tool/" rel="nofollow">https://sourceforge.net/projects/excavator2tool/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30085/fqtools</guid>
	<pubDate>Thu, 08 Dec 2016 09:31:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30085/fqtools</link>
	<title><![CDATA[fqtools]]></title>
	<description><![CDATA[<p><code>fqtools</code><span>&nbsp;is a software suite for fast processing of&nbsp;</span><code>FASTQ</code><span>&nbsp;files. Various file manipulations are supported. See below for a full list of the subcommands available and a brief description of their purpose. Most of the individual subcommands will take either a single file or a pair of files as input. If no input file is specified, fqtools will attempt to read data from&nbsp;</span><code>stdin</code><span>. In this case, it is advisabe to specify the format of the data provided. For subcommands that generate FASTQ data, either a single file or a pair of files will be generated. If no&nbsp;</span><code>-o</code><span>&nbsp;argument is provided, single files will be writted to&nbsp;</span><code>stdout</code><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/alastair-droop/fqtools" rel="nofollow">https://github.com/alastair-droop/fqtools</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/32152/upsetr-shiny-app</guid>
	<pubDate>Fri, 14 Apr 2017 06:19:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32152/upsetr-shiny-app</link>
	<title><![CDATA[UpSetR Shiny App!]]></title>
	<description><![CDATA[<p>UpSetR generates static&nbsp;<a href="http://vcg.github.io/upset/?dataset=0&amp;duration=1000&amp;orderBy=subsetSize&amp;grouping=groupByIntersectionSize&amp;selection=">UpSet plots</a>. The UpSet technique visualizes set intersections in a matrix layout and introduces aggregates based on groupings and queries. The matrix layout enables the effective representation of associated data, such as the number of elements in the aggregates and intersections, as well as additional summary statistics derived from subset or element attributes.</p>
<h4>To begin, input your data using one of the three input styles.</h4>
<ol>
<li>"File" takes a correctly formatted.csv file.</li>
<li>"List" takes up to 6 different lists that contain unique elements, similar to that used in the web applications BioVenn&nbsp;<a href="http://www.biomedcentral.com/content/pdf/1471-2164-9-488.pdf">(Hulsen et al., 2008)</a>&nbsp;and jvenn&nbsp;<a href="http://www.biomedcentral.com/content/pdf/1471-2105-15-293.pdf">(Bardou et al., 2014)</a></li>
<li>"Expression" takes the input used by the venneuler R package&nbsp;<a href="https://cran.r-project.org/web/packages/venneuler/venneuler.pdf">(Wilkinson, 2015)</a></li>
</ol><p>Address of the bookmark: <a href="https://gehlenborglab.shinyapps.io/upsetr/" rel="nofollow">https://gehlenborglab.shinyapps.io/upsetr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</guid>
	<pubDate>Fri, 05 May 2017 05:58:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</link>
	<title><![CDATA[CLA: Contig-Layout-Authenticator]]></title>
	<description><![CDATA[<p><span>To improve upon the shortcomings associated with the construction of draft genomes with Illumina paired-end sequencing, we developed Contig-Layout-Authenticator (CLA). The CLA pipeline can scaffold reference-sorted contigs based on paired reads, resulting in better assembled genomes. Moreover, CLA also hints at probable misassemblies and contaminations, for the users to cross-check before constructing the consensus draft. The CLA pipeline was designed and trained extensively on various bacterial genome datasets for the ordering and scaffolding of large repetitive contigs. The tool has been validated and compared favorably with other widely-used scaffolding and ordering tools using both simulated and real sequence datasets. CLA is a user friendly tool that requires a single command line input to generate ordered scaffolds.</span></p>
<p><span>Script&nbsp;https://sourceforge.net/projects/c-l-authenticator/files/</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40613/genome-in-a-bottle-giab-consortium</guid>
	<pubDate>Sat, 25 Jan 2020 13:50:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40613/genome-in-a-bottle-giab-consortium</link>
	<title><![CDATA[Genome in a Bottle (GIAB) Consortium]]></title>
	<description><![CDATA[<p><span>The</span><a href="http://www.genomeinabottle.org/"> Genome in a Bottle (GIAB) Consortium</a><span> is a public-private-academic consortium hosted by </span><a href="http://www.nist.gov/" target="_blank">NIST</a><span> to develop the technical infrastructure (reference standards, reference methods, and reference data) to enable translation of whole human genome sequencing to clinical practice. </span></p>
<p><span><a href="https://www.nist.gov/news-events/news/2016/09/nist-releases-new-family-standardized-genomes">https://www.nist.gov/news-events/news/2016/09/nist-releases-new-family-standardized-genomes</a></span></p><p>Address of the bookmark: <a href="https://jimb.stanford.edu/giab/" rel="nofollow">https://jimb.stanford.edu/giab/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>