A very nice book by Winston Chang for R ethusiast. The R code presented in these pages is the R code actually used to produce the Figures in the book. There will be differences compared to the code chunks shown in the text of the book, but in most cases the differences will be that these pages contain additional code to lay out multiple plots on a single "page".

The code presented for each figure is self-contained, i.e., all code required to produce the figure is included. This means that there is sometimes considerable overlap of code between several figures  In some cases, it may be necessary to install an add-on package from CRAN to get the code to run.

More books at http://www.e-reading.club/bookreader.php/137370/C486x_APPb.pdf

Address of the bookmark: http://engr.case.edu/li_jing/papers/00798gpattern.pdf

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.

Pseudocode is an artificial and informal language that helps programmers develop algorithms. Pseudocode is a "text-based" detail (algorithmic) design tool.

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.

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.

Examples:

1.

If student's grade is greater than or equal to 60
    Print "passed"
else
    Print "failed"  
endif

2.

  
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.

3.

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 

4.

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

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

5.

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 >= hold char 
               if consec cntr < 3 
                    set consec cntr to 1
               endif
               set hold char = new char
               continue
          endif
          if new char < hold char
               if consec cntr < 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 >= 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

Some Keywords That Should be Used And Additional Points

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;

Always use scope terminators for loops and iteration.

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.

More on Formatting and Conventions in Pseudocoding

• INDENTATION in pseudocode should be identical to its implementation in a programming language. Try to indent at least four spaces.
• As noted above, the pseudocode entries are to be cryptic, AND SHOULD NOT BE PROSE. NO SENTENCES.
• No flower boxes (discussed ahead) in your pseudocode.
• Do not include data declarations in your pseudocode.
• But do cite variables that are initialized as part of their declarations. E.g. "initialize count to zero" is a good entry.

  ---

  Function Calls, Function Documentation, and Pseudocode
• Calls to Functions should appear as:
• Returns in functions should appear as:
• Function headers should appear as:
• Note that in C, arguments and parameters such as "fieldn" could be written: "pointer to fieldn ...."
• Functions called with addresses should be written as:
• Function headers containing pointers should be indicated as:
• Returns in functions where a pointer is returned:
• 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.
• Try to use scope terminators in your pseudocode and source code too. It really hels the readability of the text.

  ---

  Source Code
• 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.
• FORMAT of flowerbox should be

   

  	 ********************************************************
  	 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.
  	 ****************************************************************
  

• 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.
• 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.

  SPELLING ERRORS ARE NOT ACCEPTABLE

Link : http://www-dsv.cea.fr/en/instituts/institut-de-biologie-et-de-technologies-de-saclay-ibitec-s/unites-de-recherche/service-de-biologie-integrative-et-genetique-moleculaire-sbigem/laboratoire-de-biologie-integrative-lbi/presentation__1

Today, refreshing my old memories I decided to blog about the basic knowledge of biochemistry and computational proteomics skills, but after I found several article on internet saying exactly what I had wanted to say I thought I might as well just redirect BOL's blog readers there instead:

Here is the list of website and videos links which provide a good resource for you basic chemistry need:

http://tecreativ.blogspot.co.uk/2012/09/funny-shortcut-remember-periodic-table.html

This blog have some specific hindi word to remember entire periodic table. I really like

Group 14 (C Si Ge Sn Pb) -> Sentence “Chemistry Sir Gives Sanki Problems”

Sanki is a hindi word which mean crazy :P

I found this link useful as well http://www.wikihow.com/Memorise-the-Periodic-Table

The eagle genomics group provide an element of bioinformatics in periodic tables. Yes you got it, this is not periodic table rather bioinformatics tools with periodicals

http://elements.eaglegenomics.com/

You can also try this video links, which provide you an overview with tricks on periodic tables:

http://www.youtube.com/watch?v=fLSfgNxoVGk

http://www.youtube.com/user/periodicvideos

For drug design educational material, software, tools, databses, viewer, file format and many more stuff at one place http://www.allfordrugs.com/drug-design/ I highly recommend you all computational drug designer to bookmark this page for future studies as well.

I just remember one of my mini project in which I use my flash knowledge (flash .. oh ya flash) to explain amino acids in interactive and user friendly manner. I can’t provide It right now, but promise you to provide a link in near future. I hope that you will enjoy my flashy creative skills :).

Moreover, I found some of very interesting tricks to remember all amino acids chemical formulae on youtube at

http://www.youtube.com/watch?v=gqrWb0fmzQ&list=PL6132651E70BB5575

http://www.youtube.com/watch?v=C2GfoGXfySQ&list=PL6132651E70BB5575

Key points for computer added drug designers?
1. A shortage of biochemistry skills means that you absolutely nowhere in understanding the key concept and do research.
2. Keep handy with complex mathematical formula, before merely running tools or software.
3. Dig it better and deeper guys .. design it.

Software; Creation of Public Domain Resources in Biology
Present Status::

Developing prediction methods for gene, beta-turn, secondary structure and MHC-binding sites.
Area of Interest ::

Comparison of force field simulations. Analysis of DNA-protein interactions using molecular mechanics methods.Drug Target Identification using in silico biology.

More @ http://www.imtech.res.in/bic/index.php?option=com_content&view=article&id=65

PIs: http://www.imtech.res.in/bic/index.php?option=com_content&view=article&id=69

Many times in bioinformatics we need to deal with huge datasets which  are more than 100GB size. The traditional way to analysis a file is using the while loop

while (FILE){

Do something;

}

