<?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/29638?offset=1080</link>
	<atom:link href="https://bioinformaticsonline.com/related/29638?offset=1080" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33592/circular-plots-in-r</guid>
	<pubDate>Mon, 19 Jun 2017 06:20:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33592/circular-plots-in-r</link>
	<title><![CDATA[Circular plots in R]]></title>
	<description><![CDATA[<div>
<p><strong>Circular plots</strong>&nbsp;are useful to represent complicated informations. They are used in 2 specific cases: when you have long axis and numerous categories, and when you want to show relationships between elements. The&nbsp;<a href="http://circos.ca/images/samples/" target="_blank">circos gallery</a>&nbsp;displays several examples of circular plots, what gives a nice overview of the possibilities. Circos is the most famous</p>
</div>
<div>
<p>tool to create circular plots. Thanks to&nbsp;<a href="https://www.linkedin.com/in/zuguanggu" target="_blank">Zuguang Gu</a>, the&nbsp;<a href="https://cran.r-project.org/web/packages/circlize/vignettes/circlize.pdf" target="_blank">Circlize library</a>&nbsp;makes the circos functions available in R! It implements low-level graphic functions for adding common graphics in a circular layout. This page aims to learn you how to use the library, so I strongly advise to read the graphics in the proposed order!</p>
<p><img src="http://www.r-graph-gallery.com/wp-content/uploads/2016/03/122_Circlize_package.png" width="480" height="480" alt="image" style="border: 0px;"></p>
</div>
<p>http://www.r-graph-gallery.com/portfolio/circular-plot/</p><p>Address of the bookmark: <a href="http://www.r-graph-gallery.com/portfolio/circular-plot/" rel="nofollow">http://www.r-graph-gallery.com/portfolio/circular-plot/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9039/postdoc-position-in-computational-biology</guid>
  <pubDate>Fri, 14 Mar 2014 01:38:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc Position in Computational Biology]]></title>
  <description><![CDATA[
<p>The Computational Biology Group of Interdisciplinary Center for<br />Clinical Research (IZKF) Aachen, RWTH Aachen University Hospital,<br />Aachen, invites applicants for PhD candidate or postdoctoral position<br />in computational biology in one of the following topics:</p>

<p>1) Statistical machine learning methods for the analysis of medical<br />epigenomics data.</p>

<p>2) Sequence analysis algorithms for detection of RNA-DNA interactions.</p>

<p>Applicants should hold a M.Sc . or PhD in Computer Science or related<br />areas. Experience in the analysis of biological sequences, gene<br />expression and gene regulation is desirable. The candidate should have<br />solid programming skills (C, Python and/or R) and acquaintance with<br />Linux. Experience with high performance computing is a plus. The<br />working language of the group is English.</p>

<p>The position is based on the German TV-L 13 salary scale, including<br />all German social benefits (health insurance and pension scheme). The<br />expected starting date is September 2014. Interested candidates should<br />send a CV, statement of research interests and the names of three<br />references to jobs@costalab.org.</p>

