<?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/30355?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/30355?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29624/information-officer-at-iiar-gujarat</guid>
  <pubDate>Fri, 04 Nov 2016 05:19:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Information Officer at IIAR, Gujarat]]></title>
  <description><![CDATA[
<p>Walk in interview at 10.30 am on Nov 11th, 2016 for the following position at Distributed Information Sub-Centre (DISC) established by Dept. Of Biotechnology, Govt. of India at Indian Institute of Advanced Research, Gandhinagar, Gujarat</p>

<p>Position (scale), qualifications and experience</p>

<p>1. Information Officer (Rs 8000-275-13500): one post <br />Qualifications and experience: MCA, Post-Graduate in any field of biosciences, bioinformatics with at least two years of experience in working in a bioinformatics setup and good knowledge of linux operating system and computer networking.</p>

<p>General terms and conditions: <br />1. The above engagements is presently till March 31st, 2017. However on extension of project grant and satisfactory performance of the candidate, your services can be extended beyond March 31st, 2017 based on the terms and conditions of extension of project grant.</p>

<p>2. It is not an appointment with the institute and will not confer any right to the incumbent to any claim implicit or explicit on any position.</p>

<p>3.No TA/DA will be paid for attending the interview. Outstation candidates have to make their own arrangement for their stay.</p>

<p>4.Candidates, appearing in the walk-in interview are requested to bring the hard copy of application addressed to Dr. Anju Pappachan with latest photograph, CV mentioning qualifications, work experience and name of two referees and one page write up as to why you would like to join the project.</p>

<p>Address: <br />Dr. Anju Pappachan <br />Indian Institute of Advanced Research (IIAR), <br />University  and Institute of Advanced Research, <br />The Puri Foundation for Education in India, <br />Koba Institutional Area, <br />Gandhinagar- 382 007, Gujarat, India. Contact no. 079-30514152 <br />e-mail- anju@iiar.res.in</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29849/ra-bioinformatics-at-national-institute-of-cancer-prevention-research-icmr</guid>
  <pubDate>Thu, 17 Nov 2016 04:11:09 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL INSTITUTE OF CANCER PREVENTION &amp; RESEARCH (ICMR)]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF CANCER PREVENTION &amp; RESEARCH (ICMR)</p>

<p>Noida 201301 (U.P)</p>

<p>Applications are invited upto 21.11.2016 from interested candidates as per details available on NICPR website (www.nicpr.res.in)/ ICMR website (www.icmr.nic.in) to fill up following temporary position in the time bound DHR Project entitled “Next generation EGFR inhibitor identification using ligand based QSAR technique” under Dr. Subhash M. Agarwal, Scientist-D, Division of Bioinformatics.</p>

<p>Research Assistant (One)</p>

<p>Rs.27000/- p.m. (Fixed/temporary)</p>

<p>Essential: M.Sc. in Bioinformatics or related field.</p>

<p>Desirable: Experience in QSAR and structure based drug designing.</p>

<p>More Info : www.icmr.nic.in/icmrnews/NICPR_Advertisement%20for%20RA.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29915/professor-all-levels-in-bioinformatics-and-computational-biology</guid>
  <pubDate>Tue, 22 Nov 2016 05:43:38 -0600</pubDate>
  <link></link>
  <title><![CDATA[Professor (all levels) in Bioinformatics and Computational Biology]]></title>
  <description><![CDATA[
<p>King Abdullah University of Science and Technology (KAUST) (kaust.edu.sa) is seeking a highly motivated and skilled faculty member for the Bioinformatics track whose research focuses on development of methods and tools for Bioinformatics and Computational Biology.<br />KAUST is an international, graduate-level research university dedicated to advancing science and technology through interdisciplinary research, education, and innovation. Located on the shores of the Red Sea in Saudi Arabia, KAUST offers superb research facilities, generous assured research funding, and internationally competitive salaries, attracting top international faculty, scientists, engineers, and students to conduct fundamental and goal-oriented research to address the world’s pressing scientific and technological challenges in the areas of food, water, energy, and the environment.<br />The successful applicant is expected to develop world-leading research in domain of bioinformatics/computational biology with focus on development of novel computational approaches for efficient and accurate methods of analyzing biological phenomena at molecular level. The faculty member will be part of the Computational Bioscience Research Center (CBRC) within the Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division. The position will remain open until filled.<br /> <br />Requirements:<br /> <br />PhD or equivalent in a Computer Science, Mathematics or Engineering discipline. Candidates should be well-established within the research field relevant to the position grade. They should demonstrate original research and experience at the highest international level.<br /> <br />Responsibilities and tasks:<br /> <br />Research competence in the following areas is preferred:<br />Analysis of next generation sequencing (NGS) and other ‘omics’ data (e.g. CAGE, ChIP-Seq, DHS, RNA-Seq, Ribo-Seq, proteomic, metabolic and NMR spectra, etc.).<br />Signaling, regulatory and metabolic pathways analysis.<br />Development of tools (web-based and standalone) suited for efficient computational biology/bioinformatics.<br /> <br /> <br />Visit cemse.kaust.edu.sa to apply.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30015/scripts</guid>
	<pubDate>Wed, 30 Nov 2016 10:35:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30015/scripts</link>
	<title><![CDATA[Scripts]]></title>
	<description><![CDATA[<p>Useful script for NGS analysis.</p><p>Address of the bookmark: <a href="http://augustus.gobics.de/binaries/scripts/" rel="nofollow">http://augustus.gobics.de/binaries/scripts/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30147/cisa-contig-integrator-for-sequence-assembly</guid>
	<pubDate>Thu, 15 Dec 2016 05:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30147/cisa-contig-integrator-for-sequence-assembly</link>
	<title><![CDATA[CISA: Contig Integrator for Sequence Assembly]]></title>
	<description><![CDATA[<p>A plethora of algorithmic assemblers have been proposed for the <em>de novo</em> assembly of genomes, however, no individual assembler guarantees the optimal assembly for diverse species. Optimizing various parameters in an assembler is often performed in order to generate the most optimal assembly. However, few efforts have been pursued to take advantage of multiple assemblies to yield an assembly of high accuracy. In this study, we employ various state-of-the-art assemblers to generate different sets of contigs for bacterial genomes. A tool, named CISA, has been developed to integrate the assemblies into a hybrid set of contigs, resulting in assemblies of superior contiguity and accuracy, compared with the assemblies generated by the state-of-the-art assemblers and the hybrid assemblies merged by existing tools. This tool is implemented in Python and requires MUMmer and BLAST+ to be installed on the local machine. The source code of CISA and examples of its use are available at <a href="http://sb.nhri.org.tw/CISA/">http://sb.nhri.org.tw/CISA/</a>.</p><p>Address of the bookmark: <a href="http://sb.nhri.org.tw/CISA/en/CISA" rel="nofollow">http://sb.nhri.org.tw/CISA/en/CISA</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/30245/venkatesh-lab</guid>
  <pubDate>Tue, 20 Dec 2016 04:38:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[Venkatesh Lab]]></title>
  <description><![CDATA[
<p>We are using a comparative genomics approach to better understand the structure, function and evolution of the human genome. Our group is one of the pioneers in the field of comparative genomics. We proposed the compact genome of the fugu (Takifugu rubripes) as a model vertebrate genome in 1993 (Nature 366: 265-268, 1993) and determined its whole genome sequence in 2002 (Science 297: 1301-1310, 2002).</p>

<p>More at <br />https://zfin.org/ZDB-LAB-110408-1<br />http://www.imcb.a-star.edu.sg/php/venkatesh.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30550/genomering-alignment-visualization-based-on-supergenome-coordinates</guid>
	<pubDate>Wed, 18 Jan 2017 10:24:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30550/genomering-alignment-visualization-based-on-supergenome-coordinates</link>
	<title><![CDATA[GenomeRing: alignment visualization based on SuperGenome coordinates]]></title>
	<description><![CDATA[<p>The number of completely sequenced genomes is continuously rising, allowing for comparative analyses of genomic variation. Such analyses are often based on whole-genome alignments to elucidate structural differences arising from insertions, deletions or from rearrangement events. Computational tools that can visualize genome alignments in a meaningful manner are needed to help researchers gain new insights into the underlying data. Such visualizations typically are either realized in a linear fashion as in genome browsers or by using a circular approach, where relationships between genomic regions are indicated by arcs. Both methods allow for the integration of additional information such as experimental data or annotations. However, providing a visualization that still allows for a quick and comprehensive interpretation of all important genomic variations together with various supplemental data, which may be highly heterogeneous, remains a challenge.</p>
<p>More at https://academic.oup.com/bioinformatics/article/28/12/i7/268598/GenomeRing-alignment-visualization-based-on</p><p>Address of the bookmark: <a href="http://it.informatik.uni-tuebingen.de/?page_id=185" rel="nofollow">http://it.informatik.uni-tuebingen.de/?page_id=185</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<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/bookmarks/view/31064/cgaln</guid>
	<pubDate>Wed, 22 Feb 2017 05:14:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31064/cgaln</link>
	<title><![CDATA[Cgaln]]></title>
	<description><![CDATA[<p>Cgaln (Coarse grained alignment) is a program designed to align a pair of whole genomic sequences of not only bacteria but also entire chromosomes of vertebrates on a nominal desktop computer. Cgaln performs an alignment job in two steps, at the block level and then at the nucleotide level. The former "coarse-grained" alignment can explore genomic rearrangements and reduce the regions to be analyzed in the next step. The latter is devoted to detailed alignment within the limited regions found in the first stage. The output of Cgaln is 'glocal' in the sense that rearrangements are taken into consideration while each alignable region is extended as long as possible. Thus, Cgaln is not only fast and memory-efficient, but also can filter noisy outputs without missing the most important homologous segment pairs.</p>
<p>http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</p><p>Address of the bookmark: <a href="http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/" rel="nofollow">http://www.iam.u-tokyo.ac.jp/chromosomeinformatics/rnakato/cgaln/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>