This is very slow(since we are using only one processor) and if we have 500 million lines in the dataset it takes more than a day to iterate through the whole dataset. So how do we make best use of all our processors and get the work done quickly?

Here is a very simple and efficient technique with perl which i have been using. I am  more inclined towards using perl fork than perl threads.

One of the oldest way to fork is

my $fork = fork();
if($fork){   
push (@childs,$fork); 
}
elseif($fork==0){
your code here;
exit(0);
}
else{die “Couldnt fork : $!”;}

## wait for the child process to finish
foreach(@childs){
my $tmp=waitid($_,0);
}

what a fork does is it creates a child process and takes the variables and code with it to analyze it separately (detached from the parent process) and thus a separate process is created( which usually runs on a separate processor). Thats it!! One big disadvantage of forking is its very difficult to share variables among the different processes. I will show you how to do it easily but still it has its own drawbacks.

Okie, now if you really do not want to use fork in your code, that’s okie too..There are many useful modules which do it for you very efficiently. One really useful module is Parallel::ForkManager. You can use Parallel::ForkManager to manage the number of forks you want to generate (number of processors you want to use).

Simple usage:
use Parallel::ForkManager;
my $max_processors=8;
my $fork= new Parallel::ForkManager($max_processors);
foreach (@dna) {
$fork->start and next; # do the fork
you code here;
$fork->finish; # do the exit in the child process
}
$pm->wait_all_children;

so you will be generating 8 forks which do the same thing for your each element of array. when one child finishes, Parallel::ForkManager generates a new one and thus you will be using all your processors to analyze the data. Now, if you have generated 8 child processes and want to write the data to one file. You need to lock the file to do this, because you will have problems with the buffering. You can lock the file using flock command.

open (my $QUAL, “myfile.txt”);
flock $QUAL, LOCK_EX or die “cant lock file $!”;
print $QUAL “$output”;
flock $QUAL, LOCK_UN or die “$!”;
close $QUAL;

I would not suggest using flock when dealing with multiple processes because it will decrease the processing efficiency( each child process must wait for the lock to be released by the other child process). Instead, I would suggest each fork writing to a separate file and after the processing just concatenating them.

Putting it all together, If you have 100GB data you can do this

step 1 : split the dataset equally according to number of processors you have. this may take a few hours(about 2-3 hrs for 100GB file)
You can use unix “split” command for this
for example:
my $number_split=int($number_of_entries_in_your_dataset/$max_processors);
my $split_Files=`split -l $number_split “your_file.fasta” “file_name”`;

step2: open you directory comtaining you split files and start Parallel::ForkManager.
For example:
opendir(DIRECTORY, $split_files_directory) or die $!; ### open the directory
my $fork= new Parallel::ForkManager($max_processors);
while (my $file = readdir(DIRECTORY)) { ### read the directory
if($file=~/^\./){next;}
print $file,”\n”;
########## Start fork ##########
my $pid= $super_fork->start and next;
Whatever you want to do with the split file ;
analyze my piece of $file;
######### end fork ###############
$super_fork->finish;
}
$super_fork->wait_all_children;

So basically each processor will be active with its piece of data (split file) and thus you have created 8 processes at one time which run without interfering with the other process. I again will not suggest writing output from each child process to one file(for reasons above). Write output from each fork to a separate file and finally concatenate them. Thats it, you have just increased your program speed by 8 times!! Isnt it easy?

Note:
You may worry about concatenation of the output each child generates, since it does take some time(remember 100GB). I think now you can use a mysql database LOAD DATA LOCAL INFILE command to load all the files into a single table(Should take about 3hrs for 100Gb dataset) and then export the whole table into one file. This should be faster than just concatenating them using “cat” command.(correct me if I am wrong)

Or much simpler way is to use pipes

cat output_dir/* | my_pipe or my_pipe <(file1) final_file;

Thats it guys!! Enjoy programming and please do comment. I am not a computer scientist so forgive me for any mistakes and if any please report them. Thank you.

The Taverna suite is written in Java and includes the Taverna Engine(used for enacting workflows) that powers both the Taverna Workbench(the desktop client application) and the Taverna Server (which allows remote execution of workflows). Taverna is also available as a Command Line Tool for a quick execution of workflows from a terminal.

Address of the bookmark: http://www.taverna.org.uk/

Gargi believes in its mission statement that every student who passes through the portals of the college emerges as a wholly developed individual symbolizing the spirit of enterprise and inquiry that characterizes Gargi.

Bioinformatics Infrastructure Facility (BIF), Gargi College, University of Delhi invites candidates for filling up the following purely temporary positions sponsored by DBT, New Delhi.

1. Name of the post: Traineeship
Essential Qualification: Post Graduate degree in Bioinformatics or any other branch of Life Sciences preferably with dissertation in Bioinformatics.
Desirable Qualification: Prior knowledge of programming languages such as C, VB, SQL etc. and software/database development.

2. Name of the post: Research Associate
Essential Qualification: PhD in Bioinformatics/Biological Sciences/Computer Science or allied sciences with proven experience in bioinformatics.

3. Name of the post: Studentship
Essential Qualifications: Final year Post Graduate students pursuing a degree in Bioinformatics or any branch of Life Science with knowledge of bioinformatics.

How to apply:
Interested candidates are required to appear for the walk in interview on 29th Aug, 2013 at 10.00 AM in Principal’s Office, Gargi College, Sirifort Road, N. Delhi-110049, with their CVs, original documents and a set of Photostat copies of all original documents.

http://www.du.ac.in/fileadmin/DU/students/Pdf/du/advt/2013/16082013_Gargi_RAplus2_Advt.pdf