<p>More at http://costalab.org/wp/phd-and-postdoc-position-in-computational-biology/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</guid>
	<pubDate>Thu, 23 Nov 2017 10:24:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</link>
	<title><![CDATA[IONiseR:  tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer]]></title>
	<description><![CDATA[<p>This package is intended to provide tools for the quality assessment of data produced by Oxford Nanopore&rsquo;s MinION sequencer. It includes a functions to generate a number plots for examining the statistics that we think will be useful for this task.</p>
<p>However, nanopore sequencing is an emerging and rapidly developing technology. It is not clear what will be most informative. We hope that&nbsp;<code>IONiseR</code>&nbsp;will provide a framework for visualisation of metrics that we haven&rsquo;t thought of, and welcome feedback at&nbsp;<a href="mailto:mike.smith@embl.de" target="_blank">mike.smith@embl.de</a>.</p>
<p>If you&rsquo;re not interested in the quality assement of the raw or event level data, and want to jump straight to the getting FASTQ format files from fast5 files you can go straight to the final section of this document.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/9207/biogeek-fun</guid>
	<pubDate>Sun, 16 Mar 2014 06:33:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/9207/biogeek-fun</link>
	<title><![CDATA[BioGeek Fun]]></title>
	<description><![CDATA[<p>1. A futuristic computational biology student was told to write "It is in my gene!!!" on the board 100 times as a punishment. here's his response -<br /><br />use warnings;<br />for ($count=1; $count &lt;=100; $count++) { print "It is in my gene!!!";}<br /><br />I guess, he is gonna to be a real biogeek. Nice try though. Smart kid.</p><p>&nbsp;</p><p>2. In some perl script I found this <br />&nbsp;. . . . . .<br />&nbsp;. . . . . .<br /># It works for me, only God understood how it is working<br />while (/(&lt;\/[^&gt;]+&gt;)|(&lt;[^&gt;]+&gt;)|(&lt;[^&gt;]+&gt;)$|([^&gt;&lt;]+)/go) {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; $startGene=$1;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; $beginChromosome=$2;<br />&nbsp;&nbsp; &nbsp;<br />. . . . . .<br />&nbsp;.. . . . . .<br />}</p><p>&nbsp;</p><p>3. One more interesting message in Perl found &hellip;. It will must tickle you bone :) <br />open(my $fh, "&lt;", "gene.txt")&nbsp;&nbsp; &nbsp;or kill " Me if you think this is a mistake :$!";<br /><br /></p><p>&nbsp;</p><p>4. From the Perl <br /><br />&nbsp; while () {&nbsp; # "The Mothership Connection is here!"<br />&nbsp;&nbsp; &nbsp;print &ldquo;$_\n&rdquo;; # Printing the offspring :)</p><p>&nbsp;</p><p>5. Perl message<br />if ($1) { print &ldquo;Just found a the error in chromosome !!!, yahoo&hellip;&rdquo;; else { &ldquo;That is not error, but mutation you moron!&rdquo;;</p><p>&nbsp;</p><p>6. One genome database curator walk in wine bar asked the bartender:<br />CREATE TABLE gene IF NOT EXISTS SexOnTheBeach;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/researchlabs/view/9327/jarvis%E2%80%99-laboratory</guid>
  <pubDate>Tue, 18 Mar 2014 18:53:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Jarvis’ laboratory]]></title>
  <description><![CDATA[
<p>Dr. Jarvis’ laboratory studies the neurobiology of vocal communication. We want to know how the brain generates, perceives, and learns behavior. We use vocal communication as a model behavior. Emphasis is placed on the molecular pathways involved in the perception and production of learned vocalizations. We use an integrative approach that combines behavioral, anatomical, electrophysiological, and molecular biological techniques. The main animal model used is songbirds, one of the few vertebrate groups that evolved the ability to learn vocalizations. The overall goal of the research is to advance knowledge of the neural mechanisms for vocal learning and basic mechanisms of brain function.</p>

<p>Lab page: http://jarvislab.net/</p>
]]></description>
</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/opportunity/view/9518/professor-and-associate-professors-pb-iv-assistant-professors-pb-iii-job-at-iiit-allahabad</guid>
  <pubDate>Mon, 31 Mar 2014 08:09:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Professor and Associate Professors (PB-IV) Assistant Professors (PB-III) Job at IIIT, Allahabad]]></title>
  <description><![CDATA[
<p>Indian Institute of Information Technology, Allahabad <br />Devghat, Jhalwa, Allahabad – 211012, Uttar Pradesh, India <br />E-mail: contact@iiita.ac.in, faculty.applications@iiita.ac.in <br />Web: www.iiita.ac.in Phone : 0532-2922031/27/67 </p>

<p>Applications are invited on prescribed format along with self attested copies of the certificates for Faculty Positions in the following areas:  <br />Sciences – Systems Biology, Computer Aided Drug Designing, Statistics, Applied Mathematics, Applied Physics. BioMedical Engineering – BioMechanics, BioMedical Instrumentation.  </p>

<p> Last Date : May 10, 2014 </p>

<p>Details are available on our website : http://www.iiita.ac.in</p>

<p>http://www.iiita.ac.in/downloads/announcements/uploads/FACULTY_Advertisement_NO-FS-01_2014130.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</guid>
	<pubDate>Sun, 09 Dec 2018 19:06:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</link>
	<title><![CDATA[DECIPHER; a software toolset for deciphering and managing biological sequences efficiently using the R]]></title>
	<description><![CDATA[<p><span>DECIPHER is a software toolset that can be used for deciphering and managing biological sequences efficiently using the&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;programming language. The&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;package is distributed as platform independent source code under the&nbsp;</span><a href="http://www.gnu.org/copyleft/gpl.html">GPL version 3 license</a><span>. Some functionality of the program is accessible online through web tools.</span></p>
<p><span style="font-size: medium; text-align: justify;">&nbsp;</span></p><p>Address of the bookmark: <a href="http://www2.decipher.codes/" rel="nofollow">http://www2.decipher.codes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9639/find-certain-filesdocuments-in-linux-os</guid>
	<pubDate>Sun, 06 Apr 2014 23:56:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9639/find-certain-filesdocuments-in-linux-os</link>
	<title><![CDATA[Find certain files/documents in Linux OS]]></title>
	<description><![CDATA[<p>As bioinformatician I know the fact that we usually handle the large dataset and lost in the huge numbers of files and folders. In order to search the missing file a strong search command is required. The Linux Find Command is one of the most important and much used command in Linux sytems. Find command used to search and locate list of files and directories based on conditions you specify for files that match the arguments. Find can be used in variety of conditions like you can find files by permissions, users, groups, file type, date, size and other possible criteria.<br /><br />Through this article we are sharing our day-to-day Linux find command experience and its usage in the form of examples. In this article we will show you the most used 35 Find Commands examples in Linux. We have divided the section into Five parts from basic to advance usage of find command.</p><p><strong>Part I &ndash; Basic Find Commands for Finding Files with Names</strong><br />1. Find Files Using Name in Current Directory<br /><br />Find all the files whose name is gene.txt in a current working directory.<br /><br /># find . -name gene.txt<br /><br />./gene.txt<br /><br />2. Find Files Under Home Directory<br /><br />Find all the files under /home directory with name gene.txt.<br /><br /># find /home -name gene.txt<br /><br />/home/gene.txt<br /><br />3. Find Files Using Name and Ignoring Case<br /><br />Find all the files whose name is gene.txt and contains both capital and small letters in /home directory.<br /><br /># find /home -iname gene.txt<br /><br />./gene.txt<br />./Gene.txt<br /><br />4. Find Directories Using Name<br /><br />Find all directories whose name is Gene in / directory.<br /><br /># find / -type d -name Gene<br /><br />/Gene<br /><br />5. Find fasta Files Using Name<br /><br />Find all php files whose name is gene.fasta in a current working directory.<br /><br /># find . -type f -name gene.fasta<br /><br />./gene.fasta<br /><br />6. Find all PHP Files in Directory<br /><br />Find all fasta files in a directory.<br /><br /># find . -type f -name "*.fasta"<br /><br />./gene.fasta<br />./cancer.fasta<br />./allgene.fasta<br /><br /><strong>Part II &ndash; Find Files Based on their Permissions</strong><br />7. Find Files With 777 Permissions<br /><br />Find all the files whose permissions are 777.<br /><br /># find . -type f -perm 0777 -print<br /><br />8. Find Files Without 777 Permissions<br /><br />Find all the files without permission 777.<br /><br /># find / -type f ! -perm 777<br /><br />9. Find SGID Files with 644 Permissions<br /><br />Find all the SGID bit files whose permissions set to 644.<br /><br /># find / -perm 2644<br /><br />10. Find Sticky Bit Files with 551 Permissions<br /><br />Find all the Sticky Bit set files whose permission are 551.<br /><br /># find / -perm 1551<br /><br />11. Find SUID Files<br /><br />Find all SUID set files.<br /><br /># find / -perm /u=s<br /><br />12. Find SGID Files<br /><br />Find all SGID set files.<br /><br /># find / -perm /g+s<br /><br />13. Find Read Only Files<br /><br />Find all Read Only files.<br /><br /># find / -perm /u=r<br /><br />14. Find Executable Files<br /><br />Find all Executable files.<br /><br /># find / -perm /a=x<br /><br />15. Find Files with 777 Permissions and Chmod to 644<br /><br />Find all 777 permission files and use chmod command to set permissions to 644.<br /><br /># find / -type f -perm 0777 -print -exec chmod 644 {} \;<br /><br />16. Find Directories with 777 Permissions and Chmod to 755<br /><br />Find all 777 permission directories and use chmod command to set permissions to 755.<br /><br /># find / -type d -perm 777 -print -exec chmod 755 {} \;<br /><br />17. Find and remove single File<br /><br />To find a single file called gene.txt and remove it.<br /><br /># find . -type f -name "gene.txt" -exec rm -f {} \;<br /><br />18. Find and remove Multiple File<br /><br />To find and remove multiple files such as .fa or .gb, then use.<br /><br /># find . -type f -name "*.fa" -exec rm -f {} \;<br /><br />OR<br /><br /># find . -type f -name "*.gb" -exec rm -f {} \;<br /><br />19. Find all Empty Files<br /><br />To file all empty files under certain path.<br /><br /># find /tmp -type f -empty<br /><br />20. Find all Empty Directories<br /><br />To file all empty directories under certain path.<br /><br /># find /tmp -type d -empty<br /><br />21. File all Hidden Files<br /><br />To find all hidden files, use below command.<br /><br /># find /tmp -type f -name ".*"<br /><br /><strong>Part III &ndash; Search Files Based On Owners and Groups</strong><br />22. Find Single File Based on User<br /><br />To find all or single file called gene.txt under / root directory of owner root.<br /><br /># find / -user root -name gene.txt<br /><br />23. Find all Files Based on User<br /><br />To find all files that belongs to user Rahul under /home directory.<br /><br /># find /home -user rahul<br /><br />24. Find all Files Based on Group<br /><br />To find all files that belongs to group Developer under /home directory.<br /><br /># find /home -group developer<br /><br />25. Find Particular Files of User<br /><br />To find all .txt files of user Rahul under /home directory.<br /><br /># find /home -user rahul -iname "*.txt"<br /><br /><strong>Part IV &ndash; Find Files and Directories Based on Date and Time</strong><br />26. Find Last 50 Days Modified Files<br /><br />To find all the files which are modified 50 days back.<br /><br /># find / -mtime 50<br /><br />27. Find Last 50 Days Accessed Files<br /><br />To find all the files which are accessed 50 days back.<br /><br /># find / -atime 50<br /><br />28. Find Last 50-100 Days Modified Files<br /><br />To find all the files which are modified more than 50 days back and less than 100 days.<br /><br /># find / -mtime +50 &ndash;mtime -100<br /><br />29. Find Changed Files in Last 1 Hour<br /><br />To find all the files which are changed in last 1 hour.<br /><br /># find / -cmin -60<br /><br />30. Find Modified Files in Last 1 Hour<br /><br />To find all the files which are modified in last 1 hour.<br /><br /># find / -mmin -60<br /><br />31. Find Accessed Files in Last 1 Hour<br /><br />To find all the files which are accessed in last 1 hour.<br /><br /># find / -amin -60<br /><br /><strong>Part V &ndash; Find Files and Directories Based on Size</strong><br />32. Find 50MB Files<br /><br />To find all 50MB files, use.<br /><br /># find / -size 50M<br /><br />33. Find Size between 50MB &ndash; 100MB<br /><br />To find all the files which are greater than 50MB and less than 100MB.<br /><br /># find / -size +50M -size -100M<br /><br />34. Find and Delete 100MB Files<br /><br />To find all 100MB files and delete them using one single command.<br /><br /># find / -size +100M -exec rm -rf {} \;<br /><br />35. Find Specific Files and Delete<br /><br />Find all .gb files with more than 10MB and delete them using one single command.<br /><br /># find / -type f -name *.gb -size +10M -exec rm {} \;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>