<?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/35798?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/35798?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2336/3rd-annual-next-generation-sequencing-asia-congress-2013-at-singapore-singapore</guid>
  <pubDate>Wed, 14 Aug 2013 09:55:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[3rd Annual Next Generation Sequencing Asia Congress 2013 at Singapore, Singapore]]></title>
  <description><![CDATA[
<p>The 3rd Annual Next Generation Sequencing Asia Congress is to be held on the 22nd and 23rd of October 2013 in Singapore. Over the 2 days, the conference will provide an overview of the current options of next-generation sequencing platforms, technologies, applications and the newest computational tools for the analysis of next-generation sequencing data and analytical genomics as well as overcoming data management problems. The event will attract over 200 senior-level decision makers working in areas such as next generation sequencing, analytical genomics, computational biology, oncology, RNA profiling, molecular genomics, biomarkers, bioinformatics &amp; data management and clinical &amp; diagnostics development.</p>

<p>Dated : 22 Nov 2013 -23 Nov 2013</p>

<p>http://www.ngsasia-congress.com/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</guid>
	<pubDate>Wed, 25 Apr 2018 04:35:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</link>
	<title><![CDATA[Binding Site Prediction in Protein !]]></title>
	<description><![CDATA[<p><span>The interaction between proteins and other molecules is fundamental to all biological functions. In this section we include tools that can assist in prediction of interaction sites on protein surface and tools for predicting the structure of the intermolecular complex formed between two or more molecules (docking).</span></p><h4>Pockets Identification</h4><p><a href="http://sts.bioengr.uic.edu/castp/" target="_blank">CASTp</a></p><div style="text-align: justify;">Automatic Identification of pockets and cavities in proteins structure, and quantitation of their volumes using Delaunay triangulation. Available also as PyMOL plugin</div><p><a href="http://www.bioinformatics.leeds.ac.uk/pocketfinder/" target="_blank">Pocket-Finder</a></p><div style="text-align: justify;">Automatic identification of pockets and cavities in proteins structure, and quantitation of their volumes.</div><p><a href="http://gecco.org.chemie.uni-frankfurt.de/pocketpicker/index.html" target="_blank">PocketPicker</a></p><div style="text-align: justify;">Grid-based technique for the analysis of protein pockets. PocketPicker available as a plugin for&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/pymol.htm">PyMOL</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><h4>Binding Site Prediction</h4>
<p><a href="http://consurf.tau.ac.il/" target="_blank">ConSurf</a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification of functional regions in proteins by surface-mapping of phylogenetic information</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www-cryst.bioc.cam.ac.uk/~crescendo/crescendo.php" target="_blank">CRESCENDO</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification protein interaction sites. It uses sequence conservation patterns in homologous proteins to distinguish between residues that are conserved due to structural restraints from those due to functional restraints.&nbsp;&nbsp;</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><strong>Ligand Binding Sites</strong></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www.sbg.bio.ic.ac.uk/~3dligandsite/" target="_blank">3DLigandSite</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">The server utilizes protein-structure prediction to provide structural models of the binding site. Ligands bound to structures are superimposed onto the model and use to predict the binding site.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">F<a href="http://cssb.biology.gatech.edu/skolnick/files/FINDSITE/" target="_blank">INDSITE</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">A threading-based method for ligand-binding site prediction and functional annotation based on binding-site similarity across superimposed groups of threading templates.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">
<p><a href="http://scoppi.biotec.tu-dresden.de/pocket/" target="_blank">LIGSITE<sup>csc</sup></a></p>
<div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Prediction of binding site by pocket identification using the Connolly surface and degree of conservation</div>
<p><a href="http://metapocket.eml.org/" target="_blank"></a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://metapocket.eml.org/" target="_blank">metaPocket</a>A meta server for ligand-binding site prediction. metaPocket use&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#ligsite">LIGSITE<sup>csc</sup></a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pass">PASS</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#qsite">Q-SiteFinder</a>&nbsp;and&nbsp;<a href="http://www.biochem.ucl.ac.uk/~roman/surfnet/surfnet.html" target="_blank">SURFNET</a></div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/2383/golden-rules-of-bioinformatics</guid>
	<pubDate>Wed, 14 Aug 2013 21:11:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/2383/golden-rules-of-bioinformatics</link>
	<title><![CDATA[Golden Rules of Bioinformatics]]></title>
	<description><![CDATA[<ol>
<li>All constant are variable.</li>
<li>Copy and paste is a genetic error.</li>
<li>First solve the problem, then write the code.</li>
<li>No matter what goes wrong, it will probably look right.</li>
<li>Any simple problem can be insoluble if enough metting are held to discuss it. :P</li>
<li>Stastics is a systematic method of comming to the wrong conclusion with confidence.</li>
<li>Bug is a undocumented feature in programming languages.</li>
<li>Good biological programmer goes on summer holiday with raincoat. [because see 1]</li>
<li>Thanks god Google know python is not a python and multiplication and division are the same thing.</li>
<li>Don' be clever, complex biology will trick you.</li>
</ol>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37590/parallel-processing-with-perl</guid>
	<pubDate>Sat, 25 Aug 2018 11:32:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37590/parallel-processing-with-perl</link>
	<title><![CDATA[Parallel Processing with Perl !]]></title>
	<description><![CDATA[<p>Here is a small tutorial on how to make best use of multiple processors for bioinformatics analysis. One best way is using perl threads and forks. Knowing how these threads and forks work is very important before implementing them. Getting to know how these work would be really useful before reading this tutorial.</p><p>Many times in bioinformatics we need to deal with huge datasets which&nbsp; are more than 100GB size. The traditional way to analysis a file is using the while loop</p><p>while (FILE){</p><p>Do something;</p><p>}</p><p>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?</p><p>Here is a very simple and efficient technique with perl which i have been using. I am&nbsp; more inclined towards using perl fork than perl threads.</p><p>One of the oldest way to fork is</p><blockquote><p>my $fork = fork();<br />if($fork){&nbsp;&nbsp;&nbsp;<br />push (@childs,$fork);&nbsp;<br />}<br />elseif($fork==0){<br /><strong>your code here;</strong><br />exit(0);<br />}<br />else{die &ldquo;Couldnt fork : $!&rdquo;;}</p><p>## wait for the child process to finish<br />foreach(@childs){<br />my $tmp=waitid($_,0);<br />}</p></blockquote><p>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.</p><blockquote><p>Okie, now if you really do not want to use fork in your code, that&rsquo;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).</p><p><strong>Simple usage:</strong><br />use Parallel::ForkManager;<br />my $max_processors=8;<br />my $fork= new Parallel::ForkManager($max_processors);<br />foreach (@dna) {<br />$fork-&gt;start and next; # do the fork<br /><strong>you code here;</strong><br />$fork-&gt;finish; # do the exit in the child process<br />}<br />$pm-&gt;wait_all_children;</p></blockquote><p>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.</p><blockquote><p>open (my $QUAL, &ldquo;myfile.txt&rdquo;);<br />flock $QUAL, LOCK_EX or die &ldquo;cant lock file $!&rdquo;;<br />print $QUAL &ldquo;$output&rdquo;;<br />flock $QUAL, LOCK_UN or die &ldquo;$!&rdquo;;<br />close $QUAL;</p></blockquote><p>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.</p><p><strong>Putting it all together, If you have 100GB data you can do this</strong></p><blockquote><p><strong>step 1</strong>&nbsp;: split the dataset equally according to number of processors you have. this may take a few hours(about 2-3 hrs for 100GB file)<br />You can use unix &ldquo;split&rdquo; command for this<br />for example:<br />my $number_split=int($number_of_entries_in_your_dataset/$max_processors);<br />my $split_Files=`split -l $number_split &ldquo;your_file.fasta&rdquo; &ldquo;file_name&rdquo;`;</p><p><strong>step2</strong>: open you directory comtaining you split files and start Parallel::ForkManager.<br /><strong>For example:</strong><br />opendir(DIRECTORY, $split_files_directory) or die $!; ### open the directory<br />my $fork= new Parallel::ForkManager($max_processors);<br />while (my $file = readdir(DIRECTORY)) { ### read the directory<br />if($file=~/^\./){next;}<br />print $file,&rdquo;\n&rdquo;;<br />########## Start fork ##########<br />my $pid= $super_fork-&gt;start and next;<br /><strong>Whatever you want to do with the split file ;</strong><br /><strong>analyze my piece of $file;</strong><br />######### end fork ###############<br />$super_fork-&gt;finish;<br />}<br />$super_fork-&gt;wait_all_children;</p></blockquote><p>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?</p><p><strong>Note:</strong><br />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 &ldquo;cat&rdquo; command.(correct me if I am wrong)</p><p>Or much simpler way is to use pipes</p><p>cat output_dir/* | my_pipe or my_pipe &lt;(file1) final_file;</p><p>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.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2461/taverna-workflow-management-system</guid>
	<pubDate>Thu, 15 Aug 2013 19:34:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2461/taverna-workflow-management-system</link>
	<title><![CDATA[Taverna Workflow Management System]]></title>
	<description><![CDATA[<p>Taverna is an open source domain independent Workflow Management System &ndash; a suite of tools used to design and execute scientific workflows. Taverna has been created by the myGrid project and is funded through a range of organisations and projects.</p>
<p>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.</p><p>Address of the bookmark: <a href="http://www.taverna.org.uk/" rel="nofollow">http://www.taverna.org.uk/</a></p>]]></description>
	<dc:creator>Madhvan Reddy</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38487/betsy-a-new-backward-chaining-expert-system-for-automated-development-of-pipelines-in-bioinformatics</guid>
	<pubDate>Mon, 17 Dec 2018 18:46:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38487/betsy-a-new-backward-chaining-expert-system-for-automated-development-of-pipelines-in-bioinformatics</link>
	<title><![CDATA[BETSY: A new backward-chaining expert system for automated development of pipelines in Bioinformatics]]></title>
	<description><![CDATA[<p>The BETSY provides a command-line interface and available at&nbsp;<a href="https://github.com/jefftc/changlab">https://github.com/jefftc/changlab</a>. A user first searches in the knowledge base for desired output and then BETSY develops an initial workflow to produce that data which is later examined by the user. The user can optimize the parameters, the algorithm to preprocess the data, and normalize it depending on the task.</p>
<p>Currently, BETSY consists of modules required for the microarray and next-generation sequencing data [4] such as expression analysis, classification, peak calling, and visualization.</p><p>Address of the bookmark: <a href="https://github.com/jefftc/changlab" rel="nofollow">https://github.com/jefftc/changlab</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2646/bioinformatics-infrastructure-facility-bif-gargi-college-university-of-delhi-traineeship</guid>
  <pubDate>Mon, 19 Aug 2013 18:43:03 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Infrastructure Facility (BIF), Gargi College, University of Delhi @ Traineeship]]></title>
  <description><![CDATA[
<p>Gargi College was established in the year 1967 and is a leading South Campus college of the University of Delhi. It is a college for women and offers education in Arts and Humanities, Commerce, Science and Education.</p>

<p>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.</p>

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

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

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

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

<p>How to apply:<br />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.</p>

<p>http://www.du.ac.in/fileadmin/DU/students/Pdf/du/advt/2013/16082013_Gargi_RAplus2_Advt.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/39603/tenure-track-position-in-bioinformatics-at-institute-of-neurobiology-unam-queretaro-mexico</guid>
  <pubDate>Mon, 10 Jun 2019 00:48:54 -0500</pubDate>
  <link></link>
  <title><![CDATA[Tenure Track position in Bioinformatics at Institute of Neurobiology, UNAM, Querétaro, México]]></title>
  <description><![CDATA[
<p>The Institute of Neurobiology UNAM (www.inb.unam.mx) offers a tenure-track position at the level of Assistant Professor (Investigador Asociado C) to develop an original research program in Bioinformatics with applications to neuroscience and to establish multidisciplinary collaboration with other members of the Institute. Applicants are expected to have a doctorate degree, postdoctoral experience related to bioinformatics or genome biology, and a strong track record of peer-reviewed publications. No previous experience in neuroscience is required.</p>

<p>Interested applicants must submit CV and addresses of three references to ataulfo@unam.mx.</p>

<p>Tenure Track position in Genomic Sciences  </p>

<p>Laboratorio Internacional de Investigación sobre el Genoma Humano, UNAM Juriquilla, Querétaro, México </p>

<p>The International Laboratory for Human Genome Research, LIIGH-UNAM (www.liigh.unam.mx) offers a tenure-track position at the level of Assistant Professor (Investigador Asociado C) to perform research, teaching and formation of human resources in the area of: “Genomics of Mendelian Diseases” </p>

<p>Applicants are expected to have a doctorate degree, postdoctoral experience related to the above mentioned area and a strong track record of peer-reviewed publications. Interested applicants must submit CV, email addresses of three references, and a three-page project to Dr. Rafael Palacios, Coordinator of LIIGH-UNAM (palacios@liigh.unam.mx) before June 21, 2019 ………………………………………………………………</p>

<p>Tenure Track position in Genomic Sciences </p>

<p>Laboratorio Internacional de Investigación sobre el Genoma Humano, UNAM Juriquilla, Querétaro, México </p>

<p>The International Laboratory for Human Genome Research, LIIGH-UNAM (www.liigh.unam.mx) offers a tenure-track position at the level of Assistant Professor (Investigador Asociado C) to perform research, teaching and formation of human resources in the area of: “Statistic Population Genomics and its Impact in Complex Diseases” </p>

<p>Applicants are expected to have a doctorate degree, postdoctoral experience related to the above mentioned area and a strong track record of peer-reviewed publications. Interested applicants must submit CV, email addresses of three references, and a three-page statement of research interests to Dr. Rafael Palacios, Coordinator of LIIGH-UNAM (palacios@liigh.unam.mx) before June 21, 2019</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4193/bioinformatics-101-running-blast</guid>
	<pubDate>Tue, 03 Sep 2013 14:59:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4193/bioinformatics-101-running-blast</link>
	<title><![CDATA[Bioinformatics 101 -  Running BLAST]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/CYnjROfGXv8" frameborder="0" allowfullscreen></iframe>How to format the database for BLAST, run the command, view the output file, and use BioPerl and Perl to parse the output. By David Francis, Ohio State University. Delivered live at the Tomato Disease Workshop 2010. For more information, please visit http://www.extension.org/pages/32521/bioinformatics-101-video.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/40248/industrial-training-in-computer-aided-drug-designing-cadd</guid>
	<pubDate>Wed, 13 Nov 2019 05:00:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/40248/industrial-training-in-computer-aided-drug-designing-cadd</link>
	<title><![CDATA[Industrial Training in Computer Aided Drug Designing (CADD)]]></title>
	<description><![CDATA[<p>Learn More about&nbsp; Computer Aided Drug Designing (CADD)!!!</p><p>#rasalsi #rasa In our Industrial program you will get Knowledge on RNA Seq, CHIP Seq,</p><h2 style="text-align: center;"><strong>Batch Starts From 18<sup>th</sup> November 2019</strong></h2><p>#hurryup #registernow #enquirenow The primary goal of the industrial training program is to provide students with necessary skills making with employable. RASA LSI trains students with the enhanced skills required for them to excel in jobs in biotechnology, pharmaceuticals, BioIT and related industry sectors. At Rasa you will&nbsp; learn from industry leaders&nbsp;how to apply these skills in life science &amp; have a command over software developing process &nbsp;by using various methodologies. For Registration visit us on: https://www.rasalsi.com/index.php/front-page/industrial-training/</p>]]></description>
	<dc:creator>RASA Life Sciences</dc:creator>
</item>

</channel>
</rss>