<?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/44403?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/44403?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43563/apache-server-setting</guid>
	<pubDate>Fri, 29 Oct 2021 04:29:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43563/apache-server-setting</link>
	<title><![CDATA[Apache server setting !]]></title>
	<description><![CDATA[<p>Apache is an open source web server that&rsquo;s available for Linux servers free of charge.</p>
<p>In this tutorial we&rsquo;ll be going through the steps of setting up an Apache server.</p>
<h3>What you&rsquo;ll learn</h3>
<ul>
<li>How to set up Apache</li>
<li>Some basic Apache configuration</li>
</ul><p>Address of the bookmark: <a href="https://ubuntu.com/tutorials/install-and-configure-apache#3-creating-your-own-website" rel="nofollow">https://ubuntu.com/tutorials/install-and-configure-apache#3-creating-your-own-website</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44543/seeing-theory-and-learn</guid>
	<pubDate>Tue, 04 Jun 2024 00:31:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44543/seeing-theory-and-learn</link>
	<title><![CDATA[Seeing Theory and Learn]]></title>
	<description><![CDATA[<p>Seeing Theory was created by Daniel Kunin while an undergraduate at Brown University. The goal of this website is to make statistics more accessible through interactive visualizations (designed using Mike Bostock&rsquo;s JavaScript library D3.js).</p><p>Address of the bookmark: <a href="https://seeing-theory.brown.edu/" rel="nofollow">https://seeing-theory.brown.edu/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44622/variant-calling-resequencing-based-genome-inference</guid>
	<pubDate>Wed, 31 Jul 2024 02:02:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44622/variant-calling-resequencing-based-genome-inference</link>
	<title><![CDATA[Variant Calling Resequencing-Based Genome Inference]]></title>
	<description><![CDATA[<p>Variant Calling - Resequencing-Based Genome Inference</p>
<p>Erik Garrison<br>University of Tennessee Health Science Center<br>Workshop on Genomics - Česk&yacute; Krumlov<br>January 12, 2024</p>
<p>https://evomics.org/wp-content/uploads/2024/01/Variant-calling-Workshop-on-Genomics-2024-Cesky-Krumlov.pdf</p><p>Address of the bookmark: <a href="https://evomics.org/wp-content/uploads/2024/01/Variant-calling-Workshop-on-Genomics-2024-Cesky-Krumlov.pdf" rel="nofollow">https://evomics.org/wp-content/uploads/2024/01/Variant-calling-Workshop-on-Genomics-2024-Cesky-Krumlov.pdf</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43243/interactive-bioinformatics-resources</guid>
	<pubDate>Thu, 12 Aug 2021 00:09:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43243/interactive-bioinformatics-resources</link>
	<title><![CDATA[Interactive Bioinformatics Resources !]]></title>
	<description><![CDATA[<p>Learn how to use bioinformatics tools right from your browser.<br>Everything runs in a sandbox, so you can experiment all you want.</p>
<p>More at sandbox.bio</p><p>Address of the bookmark: <a href="http://sandbox.bio" rel="nofollow">http://sandbox.bio</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43631/pangolin-tutorial</guid>
	<pubDate>Fri, 10 Dec 2021 05:58:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43631/pangolin-tutorial</link>
	<title><![CDATA[Pangolin tutorial !]]></title>
	<description><![CDATA[<p><span>This is a tutorial for using the Pangolin Web Application. For information on using the command line tool, please visit the&nbsp;</span><a href="https://cov-lineages.org/resources/pangolin/usage.html">command line tool usage page</a><span>.</span></p>
<p>https://cov-lineages.org/resources/pangolin/tutorial.html</p><p>Address of the bookmark: <a href="https://cov-lineages.org/resources/pangolin/tutorial.html" rel="nofollow">https://cov-lineages.org/resources/pangolin/tutorial.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44601/free-resources-to-learn-statistics</guid>
	<pubDate>Sat, 06 Jul 2024 10:30:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44601/free-resources-to-learn-statistics</link>
	<title><![CDATA[Free resources to learn statistics]]></title>
	<description><![CDATA[<p><span>Welcome to the course notes for&nbsp;</span><span>STAT 414: Introduction to Probability Theory</span><span>. These notes are designed and developed by Penn State's&nbsp;</span><a href="https://science.psu.edu/stat">Department of Statistics</a><span>&nbsp;and offered as open educational resources. These notes are free to use under Creative Commons license&nbsp;</span><a href="https://creativecommons.org/licenses/by-nc/4.0/">CC BY-NC 4.0</a><span>.</span></p>
<p>&nbsp;</p>
<p>A free online version of the second edition of the book based on Stat 110,&nbsp;<em>Introduction to Probability</em>&nbsp;by Joe Blitzstein and Jessica Hwang,&nbsp;is now available at&nbsp;<a href="http://probabilitybook.net/" title="http://probabilitybook.net">http://probabilitybook.net</a></p>
<p>Print copies are available via&nbsp;<a href="https://www.crcpress.com/Introduction-to-Probability-Second-Edition/Blitzstein-Hwang/p/book/9781138369917" title="">CRC Press</a>,&nbsp;<a href="https://amzn.to/2Ubh7D8" title="">Amazon</a>, and elsewhere.&nbsp;</p>
<p>Stat110x is also available as an&nbsp;edX course.&nbsp;Free signup at&nbsp;<a href="https://www.edx.org/course/introduction-to-probability-0" title="https://www.edx.org/course/introduction-to-probability-0">https://www.edx.org/course/introduction-to-probability-0</a></p>
<p>The edX course focuses on animations, interactive features, readings, and problem-solving, and&nbsp;is&nbsp;<strong>complementary</strong>&nbsp;to the Stat 110 lecture videos on YouTube, which are available at&nbsp;<a href="https://goo.gl/i7njSb" title="https://goo.gl/i7njSb">https://goo.gl/i7njSb</a></p>
<p>The Stat110x animations are available within the course and at&nbsp;<a href="https://goo.gl/g7pqTo" title="">https://goo.gl/g7pqTo</a></p>
<p><a href="https://projects.iq.harvard.edu/stat110/home">https://projects.iq.harvard.edu/stat110/home</a>&nbsp;</p><p>Address of the bookmark: <a href="https://online.stat.psu.edu/stat414/" rel="nofollow">https://online.stat.psu.edu/stat414/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5191/programming-language-to-build-synthetic-dna</guid>
	<pubDate>Mon, 30 Sep 2013 16:37:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5191/programming-language-to-build-synthetic-dna</link>
	<title><![CDATA[Programming language to build synthetic DNA]]></title>
	<description><![CDATA[<p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;">A team led by <a href="http://homes.cs.washington.edu/~seelig/index.html">Georg Seelig</a>&nbsp;(<a href="http://homes.cs.washington.edu/~seelig/index.html">http://homes.cs.washington.edu/~seelig/index.html</a>) at&nbsp;University of Washington has developed a programming language for chemistry that it hopes will streamline efforts to design a network that can guide the behavior of chemical-reaction mixtures in the same way that embedded electronic controllers guide cars, robots and other devices. In medicine, such networks could serve as &ldquo;smart&rdquo; drug deliverers or disease detectors at the cellular level.</p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;">Reference &amp; More @</p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;"><a href="http://www.nature.com/nnano/journal/vaop/ncurrent/full/nnano.2013.189.html">http://www.nature.com/nnano/journal/vaop/ncurrent/full/nnano.2013.189.html</a></p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;"><a href="http://www.washington.edu/news/2013/09/30/uw-engineers-invent-programming-language-to-build-synthetic-dna/">http://www.washington.edu/news/2013/09/30/uw-engineers-invent-programming-language-to-build-synthetic-dna/</a></p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;">Image source:&nbsp;washington.edu</p><p style="color: #333333; font-size: 13px; font-style: normal; font-weight: normal; text-align: start;"><img src="http://www.washington.edu/news/files/2013/09/Programmable-chemistry-2.jpg" alt="image" style="border: 0px; border: 0px;"></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30018/bipype</guid>
	<pubDate>Thu, 01 Dec 2016 08:47:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30018/bipype</link>
	<title><![CDATA[bipype]]></title>
	<description><![CDATA[<p><span>Bipype is a very useful program, which prepare a lot of types of bioinformatics analyses. There are three input options: amplicons, WGS (whole genome sequences) and metatranscriptomic data. If amplicons are input data, then bipype does reconstruction and pairs merging. After that biodiversity is searching. There are two types of searching depending on the amplicons types (ITS or 16S). If WGS are chosen, then bipype finds the SA coordinates of the input reads and generates alignments in the SAM format given single-end reads, aligns reads to reference sequence(s). All of these analyses will be shown with Krona program, which allows to show hierarchical data with pie charts.</span></p><p>Address of the bookmark: <a href="https://readthedocs.org/projects/bipype/" rel="nofollow">https://readthedocs.org/projects/bipype/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</guid>
	<pubDate>Sat, 25 Aug 2018 04:46:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</link>
	<title><![CDATA[Julia Programming Language, a Python and R rival]]></title>
	<description><![CDATA[<p>Big data has grown to become one of the most lucrative fields. In fact, data scientists are some of the most sought people. They are usually hired to analyze, control and parse large chunks of data. Implementing these actions using traditional techniques is not a walk in the park. This is why most data scientists prefer using programming languages such as R and Python. However, there is one more programming language that can do the job. That is Julia programming language.</p><p>What Is Julia Language?</p><p>Julia is a programming language that came into the limelight in 2012. It is a general-purpose programming language that was designed for solving scientific computations. Julia was meant to be an alternative to Python, R and other programming languages that were mainly used for manipulating data. This is because it has numerous features that can minimize the complexities of numerical computations.&nbsp;</p><p>Julia optimizes on the best features of Python and R while at the same time overlooks their weaknesses. This explains why it is viewed as an alternative to these programming languages. For instance, it utilizes the readability and simplicity of Python then performs faster.</p><p>Julia is the most preferred programming language for data scientists and mathematicians. This is because its core features are similar to the ones that are used on most data software. Also, the language is ideal for these two subjects because its syntax is similar to the standard mathematical formulas.</p><p>Key Features Of Julia Language<br />Uses JIT Compilation<br />Parallelism<br />Dynamic Typing<br />Simple Syntax<br />Allows Metaprogramming<br />Accessible to Libraries<br />-1-Array Indexing</p><p>Julia Vs Python And R Programming Languages<br />1. Speed<br />Julia is faster than both Python and R. This is a very critical aspect that is given special attention in the big data programming. The high speed of Julia is because of JIT compilers. You will need to install external libraries on Python to achieve similar speed.</p><p>2. Syntax<br />Julia has a math-friendly syntax. The syntax of this programming language is similar to the mathematical formulas hence can be used to perform mathematical and scientific computations. This syntax makes it easier to learn than Python.</p><p>3. Parallelism<br />Although both Python and R use parallelism, Julia uses a top-level parallelism. Julia allows the processor to perform to the optimum level than what Python and R can achieve.</p><p>4. Versatility<br />Julia programming language is more versatile than Python and R. It allows a programmer to move from different codes and functions with ease.</p><p>The only area that Python and R are superior to Julia is in terms of community. Given that Julia is a new programming language, it has a small community as compared to others which have been around for years.</p><p>In overall Julia programming language is a better alternative that you can use to handle Big data projects. Despite having a small community, it is one of those programming languages that you can easily learn.</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</guid>
	<pubDate>Sat, 09 Dec 2017 08:59:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</link>
	<title><![CDATA[MOSS: A System for Detecting Software Similarity]]></title>
	<description><![CDATA[<p><span>Moss (for a Measure Of Software Similarity) is an automatic system for determining the similarity of programs. To date, the main application of Moss has been in detecting plagiarism in programming classes. Since its development in 1994, Moss has been very effective in this role. The algorithm behind moss is a significant improvement over other cheating detection algorithms (at least, over those known to us).</span></p>
<p><span><span>Moss can currently analyze code written in the following languages:</span></span></p>
<p>C, C++, Java, C#, Python, Visual Basic, Javascript, FORTRAN, ML, Haskell, Lisp, Scheme, Pascal, Modula2, Ada, Perl, TCL, Matlab, VHDL, Verilog, Spice, MIPS assembly, a8086 assembly, a8086 assembly, MIPS assembly, HCL2.</p><p>Address of the bookmark: <a href="https://theory.stanford.edu/~aiken/moss/" rel="nofollow">https://theory.stanford.edu/~aiken/moss/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>