<?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/26303?offset=1550</link>
	<atom:link href="https://bioinformaticsonline.com/related/26303?offset=1550" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32048/json</guid>
	<pubDate>Tue, 04 Apr 2017 08:02:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32048/json</link>
	<title><![CDATA[JSON]]></title>
	<description><![CDATA[<p><strong>JSON</strong>&nbsp;(JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the&nbsp;<a href="http://javascript.crockford.com/">JavaScript Programming Language</a>,&nbsp;<a href="http://www.ecma-international.org/publications/files/ecma-st/ECMA-262.pdf">Standard ECMA-262 3rd Edition - December 1999</a>. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.</p>
<p>JSON is built on two structures:</p>
<ul>
<li>A collection of name/value pairs. In various languages, this is realized as an&nbsp;<em>object</em>, record, struct, dictionary, hash table, keyed list, or associative array.</li>
<li>An ordered list of values. In most languages, this is realized as an&nbsp;<em>array</em>, vector, list, or sequence.</li>
</ul>
<p>These are universal data structures. Virtually all modern programming languages support them in one form or another. It makes sense that a data format that is interchangeable with programming languages also be based on these structures.</p><p>Address of the bookmark: <a href="http://json.org/" rel="nofollow">http://json.org/</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/opportunity/view/32374/ra-bioinformatics-at-jnu-new-delhi-india</guid>
  <pubDate>Thu, 27 Apr 2017 03:29:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at JNU, New Delhi, INDIA]]></title>
  <description><![CDATA[
<p>School of Computational &amp; Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi-110067, INDIA</p>

<p>Date: April 24th. 2017	Last Date: May 6th 2017<br />PROJECT ID: 632</p>

<p>The following posts are urgently required to be filled for the Department of Biotechnology, Government of India funded project jointly running with IIIT-Hyderabad &amp; JNU, entitled "Computational Core for Plant Metabolomics" administrated by Prof Indira Ghosh, School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi-110 067.<br />NB: For all the posts, preference will be given to candidates with a good knowledge of Python and/or R in UNIX platform , knowledge of JAVA will also get a special consideration.</p>

<p>1.	RA / Research Associate (Metabolic engineering/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA</p>

<p>Vacancy: 1</p>

<p>Essential Qualifications: PhD in Bioinformatics /Mathematics/Computer Science with experience in analyzing high throughput omics-based data/Analysis of Network Biology/Chemoinformatics/Computational Biology related Software development. Published paper in the field is a must to prove the experience. Special consideration will be given if have experience in Industry, teaching &amp; product development.</p>

<p>Desired Skills: Prior experience in handling and guiding bioinformatics, metabolomics data, planning of new research area in metabolic driven network , collaborating with industry , preparing and filing reports etc. Will be expected to communicate with user groups and coordinate with LIMS group in Hyderabad and the Cheminformatics group in Delhi.</p>

<p>2.	Project SRF (Network model building/Systems biology integration)</p>

<p>Salary*: Rs.18000/- + HRA</p>

<p>Vacancy: 1</p>

<p>Essential Qualifications: M.Tech in Computational Biology with project experience or Masters / B.Tech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Mathematical Model building using Computational Biology tools &amp; related Database / Network analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal whereas for M.Tech, the degree obtained in computational biology is a must.</p>

<p>Desired Skills: Will be expected to manage ongoing research activities in LIMS, interact with LIMS group, build network model using data compiled by experimentalist, prepare and file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</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/32631/barrnap-bacterial-ribosomal-rna-predictor</guid>
	<pubDate>Fri, 12 May 2017 09:24:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32631/barrnap-bacterial-ribosomal-rna-predictor</link>
	<title><![CDATA[Barrnap: Bacterial ribosomal RNA predictor]]></title>
	<description><![CDATA[<p>Barrnap predicts the location of ribosomal RNA genes in genomes. It supports bacteria (5S,23S,16S), archaea (5S,5.8S,23S,16S), mitochondria (12S,16S) and eukaryotes (5S,5.8S,28S,18S).</p>
<p>It takes FASTA DNA sequence as input, and write GFF3 as output. It uses the new NHMMER tool that comes with HMMER 3.1 for HMM searching in RNA:DNA style. NHMMER binaries for 64-bit Linux and Mac OS X are included and will be auto-detected. Multithreading is supported and one can expect roughly linear speed-ups with more CPUs.&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/tseemann/barrnap" rel="nofollow">https://github.com/tseemann/barrnap</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</guid>
	<pubDate>Mon, 22 May 2017 05:43:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</link>
	<title><![CDATA[BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly]]></title>
	<description><![CDATA[<p>This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at&nbsp;<a href="mailto:kklam@eecs.berkeley.edu">kklam@eecs.berkeley.edu</a>. My name is Ka-Kit Lam.</p>
<p>https://github.com/kakitone/MetaFinisherSC</p>
<p>https://github.com/kakitone/BIGMAC</p><p>Address of the bookmark: <a href="https://github.com/kakitone/BIGMAC" rel="nofollow">https://github.com/kakitone/BIGMAC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34814/bioinformatics-web-application-development-with-perl</guid>
	<pubDate>Tue, 26 Dec 2017 18:14:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34814/bioinformatics-web-application-development-with-perl</link>
	<title><![CDATA[Bioinformatics Web Application Development with Perl]]></title>
	<description><![CDATA[<div><p>Perl's second wave of adoption came from the growth of the world wide web. Dynamic web pages&mdash;the precursor to modern web applications&mdash;were easy to create with Perl and CGI. Thanks to Perl's ubiquity as a language for system administrators and its power to manipulate text, it was the default choice for web programming. Its presence everywhere made it popular and, in some ways, the duct tape of the Internet.</p><h4>Web Application Development</h4><p>The old days of CGI programs and the simple development style that represented seem clunky. Web pages have become web applications. Development has moved from generating static HTML to both client and server side programming, with rich client interfaces and powerful backends.</p><p>Perl is still well suited for developing modern web apps. The language grows more powerful and easier to use every year, the available libraries are wonderful and keep getting better, and the inventions and discoveries available in modern Perl are unsurpassed.</p><p>In particular, a modern Perl developer can do amazing things with modern Perl tools. If you still think of Perl web development as a&nbsp;<em>cgi-bin</em>&nbsp;directory full of messy scripts that spew warnings to STDERR, you're a decade out of date. Better yet, you can replace that mess piecemeal, thanks to the new tools and techniques of modern Perl. See, for example, the ever-growing list of technologies&nbsp;<a href="http://www.builtinperl.com/">Built in Perl</a>.</p><h4>Modern Perl Web Frameworks</h4><p>While the old wave of web development may have made the CGI.pm module central, modern Perl web programming follows a stricter separation of business logic, URL and request routing, and output. The days of slinging a string here, an array there, a Perl hash yonder, declaring every variable at the top of the program, and maybe making a subroutine are gone. The Perl world has seen the value of abstraction and ways to mechanize away boilerplate. Perl has dozens of frameworks and toolkits designed to make web development and deployment simpler.</p><p>Any of a dozen of these frameworks will help you do great things, but three in particular stand out. You can build web sites and web applications of tremendous value with all three. These are neither the only good possibilities (think of POE or Jifty or Continuity or...) nor the only mechanisms for web programming with Perl (see Mechanize or LWP or Mojo::UserAgent for more). Yet if you want three good options to choose between, start here.</p><h4>Catalyst</h4><p>The&nbsp;<a href="http://catalystframework.org/">Catalyst</a>&nbsp;framework is a flexible and powerful system for building small to large web apps. It uses the&nbsp;<a href="http://moose.perl.org/">Moose</a>&nbsp;object system to provide great APIs for extension and further development. It's the most mature of the modern top Perl web frameworks, yet it retains its flexibility and vibrancy. In particular, its plugin and extension ecosystem allows it to evolve to provide new and essential features.</p><p>Catalyst has embraced the Plack/PSGI standard for Perl web deployment and recent versions are exploring high-scalability, event-based request handling models.</p><h4>Dancer</h4><p>The&nbsp;<a href="http://perldancer.org/">Dancer</a>&nbsp;framework is deliberately minimal in syntax and scope, but it also has a vibrant plugin ecosystem. Dancer particularly excels for smaller sites and applications, though good programmers can build larger things with it.</p><p>The first version of Dancer was easy to use. Dancer 2 continues that ease while improving the internals and robustness of applications.</p><h4>Mojolicious</h4><p>The&nbsp;<a href="http://mojolicio.us/">Mojolicious</a>&nbsp;(Mojo) framework has a real-time design based on high performance event handling. Its focus is solving new and interesting problems in simple and effective ways, and the project has produced a lot of new code that does old things in better ways.</p><p>In particular, Mojolicious goes to great lengths to support new web standards, such as CSS 3, web sockets, and HTTP 2.</p><p>Where Catalyst embraces the CPAN fully, Mojolicious by design provides most of what an average app might need in a single download. It's still fully compatible with the CPAN, but the intention is to provide good working defaults in a package that's easy to start with. Mojo's fans are quick to praise it as fun to develop.</p><p>A modern Perl web developer should be familiar with at least one of these frameworks.</p><h4>Modern Perl Storage Mechanisms</h4><p>Perl's venerable&nbsp;<a href="http://search.cpan.org/perldoc?DBI">DBI</a>&nbsp;module has been the focal point of database access since its invention. Its design allows it to provide the same interface to huge relational databases and flat files alike through its DBD extension mechanism. Yet the DBI by itself isn't the be-all, end-all of data storage and access in Perl.</p><h4>DBIx::Class</h4><p><a href="http://search.cpan.org/perldoc?DBIx::Class">DBIx::Class</a>&nbsp;sits on top of DBI to provide an API to your database based on the concept of queries and results. This is often sufficient to remove all but the most complicated of SQL from your code, leaving you to manipulate your business models instead of the small details of how a relational database works. The power and maintainability you receive is well the small cost of the learning curve.</p><p>Even better, DBIC can manage (and even generate) your database schema for you.</p><p>Recent versions of DBIC have demonstrated that a well-written ORM can perform much better than even clever hand-written code. Because it builds on the Perl DBI, it scales everywhere from SQLite to PostgreSQL, MySQL, Oracle, and more.</p><h3>Rose::DB</h3><p>The lesser-known but no less powerful&nbsp;<a href="http://search.cpan.org/perldoc?Rose::DB::Object">Rose::DB::Object</a>&nbsp;builds on&nbsp;<a href="http://search.cpan.org/perldoc?Rose::DB">Rose::DB</a>&nbsp;to provide an object-relational mapper for Perl. While its high level features most directly compare to those of DBIx::Class, it's often measurably faster.</p><h4>NoSQL on the CPAN</h4><p>Of course the&nbsp;<a href="http://search.cpan.org/">CPAN</a>&nbsp;has modules for almost any NoSQL database or job queue or persistence mechanism you could name, and several you have never heard of. Everything you need is a quick CPAN or cpanm away!</p><h4>Modern Perl Deployment Strategies</h4><p>In the early days of the web, deploying a Perl web application meant putting one or more&nbsp;<em>.cgi</em>&nbsp;or&nbsp;<em>.pl</em>&nbsp;files in a special directory and hoping that your system administrator had everything configured correctly. The execution model was often slow and cumbersome, and accessing shared resources such as databases was often tricky.</p><p>Modern Perl has better choices. While deployment strategies are the source of many arguments, the return on your investment from learning the modern way is impressive.</p><h4>Plack/PSGI</h4><p>The PSGI specification (as exemplified by&nbsp;<a href="http://plackperl.org/">Plack</a>) describes a strategy for building Perl web apps independent of server and with the possibility to share custom processing behaviors.</p><p>In other words, it's a standard for writing Perl apps to take advantage of the huge ecosystem of Perl development available on the CPAN without tying yourself to a server like Apache, Apache 2, nginx, or anything else.</p><p>Any good modern Perl web framework (including those listed here) supports PSGI. Several deployment mechanisms exist to meet various business needs which also support PSGI. In particular, you can deploy the same application with a local testing server on your own machine as you can to your production server or servers without changing your application at all.</p><h4>mod_perl</h4><p>The older but still viable mod_perl Apache httpd module embeds Perl into the web server. This was the first widespread persistence mechanism for Perl web applications themselves and it's still popular to this day, though PSGI compliance is often the choice for new development. (PSGI handlers to use mod_perl as the backend are available.)</p><p>Modern Perl developers should familiarize themselves with PSGI and the wealth of available Plack middleware.</p><h4>Perl Web Development</h4><p>Of course no discussion of Perl web development would be complete without mentioning the strength of the CPAN. Almost any project will benefit from the wealth of freely available libraries built to solve real problems. These distributions run the gamut from full-blown web frameworks and content management systems to APIs for web services, development tools, testing systems, and interfaces to document formats and external resources.</p><p>For example, if you need to write a web service which accepts JSON data and produces Excel spreadsheets, you can glue together a few CPAN distributions and get the job done early. If you need to consume XML from a remote service and emit a PDF, you're in luck.</p><p>Perl's prowess as a general purpose programming language as well as its flexibility and power in managing text and gluing systems together make it a wonderful fit for web development. The community's adoption of modern Perl standards such as PSGI and Plack only enhance your power.</p><p>Web application development in Perl is still viable, and modern Perl tools and techniques and libraries make it more powerful and pleasant than ever.</p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35525/linux-commands-cheat-sheet-for-bioinformatics-and-computational-biology-professionals</guid>
	<pubDate>Mon, 05 Feb 2018 18:50:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35525/linux-commands-cheat-sheet-for-bioinformatics-and-computational-biology-professionals</link>
	<title><![CDATA[Linux Commands Cheat Sheet for Bioinformatics and Computational Biology Professionals]]></title>
	<description><![CDATA[<p><span>The purpose of this cheat sheet is to introduce biologist and bioinformatician to the frequently used tools for NGS analysis as well as giving experience in writing one-liners.</span></p><ul>
<li><span></span><span><strong>File System</strong></span><span><strong><br /> </strong></span><span>ls</span><span>&nbsp;&mdash; list items in current directory</span><span><br /> </span><span>ls -l</span><span>&nbsp;&mdash; list items in current directory and show in long format to see perimissions, size, and modification date</span><span><br /> </span><span>ls -a</span><span>&nbsp;&mdash; list all items in current directory, including hidden files</span><span><br /> </span><span>ls -F</span><span>&nbsp;&mdash; list all items in current directory and show directories with a slash and executables with a star</span><span><br /> </span><span>ls dir</span><span>&nbsp;&mdash; list all items in directory dir</span><span><br /> </span><span>cd dir</span><span>&nbsp;&mdash; change directory to dir</span><span><br /> </span><span>cd ..</span><span>&nbsp;&mdash; go up one directory</span><span><br /> </span><span>cd /</span><span>&nbsp;&mdash; go to the root directory</span><span><br /> </span><span>cd ~</span><span>&nbsp;&mdash; go to to your home directory</span><span><br /> </span><span>cd -</span><span>&nbsp;&mdash; go to the last directory you were just in</span><span><br /> </span><span>pwd</span><span>&nbsp;&mdash; show present working directory</span><span><br /> </span><span>mkdir dir</span><span>&nbsp;&mdash; make directory dir</span><span><br /> </span><span>rm file</span><span>&nbsp;&mdash; remove file</span><span><br /> </span><span>rm -r dir</span><span>&nbsp;&mdash; remove directory dir recursively</span><span><br /> </span><span>cp file1 file2</span><span>&nbsp;&mdash; copy file1 to file2</span><span><br /> </span><span>cp -r dir1 dir2</span><span>&nbsp;&mdash; copy directory dir1 to dir2 recursively</span><span><br /> </span><span>mv file1 file2</span><span>&nbsp;&mdash; move (rename) file1 to file2</span><span><br /> </span><span>ln -s file link</span><span>&nbsp;&mdash; create symbolic link to file</span><span><br /> </span><span>touch file</span><span>&nbsp;&mdash; create or update file</span><span><br /> </span><span>cat file</span><span>&nbsp;&mdash; output the contents of file</span><span><br /> </span><span>less file</span><span>&nbsp;&mdash; view file with page navigation</span><span><br /> </span><span>head file</span><span>&nbsp;&mdash; output the first 10 lines of file</span><span><br /> </span><span>tail file</span><span>&nbsp;&mdash; output the last 10 lines of file</span><span><br /> </span><span>tail -f file</span><span>&nbsp;&mdash; output the contents of file as it grows, starting with the last 10 lines</span><span><br /> </span><span>vim file</span><span>&nbsp;&mdash; edit file</span><span><br /> </span><span>alias name 'command'</span><span>&nbsp;&mdash; create an alias for a command</span><span><br /> </span></li>
<li><span></span><span><strong>System</strong></span><span><strong><br /> </strong></span><span>shutdown</span><span>&nbsp;&mdash; shut down machine</span><span><br /> </span><span>reboot</span><span>&nbsp;&mdash; restart machine</span><span><br /> </span><span>date</span><span>&nbsp;&mdash; show the current date and time</span><span><br /> </span><span>whoami</span><span>&nbsp;&mdash; who you are logged in as</span><span><br /> </span><span>finger user</span><span>&nbsp;&mdash; display information about user</span><span><br /> </span><span>man command</span><span>&nbsp;&mdash; show the manual for command</span><span><br /> </span><span>df</span><span>&nbsp;&mdash; show disk usage</span><span><br /> </span><span>du</span><span>&nbsp;&mdash; show directory space usage</span><span><br /> </span><span>free</span><span>&nbsp;&mdash; show memory and swap usage</span><span><br /> </span><span>whereis app</span><span>&nbsp;&mdash; show possible locations of app</span><span><br /> </span><span>which app</span><span>&nbsp;&mdash; show which app will be run by default</span><span><br /> </span></li>
<li><span></span><span><strong>Process Management</strong></span><span><strong><br /> </strong></span><span>ps</span><span>&nbsp;&mdash; display your currently active processes</span><span><br /> </span><span>top</span><span>&nbsp;&mdash; display all running processes</span><span><br /> </span><span>kill pid</span><span>&nbsp;&mdash; kill process id pid</span><span><br /> </span><span>kill -9 pid</span><span>&nbsp;&mdash; force kill process id pid</span><span><br /> </span></li>
<li><span></span><span><strong>Permissions</strong></span><span><strong><br /> </strong></span><span>ls -l</span><span>&nbsp;&mdash; list items in current directory and show permissions</span><span><br /> </span><span>chmod ugo file</span><span>&nbsp;&mdash; change permissions of file to ugo - u is the user's permissions, g is the group's permissions, and o is everyone else's permissions. The values of u, g, and o can be any number between 0 and 7.</span><span><br /> </span><span>7</span><span>&nbsp;&mdash; full permissions</span><span><br /> </span><span>6</span><span>&nbsp;&mdash; read and write only</span><span><br /> </span><span>5</span><span>&nbsp;&mdash; read and execute only</span><span><br /> </span><span>4</span><span>&nbsp;&mdash; read only</span><span><br /> </span><span>3</span><span>&nbsp;&mdash; write and execute only</span><span><br /> </span><span>2</span><span>&nbsp;&mdash; write only</span><span><br /> </span><span>1</span><span>&nbsp;&mdash; execute only</span><span><br /> </span><span>0</span><span>&nbsp;&mdash; no permissions</span><span><br /> </span><span>chmod 600 file</span><span>&nbsp;&mdash; you can read and write - good for files</span><span><br /> </span><span>chmod 700 file</span><span>&nbsp;&mdash; you can read, write, and execute - good for scripts</span><span><br /> </span><span>chmod 644 file</span><span>&nbsp;&mdash; you can read and write, and everyone else can only read - good for web pages</span><span><br /> </span><span>chmod 755 file</span><span>&nbsp;&mdash; you can read, write, and execute, and everyone else can read and execute - good for programs that you want to share</span><span><br /> </span></li>
<li><span></span><span><strong>Networking</strong></span><span><strong><br /> </strong></span><span>wget file</span><span>&nbsp;&mdash; download a file</span><span><br /> </span><span>curl file</span><span>&nbsp;&mdash; download a file</span><span><br /> </span><span>scp user@host:file dir</span><span>&nbsp;&mdash; secure copy a file from remote server to the dir directory on your machine</span><span><br /> </span><span>scp file user@host:dir</span><span>&nbsp;&mdash; secure copy a file from your machine to the dir directory on a remote server</span><span><br /> </span><span>scp -r user@host:dir dir</span><span>&nbsp;&mdash; secure copy the directory dir from remote server to the directory dir on your machine</span><span><br /> </span><span>ssh user@host</span><span>&nbsp;&mdash; connect to host as user</span><span><br /> </span><span>ssh -p port user@host</span><span>&nbsp;&mdash; connect to host on port as user</span><span><br /> </span><span>ssh-copy-id user@host</span><span>&nbsp;&mdash; add your key to host for user to enable a keyed or passwordless login</span><span><br /> </span><span>ping host</span><span>&nbsp;&mdash; ping host and output results</span><span><br /> </span><span>whois domain</span><span>&nbsp;&mdash; get information for domain</span><span><br /> </span><span>dig domain</span><span>&nbsp;&mdash; get DNS information for domain</span><span><br /> </span><span>dig -x host</span><span>&nbsp;&mdash; reverse lookup host</span><span><br /> </span><span>lsof -i tcp:1337</span><span>&nbsp;&mdash; list all processes running on port 1337</span><span><br /> </span></li>
<li><span></span><span><strong>Searching</strong></span><span><strong><br /> </strong></span><span>grep pattern files</span><span>&nbsp;&mdash; search for pattern in files</span><span><br /> </span><span>grep -r pattern dir</span><span>&nbsp;&mdash; search recursively for pattern in dir</span><span><br /> </span><span>grep -rn pattern dir</span><span>&nbsp;&mdash; search recursively for pattern in dir and show the line number found</span><span><br /> </span><span>grep -r pattern dir --include='*.ext</span><span>&nbsp;&mdash; search recursively for pattern in dir and only search in files with .ext extension</span><span><br /> </span><span>command | grep pattern</span><span>&nbsp;&mdash; search for pattern in the output of command</span><span><br /> </span><span>find file</span><span>&nbsp;&mdash; find all instances of file in real system</span><span><br /> </span><span>locate file</span><span>&nbsp;&mdash; find all instances of file using indexed database built from the updatedb command. Much faster than find</span><span><br /> </span><span>sed -i 's/day/night/g' file</span><span>&nbsp;&mdash; find all occurrences of day in a file and replace them with night - s means substitude and g means global - sed also supports regular expressions</span><span><br /> </span></li>
<li><span></span><span><strong>Compression</strong></span><span><strong><br /> </strong></span><span>tar cf file.tar files</span><span>&nbsp;&mdash; create a tar named file.tar containing files</span><span><br /> </span><span>tar xf file.tar</span><span>&nbsp;&mdash; extract the files from file.tar</span><span><br /> </span><span>tar czf file.tar.gz files</span><span>&nbsp;&mdash; create a tar with Gzip compression</span><span><br /> </span><span>tar xzf file.tar.gz</span><span>&nbsp;&mdash; extract a tar using Gzip</span><span><br /> </span><span>gzip file</span><span>&nbsp;&mdash; compresses file and renames it to file.gz</span><span><br /> </span><span>gzip -d file.gz</span><span>&nbsp;&mdash; decompresses file.gz back to file</span><span><br /> </span></li>
<li><span></span><span><strong>Shortcuts</strong></span><span><strong><br /> </strong></span><span>ctrl+a</span><span>&nbsp;&mdash; move cursor to beginning of line</span><span><br /> </span><span>ctrl+f</span><span>&nbsp;&mdash; move cursor to end of line</span><span><br /> </span><span>alt+f</span><span>&nbsp;&mdash; move cursor forward 1 word</span><span><br /> </span><span>alt+b</span><span>&nbsp;&mdash; move cursor backward 1 word</span><span><br /> </span></li>
<li></li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35983/some-useful-bioinformatics-links</guid>
	<pubDate>Fri, 16 Mar 2018 20:50:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35983/some-useful-bioinformatics-links</link>
	<title><![CDATA[Some useful Bioinformatics links]]></title>
	<description><![CDATA[<p><br /> Reference-free prediction of rearrangement breakpoint reads | Bioinformatics | Oxford Academic</p><p>https://academic.oup.com/bioinformatics/article/30/18/2559/2475628<br /> Reference-free SNP detection: dealing with the data deluge</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4083407/<br /> GATB/DiscoSnp: DiscoSnp is designed for discovering all kinds of SNPs (not only isolated ones), as well as insertions and deletions, from raw set(s) of reads.</p><p>https://github.com/GATB/DiscoSnp<br /> De novo assembly | Oxford Nanopore Technologies</p><p>https://nanoporetech.com/taxonomy/term/131<br /> De novo long-read assembly of a complex animal genome | bioRxiv</p><p>https://www.biorxiv.org/content/early/2017/09/10/187054<br /> Rapid de novo assembly of the European eel genome from nanopore sequencing reads | Scientific Reports</p><p>https://www.nature.com/articles/s41598-017-07650-6.epdf?author_access_token=dktG7e98wyRJnaEEMTcPqtRgN0jAjWel9jnR3ZoTv0P7E7t-wVGo30iojNO7dICajNY_7PE5xVPv6OoLe7hn9TeUjcZ5umREOzNoPMWkfYH58RS6uxm3vm4e4BG2AA_WKW84i6egKK271NwMq-NfzA%3D%3D<br /> nanoporetech/ont-assembly-polish: ONT assembly and Illumina polishing pipeline</p><p>https://github.com/nanoporetech/ont-assembly-polish<br /> Generade-nl/TULIP: TULIP - The Uncorrected Long read Itegration Pipeline</p><p>https://github.com/Generade-nl/TULIP<br /> www.nature.com</p><p>https://www.nature.com/articles/s41598-017-03996-z<br /> Example gallery of NanoPlot &ndash; Gigabase or gigabyte</p><p>https://gigabaseorgigabyte.wordpress.com/2017/06/01/example-gallery-of-nanoplot/<br /> Tool documentation</p><p>https://broadinstitute.github.io/picard/command-line-overview.html<br /> Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions. - PubMed - NCBI</p><p>https://www.ncbi.nlm.nih.gov/pubmed/24185095<br /> MAFFT ver.7 - a multiple sequence alignment program</p><p>https://mafft.cbrc.jp/alignment/software/algorithms/algorithms.html<br /> Measuring the distance between multiple sequence alignments | Bioinformatics | Oxford Academic</p><p>https://academic.oup.com/bioinformatics/article/28/4/495/212883<br /> The MUMmer 3 examples</p><p>http://mummer.sourceforge.net/examples/<br /> MAFFT ver.7 - a multiple sequence alignment program</p><p>https://mafft.cbrc.jp/alignment/software/tips.html<br /> Omega | Overlap-graph de novo Assembler for Metagenomics</p><p>https://omega.omicsbio.org/<br /> abiswas-odu/Disco: Multi-threaded Distributed Memory Overlap-Layout-Consensus (OLC) Metagenome Assembler</p><p>https://github.com/abiswas-odu/Disco<br /> SAGE: String-overlap Assembly of GEnomes | BMC Bioinformatics | Full Text</p><p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-15-302</p><p>Fast and sensitive mapping of nanopore sequencing reads with GraphMap | Nature Communications</p><p>https://www.nature.com/articles/ncomms11307<br /> lumpy-sv/extractSplitReads_BwaMem at master &middot; arq5x/lumpy-sv</p><p>https://github.com/arq5x/lumpy-sv/blob/master/scripts/extractSplitReads_BwaMem<br /> jts/nanocorrect: Experimental pipeline for correcting nanopore reads</p><p>https://github.com/jts/nanocorrect</p><p>video - how to install flash plugin on ubuntu 14.04 LTS 64-bit version - Ask Ubuntu</p><p>https://askubuntu.com/questions/469553/how-to-install-flash-plugin-on-ubuntu-14-04-lts-64-bit-version<br /> lh3/fermi: A WGS de novo assembler based on the FMD-index for large genomes</p><p>https://github.com/lh3/fermi<br /> Multi-metagenome</p><p>http://madsalbertsen.github.io/multi-metagenome/docs/step9.html<br /> Bandage by rrwick</p><p>https://rrwick.github.io/Bandage/<br /> Codon Optimization OnLine (COOL): a web-based multi-objective optimization platform for synthetic gene design | Bioinformatics | Oxford Academic</p><p>https://academic.oup.com/bioinformatics/article/30/15/2210/2391162<br /> Genome Architecture and Evolution of a Unichromosomal Asexual Nematode - ScienceDirect</p><p>https://www.sciencedirect.com/science/article/pii/S096098221731076X?via%3Dihub#fig4<br /> How to determine chimeras in my de novo assembly? - SEQanswers</p><p>http://seqanswers.com/forums/showthread.php?t=26721<br /> samtools(1) manual page</p><p>http://www.htslib.org/doc/samtools.html<br /> How To Filter Mapped Reads With Samtools</p><p>https://www.biostars.org/p/56246/<br /> The MUMmer 3 manual</p><p>http://mummer.sourceforge.net/manual/#nucmer<br /> assembly_olc.pdf</p><p>http://www.cs.jhu.edu/~langmea/resources/lecture_notes/assembly_olc.pdf<br /> SAM and BAM filtering oneliners</p><p>https://gist.github.com/davfre/8596159<br /> Inroduction to dot-plots</p><p>http://www.code10.info/index.php%3Foption%3Dcom_content%26view%3Darticle%26id%3D64:inroduction-to-dot-plots%26catid%3D52:cat_coding_algorithms_dot-plots%26Itemid%3D76<br /> RepeatFinder Home Page</p><p>http://www.cbcb.umd.edu/software/RepeatFinder/<br /> RepeatFinderReprint.pdf</p><p>http://www.cbcb.umd.edu/software/RepeatFinder/RepeatFinderReprint.pdf<br /> https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CreateIdeogram/CreateIdeogram.html</p><p>https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CreateIdeogram/CreateIdeogram.html<br /> Circular Visualization in R</p><p>http://zuguang.de/circlize_book/book/introduction.html#a-qiuck-glance<br /> Creating a coverage plot using BEDTools and R</p><p>https://davetang.org/muse/2015/08/05/creating-a-coverage-plot-using-bedtools-and-r/<br /> Eval: A software package for analysis of genome annotations | BMC Bioinformatics | Full Text</p><p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-4-50<br /> eval-documentation.pdf</p><p>http://mblab.wustl.edu/media/software/eval-documentation.pdf<br /> OmicCircos: A Simple-to-Use R Package for the Circular Visualization of Multidimensional Omics Data</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3921174/<br /> sequence - download.tardigrades.org &gt; v1 &gt; sequence</p><p>http://download.tardigrades.org/v1/sequence/<br /> ksahlin/BESST: BESST - scaffolder for genomic assemblies</p><p>https://github.com/ksahlin/BESST<br /> reubwn/scripts: Useful scripts for various things</p><p>https://github.com/reubwn/scripts<br /> ICEberg</p><p>http://db-mml.sjtu.edu.cn/ICEberg/index.php<br /> Satsuma - Evolution and Genomics</p><p>http://evomics.org/learning/genomics/satsuma/<br /> A complete bacterial genome assembled de novo using only nanopore sequencing data | Nature Methods</p><p>https://www.nature.com/articles/nmeth.3444<br /> vezzi/FRC_align: Computes FRC from SAM/BAM file and not from afg files</p><p>https://mail.google.com/mail/u/0/#inbox<br /> Read GTF file into R - Dave Tang's blog</p><p>https://davetang.org/muse/2017/08/04/read-gtf-file-r/</p><p>https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CustomGenomes/CustomGenomes.html</p><p>https://bernatgel.github.io/karyoploter_tutorial//Tutorial/CustomGenomes/CustomGenomes.html<br /> Dot: Interactive dot plot for genome-genome alignments</p><p>https://dnanexus.github.io/dot/<br /> Zoho Accounts</p><p>https://accounts.zoho.eu/signin?servicename=ZohoProjects&amp;serviceurl=https%3A%2F%2Fprojects.zoho.eu%2Fportal%2Favaga2<br /> lh3/minimap2: A versatile pairwise aligner for genomic and spliced nucleotide sequences</p><p>https://github.com/lh3/minimap2<br /> SSPACE-LongRead: scaffolding bacterial draft genomes using long read sequence information | BMC Bioinformatics | Full Text</p><p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-15-211<br /> Palindromic gene amplification &mdash; an evolutionarily conserved role for DNA inverted repeats in the genome | Nature Reviews Cancer</p><p>https://www.nature.com/articles/nrc2591<br /> bioinformatics - BLAST DNA Sequences Reversed - Biology Stack Exchange</p><p>https://biology.stackexchange.com/questions/8160/blast-dna-sequences-reversed<br /> LASTZ</p><p>http://www.bx.psu.edu/miller_lab/dist/README.lastz-1.02.00/README.lastz-1.02.00a.html<br /> SOGo - (1652) Inbox</p><p>https://sogo.unamur.be/SOGo/so/jnarayan/Mail/view<br /> Tetra-Nucleotide Analysis (TNA) | BIOiPLUG Help center</p><p>http://help.bioiplug.com/tetra-nucleotide-analysis-tna/</p><p>Clustering metagenomic contigs on tetranucleotide frequency &mdash; CGAT documentation</p><p>http://cgat.readthedocs.io/en/latest/recipes/metagenome_contigs_kmers.html</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/36281/binc-bioinformatics-national-certification-examination-2018</guid>
	<pubDate>Mon, 23 Apr 2018 03:34:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/36281/binc-bioinformatics-national-certification-examination-2018</link>
	<title><![CDATA[BINC (Bioinformatics National Certification) Examination 2018]]></title>
	<description><![CDATA[<p>Bioinformatics National Certification (BINC) was instituted by Department of Biotechnology, Government of India in 2005 at Savitribai Phule Pune University, formerly University of Pune, Pune to certify bioinformatics professionals and recognizing candidate's theoretical and practical ability and fostering interdisciplinary research. Later on, it was transferred to Jawaharlal Nehru University, New Delhi and then to Pondicherry University, Puducherry. Pondicherry University conducted the BINC examination in 2015, 2016 and 2017.</p><div><p>Biotech Consortium India Limited (BCIL), New Delhi is conducting the BINC 2018 examination on behalf Department of Biotechnology, Government of India.</p></div><div><p>BINC is a certification programme for graduate and post-graduate students for recognizing their exceptional bioinformatics knowledge and skills and to improve their employment opportunities. There is a growing need for trained manpower in the area of Bioinformatics. Currently, various universities and institutions, both government and private, impart Bioinformatics education in India. The qualifying candidates will be awarded a lifetime certificate. This certification would facilitate industries and potential employers in recruitment of Bioinformatics professionals having exceptionally good bioinformatics skills.</p></div><div><p>The certification under Bioinformatics National Certification (BINC) scheme is given to the candidates after three tier selection process. The successful candidates are also eligible for availing Junior Research Fellowship (JRF) for pursuing Ph.D. in Bioinformatics at recognized Indian universities/institutes. The research fellowships of all BINC qualified Indian nationals are funded by DBT. BINC qualified candidates are called DBT certified Bioinformaticians while the individuals availing the fellowships are called as DBT-BINC Junior Research Fellows (DBT-BINC-JRF). Cash prize of 10,000/- each is awarded to the top 10 BINC qualifiers.</p></div><div><p><strong>Eligibility</strong></p></div><div><p>i) Bachelor's/Master's degree in Life Sciences, Physical Sciences, Chemical Sciences, Mathematical Sciences, Agriculture, Veterinary, Medicine, Pharmacy, Engineering and Technology.&nbsp;</p></div><div><p>ii) No formal training, diploma or certificate in bioinformatics is required.</p></div><div><p>iii) Candidates in final year of Bachelor's/ Master's degree are also eligible to apply.</p></div><div><p><strong><a href="http://bcil.nic.in/PatternofExamination.html" target="_blank">Pattern of Examination&nbsp;</a></strong></p></div><div><p><strong>Syllabus</strong>&nbsp;</p></div><div><p>The syllabus consists of six sections - Bioinformatics, Biology, Physical Science, Chemical Science, Mathematics &amp; Statistics, and Information Technology.</p></div><div><ul>
<li><a href="http://bcil.nic.in/files/BINC/BINC_SYLLABUS_for_Paper_I_2018.pdf" target="_blank">Syllabus for Paper-I (Objective)</a></li>
<li><a href="http://bcil.nic.in/files/BINC/BINC_SYLLABUS_for_Paper_II_2018.pdf" target="_blank">Syllabus for Paper-II (Short answers)</a></li>
<li><a href="http://bcil.nic.in/files/BINC/BINC_SYLLABUS_for_Paper_III_2018.pdf" target="_blank">Syllabus for Paper-III (Practical)</a></li>
</ul></div><div><p><strong>Note: Paper-III will be computer based practical and will include programming on Bioinformatics</strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/Important_Dates.pdf" target="_blank">Important Dates</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/Examination_Centers.pdf" target="_blank">Examination Centers&nbsp;</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/BINC_Fellowship.pdf" target="_blank">BINC Fellowship&nbsp;</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/formanddownload.html" target="_blank">Forms &amp; Downloads&nbsp;</a></strong></p></div><div><p><strong><a href="http://bcil.nic.in/files/BINC/FAQs.pdf" target="_blank">FAQs&nbsp;</a></strong>&nbsp;</p></div><div><h3>Contact Us</h3></div><div><ul>
<li>Nisha Singh</li>
<li>Biotech Consortium India Limited</li>
<li>(CIN: U73100DL1990PLC041486)</li>
<li>5th Floor, Anuvrat Bhawan 210, Deen Dayal Upadhyaya Marg New Delhi - 110 002</li>
<li>Tel.: 011-2321 9064-67 Ext. 231, 236</li>
<li>Email - For general BINC queries:<a href="mailto:binc.dbt@biotech.co.in" target="_blank">binc.dbt@biotech.co.in</a></li>
<li>Helpline for Application submission related queries:<a href="mailto:binc.binchelpdesk@biotech.co.in" target="_blank">binchelpdesk@biotech.co.in</a></li>
<li>Website:&nbsp;<a href="http://bcil.nic.in/BINC.html" target="_blank">www.bcil.nic.in/BINC.html</a></li>
</ul></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>