<?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/28915?offset=750</link>
	<atom:link href="https://bioinformaticsonline.com/related/28915?offset=750" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</guid>
	<pubDate>Mon, 23 Jan 2017 10:17:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</link>
	<title><![CDATA[Source Code and Pseudo Code !!]]></title>
	<description><![CDATA[<p>An <span style="text-decoration: underline;">algorithm</span> is a procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed. An algorithm is merely the sequence of steps taken to solve a problem. The steps are normally "sequence," "selection, " "iteration," and a case-type statement.</p><p>In C, "sequence statements" are imperatives. The "selection" is the "if then else" statement, and the iteration is satisfied by a number of statements, such as the "while," " do," and the "for," while the case-type statement is satisfied by the "switch" statement.</p><hr><p><span style="text-decoration: underline;">Pseudocode</span> is an artificial and informal language that helps programmers develop algorithms. Pseudocode is a "text-based" detail (algorithmic) design tool.</p><p>The rules of Pseudocode are reasonably straightforward. All statements showing "dependency" are to be indented. These include while, do, for, if, switch. Examples below will illustrate this notion.</p><p><strong> GUIDE TO PSEUDOCODE LEVEL OF DETAIL: Given record/file descriptions, pseudocode should be created in sufficient detail so as to directly support the programming effort. It is the purpose of pseudocode to elaborate on the algorithmic detail and not just cite an abstraction. </strong></p><hr><p>Examples:</p><p>1.</p><pre>If student's grade is greater than or equal to 60
    Print "passed"
else
    Print "failed"  
endif
</pre><hr><p>2.</p><pre>  
Set total to zero
Set grade counter to one
While grade counter is less than or equal to ten
    Input the next grade
    Add the grade into the total
endwhile 
Set the class average to the total divided by ten
Print the class average.
</pre><hr><p>3.</p><pre>Initialize total to zero
Initialize counter to zero
Input the first grade
while the user has not as yet entered the sentinel
   add this grade into the running total 
   add one to the grade counter  
   input the next grade (possibly the sentinel)
endwhile

if the counter is not equal to zero
   set the average to the total divided by the counter
   print the average  
else
   print 'no grades were entered' 
endif 
</pre><hr><p>4.</p><pre>initialize passes to zero
initialize failures to zero
initialize student to one
while student counter is less than or equal to ten
    input the next exam result  
    if the student passed</pre><p>add one to passes else add one to failures add one to student counter endif endwhile print the number of passes print the number of failures if eight or more students passed print "raise tuition" endif</p><hr><h3><strong>5.</strong></h3><pre>Larger example:  

NOTE:  NEVER ANY DATA DECLARATIONS IN PSEUDOCODE

Print out appropriate heading and make it pretty
While not EOF do:
     Scan over blanks and white space until a char is found 
	(get first character on the line)
     set can't-be-ascending-flag to 0
     set consec cntr to 1
     set ascending cntr to 1
     putchar first char of string to screen
     set read character to hold character
     While next character read != blanks and white space
          putchar out on screen
          if new char = hold char + 1
               add 1 to consec cntr
               set hold char = new char
               continue
          endif
          if new char &gt;= hold char 
               if consec cntr &lt; 3 
                    set consec cntr to 1
               endif
               set hold char = new char
               continue
          endif
          if new char &lt; hold char
               if consec cntr &lt; 3
                    set consec cntr to 1
               endif
               set hold char = new char
               set can't be ascending flag to 1
               continue
           endif
     end while
     if consec cntr &gt;= 3 
          printf (Appropriate message 1 and skip a line)
          add 1 to consec total
     endif
     if  can't be ascending flag = 0
          printf (Appropriate message 2 and skip a line)
          add 1 to ascending total
     else
          printf (Sorry message and skip a line)
          add 1 to sorry total
     endif
end While
Print out totals:  Number of consecs, ascendings, and sorries.
Stop
</pre><p>Some Keywords That Should be Used And Additional Points</p><p>For looping and selection, The keywords that are to be used include Do While...EndDo; Do Until...Enddo; While .... Endwhile is acceptable. Also, Loop .... endloop is also VERY good and is language independent. Case...EndCase; If...Endif; Call ... with (parameters); Call; Return ....; Return; When;</p><p>Always use scope terminators for loops and iteration.</p><p>As verbs, use the words Generate, Compute, Process, etc. Words such as set, reset, increment, compute, calculate, add, sum, multiply, ... print, display, input, output, edit, test , etc. with careful indentation tend to foster desirable pseudocode. Also, using words such as Set and Initialize, when assigning values to variables is also desirable.</p><p>More on Formatting and Conventions in Pseudocoding</p><ul>
<li>INDENTATION in pseudocode should be identical to its implementation in a programming language. Try to indent at least four spaces.</li>
<li>As noted above, the pseudocode entries are to be cryptic, AND SHOULD NOT BE PROSE. NO SENTENCES.</li>
<li>No flower boxes (discussed ahead) in your pseudocode.</li>
<li>Do not include data declarations in your pseudocode.</li>
<li>But do cite variables that are initialized as part of their declarations. E.g. "initialize count to zero" is a good entry.<hr>Function Calls, Function Documentation, and Pseudocode</li>
<li>Calls to Functions should appear as:
<ul>     </ul>
</li>
<li>Returns in functions should appear as:
<ul> </ul>
</li>
<li>Function headers should appear as:
<ul>     </ul>
</li>
<li>Note that in C, arguments and parameters such as "fieldn" could be written: "pointer to fieldn ...."</li>
<li>Functions called with addresses should be written as:
<ul>         </ul>
</li>
<li>Function headers containing pointers should be indicated as:
<ul>        </ul>
</li>
<li>Returns in functions where a pointer is returned:
<ul>   </ul>
</li>
<li>It would not hurt the appearance of your pseudocode to draw a line or make your function header line "bold" in your pseudocode. Try to set off your functions.</li>
<li>Try to use scope terminators in your pseudocode and source code too. It really hels the readability of the text.<hr>Source Code</li>
<li>EVERY function should have a flowerbox PRECEDING IT. This flower box is to include the functions name, the main purpose of the function, parameters it is expecting (number and type), and the type of the data it returns. All of these listed items are to be on separate lines with spaces in between each explanatory item.</li>
<li>FORMAT of flowerbox should be
<p>&nbsp;</p>
<pre>	 ********************************************************
	 Function:   ( cryptic text describing single function
		     ....... (indented like this) 	
		     .......
	 Calls:      Start listing functions "this" function calls
		     Show these functions:  one per line, indented

	 Called by:  List of functions that calls "this" function
		     Show these functions:  one per line, indented.

	 Input Parameters:  list, if appropriate; else None
	 
	 Returns:    List, if appropriate.
	 ****************************************************************
</pre>
</li>
<li>INDENTATION is critically important in Source Code. Follow standard examples given in class. If in doubt, ASK. Always indent statements within IFs, FOR loops, WILLE loops, SWITCH statements, etc. a consistent number of spaces, such as four. Alternatively, use the tab key. One or two spaces is insufficient.</li>
<li>Use scope terminators at the end of if statements, for statements, while statements, and at the end of functions. It will make your program much more readable.
<p><strong> SPELLING ERRORS ARE NOT ACCEPTABLE </strong></p>
</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30747/11th-international-joint-conference-on-biomedical-engineering-systems-and-technologies</guid>
  <pubDate>Wed, 01 Feb 2017 17:39:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[11th International Joint Conference on Biomedical Engineering Systems and Technologies]]></title>
  <description><![CDATA[
<p>BIOSTEC, the 11th International Joint Conference on Biomedical Engineering Systems and Technologies.<br /> Registration to BIOINFORMATICS allows free access to all other BIOSTEC conferences. </p>

<p>Upcoming Deadlines<br />Regular Paper Submission: July 31, 2017 <br />Regular Paper Authors Notification: October 16, 2017 <br />Regular Paper Camera Ready and Registration: October 30, 2017 </p>

<p>The purpose of the International Conference on Bioinformatics Models, Methods and Algorithms is to bring together researchers and practitioners interested in the application of computational systems, algorithmic concepts and information technologies to address challenging problems in Biomedical research with a particular focus on the emerging problems in Bioinformatics and computational biology. There is a tremendous need to explore how mathematical, statistical and computational models can be used to better understand biological processes and systems, while developing new methodologies and tools to analysis the massive currently-available biological data. Areas of interest to this community include systems biology, sequence analysis, biostatistics, image analysis, network and graph models, scientific data management and data mining, machine learning, pattern recognition, computational evolutionary biology, computational genomics and proteomics, and related areas.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30889/phd-program-in-computer-science-at-university-of-essex</guid>
  <pubDate>Sat, 11 Feb 2017 13:11:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD program in Computer Science at University of Essex]]></title>
  <description><![CDATA[
<p>As part of the PhD program in Computer Science at University of Essex, I am looking for a PhD student in computational and synthetic biology.<br />The ideal candidate is interested in designing new biological design automation methods for genome scale projects and/or network modelling of genomic, transcriptomic and proteomic data.<br />Candidates interested in developing optimization algorithms for biological problems are encouraged to apply as well.<br />A summary of the research work in the lab can be found on o this page.</p>

<p>Candidates interested in the position should contact me in advance by email to: g.stracquadanio@essex.ac.uk</p>

<p>The deadline for the application is 28/02/2017; info about the application can be found on the Essex CSEE website.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/31520/research-associate-openings-at-iasri-india</guid>
  <pubDate>Fri, 10 Mar 2017 03:53:03 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate openings at IASRI, India]]></title>
  <description><![CDATA[
<p>Research Associate (RA) Two (2) </p>

<p>Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. </p>

<p>Knowledge in System Biology/ Statistical and computational Genomics/ Bioinformatics <br />Knowledge in computer programming, LINUX OS. <br />Expertise in use of R/other Bioinformatics software </p>

<p>More at http://iasri.res.in/employment/2017/cabin_advertisement_RA_SRF_YP_Mar2017.pdf</p>

<p>Phenomics of Moisture Deficit Stress Tolerance and Nitrogen Use December 31, 2019 </p>

<p>Research Associate (RA) Two (2) </p>

<p>Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or System Administrator/ Computer expert for database development, development of phenome data bank and virtual phenomics facility, data archiving and Efficiency in Rice and Wheat-Phase II (Funded by National Agricultural Science Fund, ICAR) Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. maintenance; Development of image analysis algorithms, APIs and IAPs. </p>

<p>Knowledge in System Biology/ Statistical and computational Genomics/ Bioinformatics <br />Knowledge of programming in LINUX/R/Perl/JAVA/PHP/JSP and use of various software &amp; tools. <br />December 31, 2019 </p>

<p>Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science / Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. </p>

<p>Knowledge of Statistical and Computational Genomics/ Bioinformatics. <br />Knowledge of programming in LINUX/R/Perl/JAVA/PHP/JSP and use of various software &amp; tools. <br />March 31, 2020</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</guid>
	<pubDate>Mon, 10 Apr 2017 05:42:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</link>
	<title><![CDATA[Lifemap]]></title>
	<description><![CDATA[<p><strong>Lifemap</strong> is an interactive tool to explore the WHOLE NCBI TAXONOMY. The concept used in <strong>Lifemap</strong> is similar to the one used in cartography with tools like Google Maps&copy; or Open Street Maps: exploring is done by zooming and panning.</p>
<div>
<p>&nbsp;The current tree contains ALL species present in NCBI taxonomy as of <span style="text-decoration: underline;">October 18th, 2016</span>: 1,135,169 species including 10,545 Archaea, 418,777 Bacteria and 705,847 Eukaryotes. The Lifemap tree is updated every two weeks.</p>
</div>
<p>&nbsp;All the nodes in the tree are clickable. This displays various information and options:</p>
<ul>
<li>The species name (and the associated common name if there is one)</li>
<li>The rank (kingdom, family, class, species...)</li>
<li>Ability to go to the corresponding node/species on NCBI web site (displayed in a new window)</li>
<li>Possibility to download the corresponding subtree in newick extended format</li>
<li>Possibilty to get the whole lineage from the current node/tip to the root of the tree.</li>
</ul><p>Address of the bookmark: <a href="http://lifemap-ncbi.univ-lyon1.fr/" rel="nofollow">http://lifemap-ncbi.univ-lyon1.fr/</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/researchlabs/view/32629/bienko-and-crosetto-labs</guid>
  <pubDate>Fri, 12 May 2017 07:42:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bienko and Crosetto Labs]]></title>
  <description><![CDATA[
<p>We are two groups of scientists doing frontier research in quantitative biology and biomedicine. The Bienko group is interested in exploring the fundamental design principles controlling how DNA is packed in the eukaryotic nucleus and its relation to gene expression regulation. The Crosetto group engineers new molecular methods for single-cell and spatially resolved omic measurements of DNA, RNA, and proteins, with a strong focus on tumor heterogeneity. By sharing ideas and resources, we work synergistically towards a more quantitative understanding of life’s processes in healthy and diseased conditions.</p>

<p>https://bienkocrosettolabs.org/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/34731/postdoctoral-scholarship-in-bioinformatics-at-kth</guid>
  <pubDate>Thu, 21 Dec 2017 03:55:53 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral scholarship in Bioinformatics at  KTH]]></title>
  <description><![CDATA[
<p>The School of Biotechnology offers a curriculum that reflects the multidisciplinary nature of Biotechnology, integrating theoretical and applied science in undergraduate and graduate courses. The school has six departments with about 300 employees, located at AlbaNova University Center in Stockholm and Science for Life Laboratory in Solna. The Biotechnology research within the school is internationally well recognized.</p>

<p>We are now seeking a postdoc scholarship holder with strong background in transcriptomics to use this large collection of data for integrative studies. Focus will be on advanced bioinformatics and statistical analysis of data from high-throughput sequencing including integration with the other platforms.</p>

<p>The scholarship holder must have a PhD with an outstanding research and publication record and will be selected based on her/his excellence and her/his skills. A PhD should have been awarded less than five years before the deadline of the application. The scholarship holder must have a strong background in bioinformatics, computer science, computational biology or equivalent with a profound knowledge about biology and biostatistics.</p>

<p>Your complete application must be received at KTH no later than 2018-01-15.</p>

<p>https://www.kth.se/en/om/work-at-kth/stipendier/postdoctoral-scholarship-in-bioinformatics-with-focus-on-transcriptomics-and-data-integration-1.779571</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</guid>
	<pubDate>Mon, 19 Feb 2018 06:46:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</link>
	<title><![CDATA[ETE 3: Reconstruction, Analysis, and Visualization of Phylogenomic Data]]></title>
	<description><![CDATA[<p><span>ETE v3, featuring numerous improvements in the underlying library of methods, and providing a novel set of standalone tools to perform common tasks in comparative genomics and phylogenetics. </span></p>
<p><span>The new features include </span></p>
<p><span>(i) building gene-based and supermatrix-based phylogenies using a single command, </span></p>
<p><span>(ii) testing and visualizing evolutionary models, </span></p>
<p><span>(iii) calculating distances between trees of different size or including duplications, and </span></p>
<p><span>(iv) providing seamless integration with the NCBI taxonomy database. </span></p>
<p><span>ETE is freely available at&nbsp;</span><a href="http://etetoolkit.org/" target="">http://etetoolkit.org</a></p><p>Address of the bookmark: <a href="http://etetoolkit.org" rel="nofollow">http://etetoolkit.org</a></p>]]></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>

</channel>
</rss>