<?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/44663?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/44663?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</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/39947/radar-charts-with-ggplot2</guid>
	<pubDate>Tue, 17 Sep 2019 23:01:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39947/radar-charts-with-ggplot2</link>
	<title><![CDATA[radar charts with ggplot2]]></title>
	<description><![CDATA[<p><code>ggradar</code>&nbsp;allows you to build radar charts with ggplot2. This package is based on&nbsp;<a href="http://rstudio-pubs-static.s3.amazonaws.com/5795_e6e6411731bb4f1b9cc7eb49499c2082.html">Paul Williamson&rsquo;s</a>&nbsp;code, with new aesthetics and compatibility with ggplot2 2.0.</p>
<p>It was inspired by&nbsp;<a href="http://www.buildingwidgets.com/blog/2015/12/9/week-49-d3radarr">d3radaR</a>, an htmlwidget built by&nbsp;<a href="https://github.com/timelyportfolio">timelyportfolio</a>.</p><p>Address of the bookmark: <a href="https://github.com/ricardo-bion/ggradar" rel="nofollow">https://github.com/ricardo-bion/ggradar</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41043/postdoctoral-scientist-genome-analytics-genome-bioinformatics-mf</guid>
  <pubDate>Sun, 16 Feb 2020 02:57:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral scientist genome analytics/ genome bioinformatics (m/f/*)]]></title>
  <description><![CDATA[
<p>https://www.uksh.de/jobs/Stellenangebote-nr-20190570-p-8.html<br />Your profile:<br />Degree in bioinformatics, biostatistics, or equivalent<br />Experience in the processing and analysis of large-scale genomics data using compute clusters / high-performance computing<br />Strong competence in working in Unix/Linux environments (shell)<br />Strong programming skills (in particular: Python, R, Perl)<br />Experience with using git and snakemake<br />Fluent English language skills, both spoken and written<br />Strong communication skills and motivation to work in a young, interdisciplinary, dynamic team</p>

<p>Additional Information:</p>

<p>If you have any questions about scientific aspects of this position, please contact Prof. Lars Bertram, head of LIGA (lars.bertram@uni-luebeck.de).</p>

<p>Please contact Ms. Anna Wolbert for further questions about administrative details (recruiting@uksh.de).</p>

<p>Weitere Informationen erhalten Sie auch unter www.uksh.de/karriere.</p>

<p>Wir freuen uns auf Ihre Bewerbung bis zum 15.03.2020 unter Angabe unserer Ausschreibungsnummer 20190570.119.CL.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43546/introduction-to-phylogenies-in-r</guid>
	<pubDate>Wed, 13 Oct 2021 02:27:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43546/introduction-to-phylogenies-in-r</link>
	<title><![CDATA[Introduction to phylogenies in R]]></title>
	<description><![CDATA[<p><span>R phylogenetics is built on the contributed packages for phylogenetics in R, and there are many such packages. Let's begin today by installing a few critical packages, such as ape, phangorn, phytools, and geiger. To get the most recent CRAN version of these packages, you will need to have R 3.3.x installed on your computer!</span></p><p>Address of the bookmark: <a href="http://www.phytools.org/Cordoba2017/ex/2/Intro-to-phylogenies.html" rel="nofollow">http://www.phytools.org/Cordoba2017/ex/2/Intro-to-phylogenies.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44648/modern-statistics-with-r</guid>
	<pubDate>Thu, 22 Aug 2024 04:44:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44648/modern-statistics-with-r</link>
	<title><![CDATA[Modern Statistics with R]]></title>
	<description><![CDATA[<p>This is the online version of the second edition of&nbsp;<em>Modern Statistics with R</em>. It is free to use, and always will be.&nbsp;<a href="https://www.routledge.com/Modern-Statistics-with-R-From-Wrangling-and-Exploring-Data-to-Inference-and-Predictive-Modelling/Thulin/p/book/9781032512440">Printed copies</a>&nbsp;are available from CRC Press.</p>
<p><span>Live&nbsp;<a href="https://statistikakademin.se/in-english-r/">online courses on statistics with R</a></span>&nbsp;based on this book, led by the author, are offered regularly; see&nbsp;<a href="https://statistikakademin.se/in-english-r/">this page</a>&nbsp;for more information and dates.</p>
<p>The past decades have transformed the world of statistical data analysis, with new methods, new types of data, and new computational tools. The aim of&nbsp;<em>Modern Statistics with R</em>&nbsp;is to introduce you to key parts of the modern statistical toolkit. It teaches you:</p>
<ul>
<li><span>Data wrangling</span>&nbsp;- importing, formatting, reshaping, merging, and filtering data in R.</li>
<li><span>Exploratory data analysis</span>&nbsp;- using visualisations and multivariate techniques to explore datasets.</li>
<li><span>Statistical inference</span>&nbsp;- modern methods for testing hypotheses and computing confidence intervals.</li>
<li><span>Predictive modelling</span>&nbsp;- regression models and machine learning methods for prediction, classification, and forecasting.</li>
<li><span>Simulation</span>&nbsp;- using simulation techniques for sample size computations and evaluations of statistical methods.</li>
<li><span>Ethics in statistics</span>&nbsp;- ethical issues and good statistical practice.</li>
<li><span>R programming</span>&nbsp;- writing code that is fast, readable, and (hopefully!) free from bugs.</li>
</ul>
<p>The book includes plenty of examples and more than 200 exercises with worked solutions.&nbsp;<a href="http://www.modernstatisticswithr.com/data.zip">The datasets used for the examples and the exercises can be downloaded here.</a></p><p>Address of the bookmark: <a href="https://www.modernstatisticswithr.com/" rel="nofollow">https://www.modernstatisticswithr.com/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</guid>
	<pubDate>Sat, 21 May 2016 22:32:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</link>
	<title><![CDATA[Tools for Searching Repeats And Palindromic Sequences]]></title>
	<description><![CDATA[<p>What are genomic interspersed repeats?</p><p>In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later characterized and placed into five categories:</p><p><strong>Simple Repeats</strong> - Duplications of simple sets of DNA bases (typically 1-5bp) such as A, CA, CGG etc.<br /><strong>Tandem Repeats</strong> - Typically found at the centromeres and telomeres of chromosomes these are duplications of more complex 100-200 base sequences.<br /><strong>Segmental Duplications</strong> - Large blocks of 10-300 kilobases which are that have been copied to another region of the genome.<br /><strong>Interspersed Repeats</strong><br />Processed Pseudogenes, Retrotranscripts, SINES - Non-functional copies of RNA genes which have been reintegrated into the genome with the assitance of a reverse transcriptase.<br />DNA Transposons<br />Retrovirus Retrotransposons<br />Non-Retrovirus Retrotransposons ( LINES )</p><p>Currently up to 50% of the human genome is repetitive in nature and as improvements are made in detection methods this number is expected to increase.</p><p>On the other hand; In genetics, the term palindrome refers to a sequence of nucleotides along a DNA (deoxyribonucleic acid) or RNA (ribonucleic acid) strand that contains the same series of nitrogenous bases regardless from which direction the strand is analyzed. Akin to a language palindrome&mdash;wherein a word or phrase is spelled the same left-to-right as right-to-left (e.g., the word RADAR or the phrase "able was I ere I saw elba")&mdash;with genetic palindromes it does not matter whether the nucleic acid strand is read starting from the 3' (three prime) end or the 5' (five prime) end of the strand.</p><p>Recent research on palindromes centers on understanding palindrome formation during gene amplification. Other studies have attempted to relate palindrome formation to molecular mechanisms involved in double stranded breaks and in the formation of inverted repeats. Assisted by high speed computers, other groups of scientists link palindrome formation to the conservation of genetic information.</p><p>Related to the direction of transcription by RNA polymerase, DNA strands have upstream and downstream terminus defined by differing chemical groups at each end. The ends of each strand of DNA or RNA are termed the 5' (phosphate bound to the 5' position carbon) and 3' (phosphate bound to the 3' carbon) ends to indicate a polarity within the molecule. Using the letters A, T, C, G, to represent the nitrogenous bases adenine, thymine, cytosine, and guanine found in DNA, and the letters A, U, C, G to represent the nitrogenous bases adenine, uracil, cytosine, guanine found in RNA (Note that uracil in RNA replaces the thymine found in DNA), geneticists usually represent DNA by a series of base codes (e.g., 5' AATCGGATTGCA 3'). The base codes are usually arranged from the 5' end to the 3' end.</p><p>Because of specific base pairing in DNA (i.e., adenine (A) always bonds with (thymine (T) and cytosine (C) always bonds with guanine (G)) the complimentary stand to the sequence 5' AATCGGATTGCA 3' would be 3' TTAGCCTAACGT 5'.</p><p>With palindromes the sequences on the complimentary strands read the same in either direction. For example, a sequence of 5' GAATTC3' on one strand would be complimented by a 3' CTTAAG 5' strand. In either case, when either strand is read from the 5' prime end the sequence is GAATTC. Another example of a palindrome would be the sequence 5' CGAAGC 3' that, when reversed, still reads CGAAGC.</p><p>Palindromes are important sequences within nucleic acids. Often they are the site of binding for specific enzymes (e.g., restriction endobucleases) designed to cut the DNA strands at specific locations (i.e., at palindromes).</p><p>Palindromes may arise from brakeage and chromosomal inversions that form inverted repeats that compliment each other. When a palindrome results from an inversion, it is often referred to as an inverted repeat. For example, the sequence 5' CGAAGC 3', if inverted (reversed 180&deg;), still reads CGAAGC.</p><p>The <a href="http://emboss.open-bio.org/">European Molecular Biology Open Software Suite (EMBOSS)</a> includes some basic tools for finding tandem repeats and inverted repeats (see <a href="http://emboss.open-bio.org/html/use/apbs06.html#GroupsAppsTableNucleicrepeatsR6">B.6.22. Applications in group Nucleic:repeats</a>). There are many on-line services providing the EMBOSS tools, for example:</p><ul>
<li>Wageningen Bioinformatics Webportal <a href="http://emboss.bioinformatics.nl/">EMBOSS explorer</a></li>
<li><a href="http://mobyle.pasteur.fr/">Mobyle@Pasteur</a></li>
<li><a href="http://wsembnet.vital-it.ch/">Soaplab2 Web Services at Vital-IT</a></li>
</ul><p>For more sophisticated repeat finding you will want to look at tools using <a href="http://www.girinst.org/repbase/">Repbase</a> for example:</p><ul>
<li>CENSOR
<ul>
<li><a href="http://www.girinst.org/censor/">CENSOR@GIRI</a></li>
<li><a href="http://www.ebi.ac.uk/Tools/so/censor/">CENSOR@EMBL-EBI</a></li>
</ul>
</li>
<li><a href="http://www.repeatmasker.org/">RepeatMasker</a></li>
<li><a href="http://mummer.sourceforge.net/">MUMmer</a>&nbsp;(scan_for_match)</li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">Emboss Palindrome</a></li>
</ul><p>Other nucleotide repeat finding methods found by a couple of web searches:</p><ul>
<li><a href="http://tandem.bu.edu/trf/trf.html">Tandem Repeats Finder</a></li>
<li><a href="http://selab.janelia.org/recon.html">RECON</a></li>
<li><a href="http://www.yandell-lab.org/software/repeatrunner.html">RepeatRunner</a></li>
<li><a href="http://bibiserv.techfak.uni-bielefeld.de/reputer/">REPuter</a></li>
<li><a href="http://210.212.215.200/IMEX/index.html">Imperfect Microsatellite Extractor (IMEx)</a></li>
<li><a href="http://www.imtech.res.in/raghava/srf/">Spectral Repeat Finder (SRF)</a></li>
<li><a href="http://zlab.bu.edu/repfind/form.html">REPFIND</a></li>
<li><a href="http://crispr.u-psud.fr/Server/CRISPRfinder.php">CRISPRfinder</a></li>
<li><a href="http://grail.lsd.ornl.gov/grailexp/">GrailEXP</a></li>
<li><a href="http://alggen.lsi.upc.edu/recerca/search/frame-search.html">CONREPP</a></li>
<li><a href="http://www.biophp.org/minitools/find_palindromes/demo.php%20"><span>find_palindromes</span></a></li>
<li><a href="http://insilico.ehu.eus/palindromes/"><span>Palindrome</span></a></li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">EMBOSS Palindrome</a></li>
<li><a href="http://bioinfo.cs.technion.ac.il/projects/Engel-Freund/new.html">Palindrome Search</a></li>
</ul>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39821/gvolante-completeness-assessment-of-genometranscriptome-sequences</guid>
	<pubDate>Tue, 06 Aug 2019 21:37:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39821/gvolante-completeness-assessment-of-genometranscriptome-sequences</link>
	<title><![CDATA[gVolante: Completeness Assessment of Genome/Transcriptome Sequences]]></title>
	<description><![CDATA[<p><strong>gVolante</strong><span>&nbsp;provides an online interface for completeness assessment of user&rsquo;s original or publicly available sequence datasets as well as for browsing results of completeness assessment performed on publicly available genome and transcriptome assemblies.</span></p>
<p><img src="https://gvolante.riken.jp/images/assessment.png" width="937" height="545" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://gvolante.riken.jp/" rel="nofollow">https://gvolante.riken.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36994/minimap2-a-versatile-pairwise-aligner-for-genomic-and-spliced-nucleotide-sequences</guid>
	<pubDate>Wed, 20 Jun 2018 07:55:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36994/minimap2-a-versatile-pairwise-aligner-for-genomic-and-spliced-nucleotide-sequences</link>
	<title><![CDATA[minimap2: A versatile pairwise aligner for genomic and spliced nucleotide sequences]]></title>
	<description><![CDATA[git clone https://github.com/lh3/minimap2
cd minimap2 &amp;&amp; make
# long sequences against a reference genome
./minimap2 -a test/MT-human.fa test/MT-orang.fa &gt; test.sam
# create an index first and then map
./minimap2 -d MT-human.mmi test/MT-human.fa
./minimap2 -a MT-human.mmi test/MT-orang.fa &gt; test.sam
# use presets (no test data)
./minimap2 -ax map-pb ref.fa pacbio.fq.gz &gt; aln.sam       # PacBio genomic reads
./minimap2 -ax map-ont ref.fa ont.fq.gz &gt; aln.sam         # Oxford Nanopore genomic reads
./minimap2 -ax sr ref.fa read1.fa read2.fa &gt; aln.sam      # short genomic paired-end reads
./minimap2 -ax splice ref.fa rna-reads.fa &gt; aln.sam       # spliced long reads
./minimap2 -ax splice -k14 -uf ref.fa reads.fa &gt; aln.sam  # Nanopore Direct RNA-seq
./minimap2 -cx asm5 asm1.fa asm2.fa &gt; aln.paf             # intra-species asm-to-asm alignment
./minimap2 -x ava-pb reads.fa reads.fa &gt; overlaps.paf     # PacBio read overlap
./minimap2 -x ava-ont reads.fa reads.fa &gt; overlaps.paf    # Nanopore read overlap
# man page for detailed command line options
man ./minimap2.1<p>Address of the bookmark: <a href="https://github.com/lh3/minimap2" rel="nofollow">https://github.com/lh3/minimap2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38452/silix-implements-an-ultra-efficient-algorithm-for-the-clustering-of-homologous-sequences</guid>
	<pubDate>Wed, 12 Dec 2018 09:22:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38452/silix-implements-an-ultra-efficient-algorithm-for-the-clustering-of-homologous-sequences</link>
	<title><![CDATA[SiLiX: implements an ultra-efficient algorithm for the clustering of homologous sequences]]></title>
	<description><![CDATA[<p>The software package SiLiX implements<strong>&nbsp;an ultra-efficient algorithm for the clustering of homologous sequences</strong>, based on single transitive links (<em>single linkage</em>) with alignment coverage constraints.</p>
<p>SiLiX adopts a graph-theoretical framework to interpret similarity pairs as edges of a network. A very efficient algorithm, based on the&nbsp;<em>Disjoint Sets Data Structure</em>, allows the computation of sequence families with&nbsp;<strong>low time and space requirements</strong>.</p>
<p><strong>A parallel version</strong>&nbsp;of SiLiX, based on MPI, is also available in this package and has been proved to be scalable, so that its allows the study of&nbsp;<strong>very large datasets</strong>.</p>
<p>SiLiX is already included in the analysis pipeline for&nbsp;<a href="http://pbil.univ-lyon1.fr/databases/hogenom/acceuil.php">HOGENOM</a>.</p><p>Address of the bookmark: <a href="http://lbbe.univ-lyon1.fr/SiLiX?lang=fr" rel="nofollow">http://lbbe.univ-lyon1.fr/SiLiX?lang=fr</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>