<?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/2759?offset=520</link>
	<atom:link href="https://bioinformaticsonline.com/related/2759?offset=520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6559/ai-cadd-project-kerela-university</guid>
  <pubDate>Tue, 19 Nov 2013 17:48:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Ai-CADD Project @ Kerela University]]></title>
  <description><![CDATA[
<p>Applications are invited for the following Positions in the AiCADD project funded by MHRD Govt of India</p>

<p>Last Date for Submitting Application: 25th November 2013</p>

<p>1. Senior Scientist: (01 position)<br />Pay Scale: Rs.40, 000/-<br />Qualifications:  PhD/ Post Doctoral with Experience in CADD</p>

<p>2. Junior Scientist (10 positions)<br />Pay Scale: Rs. 22,000/-<br />Qualifications: MPhil / Masters Degree in Bioinformatics / Computational Biology / CADD / Ayurveda</p>

<p>3. Technical Assistant (01+01 positions)<br />Pay Scale: Rs.12,000/-<br />Qualifications: 1. BSc Computer Science/ MCA<br />Qualifications: 2. MSc Biotechnology / MSc Microbiology </p>

<p>4. Programmer (01 position)<br />Pay Scale: Rs.20,000/-<br />Qualifications: MSc Computer Science/ MCA / B Tech (Experience in MATLAB, C, C++) Industrial experience is desirable</p>

<p>5. Teaching Assistant (03 positions)<br />Pay Scale: Rs.10,000/-<br />Qualifications: MSc in Bioinformatics </p>

<p>6. Administration Assistant (02 positions)<br />Pay Scale: Rs.8,000/-<br />Qualifications: Degree + PGDCA</p>

<p>The Selection process comprises of written test and interview. Positions are purely temporary (initially for the period of one year) and co-terminus with the project. For more details mail to: cbi.uok [at] gmail.com</p>

<p>More detail @ https://sites.google.com/site/centreforbioinformatics/announcements/applicationsinvitedforapplicationforai-caddproject</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20508/15-highly-motivated-early-stage-researchers-esrsphd-positions</guid>
  <pubDate>Sun, 25 Jan 2015 05:23:53 -0600</pubDate>
  <link></link>
  <title><![CDATA[15 highly motivated Early Stage Researchers (ESRs)/PhD positions]]></title>
  <description><![CDATA[
<p>The MiND programme  looking for 15 highly motivated Early Stage Researchers (ESRs), researchers with a BSc or MSc degree within the first four years (full-time equivalent) of their research career</p>

<p> All applications sent before  2nd of February 2015.</p>

<p>http://www.mind-project.eu/career</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6577/scientist-b-vector-control-research-centre</guid>
  <pubDate>Tue, 19 Nov 2013 21:19:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist-B @ VECTOR CONTROL RESEARCH CENTRE]]></title>
  <description><![CDATA[
<p>VECTOR CONTROL RESEARCH CENTRE<br />(Indian Council of Medical Research)<br />Indira Nagar Medical Complex<br />Puducherry-605006</p>

<p>WALK-IN-INTERVIEW</p>

<p>The following vacancies shall be filled purely on adhoc basis under Non-Institutional adhoc project “Bioinformatics in ICMR Institutes” funded by Indian Council of Medical Research at Vector Control Research Centre, Puducherry, to be renewed annually and filled through Walk-in-Interview as indicated below. Candidates who wish to appear for the Walk-in-Interview can download the application format given in the website of Vector Control Research Centre (www.vcrc.res.in). Duly filled in application along with attested copies of certificate should be submitted at time of interview.</p>

<p>Date &amp; Time : 05.12.2013 at 9.00 AM – Scientist-C (Non-Medical)</p>

<p>05.12.2013 at 1.30 PM – Scientist-B (Non-Medical)<br />06.12.2013 at 9.00 AM – Technical Assistant (Research Assistant)<br />06.12.2013 at 1.30 PM – Multi Tasking Staff (General)</p>

<p>Place : Vector Control Research Centre, Puducherry</p>

<p>Project entitled : Biomedical Informatics Centres of ICMR</p>

<p>1. Scientist - C (Non-Medical) Number of post – ONE</p>

<p>Essential qualification</p>

<p>B.E./ B. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University with 6 years experience in the relevant field  OR</p>

<p>First class Master’s Degree and Ph.D. Degree in Bioinformatics/ Computational Biology from a recognized University OR</p>

<p>First class Master’s Degree in Bioinformatics/ Computational Biology from a recognized University with 4 years R &amp; D experience in the related subjects as mentioned above OR</p>

<p>Second class Master’s Degree + Ph.D. in Bioinformatics/ Computational Biology from a recognized University with 4 years research experience in bio-medical subjects</p>

<p>Age: Not exceeding 40 years Consolidated Salary – Rs.39,960/- p.m. + HRA as<br />admissible </p>

<p>Desirable qualification (i) Post-doctorate in Bioinformatics/ Computational Biology or M.E. / M. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University for candidates with First Class relevant degree.</p>

<p>(ii) Additional post-doctoral research / teaching experience in Bioinformatics/Computational Biology in recognized Institute(s).</p>

<p>(iii) Knowledge of computer applications or data management</p>

<p>Job requirements i) To apply Bioinformatics / Computational Biology tools in understanding interactions between vectors and parasites/ pathogens and target based development of drug / insecticides.</p>

<p>ii) To assist the investigators to carry out genomic studies on parasites/pathogens/vectors of vector borne diseases</p>

<p>Advertisement: http://vcrc.res.in/Adv_Bio13.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22891/17-marie-curie-phd-position-available-immediately</guid>
  <pubDate>Tue, 23 Jun 2015 06:52:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[17 Marie Curie PhD position available immediately]]></title>
  <description><![CDATA[
<p>Kindly look into following webpage:<br />http://medhealth.leeds.ac.uk/info/1450/scholarships/1795/marie_curie_phd_training_network</p>

<p>The closing date for application will be 26 June 2015.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6835/roslin-bioinformatics-group</guid>
  <pubDate>Mon, 25 Nov 2013 23:55:25 -0600</pubDate>
  <link></link>
  <title><![CDATA[Roslin Bioinformatics Group]]></title>
  <description><![CDATA[
<p>Roslin Bioinformatics Group</p>

<p>The Law group provides internal Institute-specific development, training and support roles for data manipulation, sequence analysis and any other aspect of the analysis of biological data using computer systems. Additionally we provide databases and applications supporting the international animal science community, particularly tools and resources for genome mapping.</p>

<p>Head: Andy Law. Members: John Bowman (animal facility database applications), Zen Lu (bioinformatics support), Trevor Paterson (software development)</p>

<p>More @ http://www.bioinformatics.ed.ac.uk/groups/roslin-bioinformatics-group</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34552/edit-distance-application-in-bioinformatics</guid>
	<pubDate>Thu, 07 Dec 2017 08:46:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34552/edit-distance-application-in-bioinformatics</link>
	<title><![CDATA[Edit distance application in bioinformatics !]]></title>
	<description><![CDATA[<p>There are other popular measures of&nbsp;<a href="https://en.wikipedia.org/wiki/Edit_distance" title="Edit distance">edit distance</a>, which are calculated using a different set of allowable edit operations. For instance,</p><ul>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance" title="Damerau&ndash;Levenshtein distance">Damerau&ndash;Levenshtein distance</a>&nbsp;allows insertion, deletion, substitution, and the&nbsp;<a href="https://en.wikipedia.org/wiki/Transposition_(mathematics)" title="Transposition (mathematics)">transposition</a>&nbsp;of two adjacent characters;</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" title="Longest common subsequence problem">longest common subsequence</a>&nbsp;(LCS) distance allows only insertion and deletion, not substitution;</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Hamming_distance" title="Hamming distance">Hamming distance</a>&nbsp;allows only substitution, hence, it only applies to strings of the same length.</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Jaro_distance" title="Jaro distance">Jaro distance</a>&nbsp;allows only&nbsp;<a href="https://en.wikipedia.org/wiki/Transposition_(mathematics)" title="Transposition (mathematics)">transposition</a>.</li>
</ul><p>&nbsp;</p><pre><span>use</span> Text<span>::</span>Levenshtein <span>qw</span><span>(</span>distance<span>);</span>

 <span>print</span> <span>distance</span><span>(</span><span>"foo"</span><span>,</span><span>"four"</span><span>);</span>
 <span># prints "2"</span>

 <span>my</span> <span>@words</span>     <span>=</span> <span>qw</span><span>/ four foo bar /</span><span>;</span>
 <span>my</span> <span>@distances</span> <span>=</span> <span>distance</span><span>(</span><span>"foo"</span><span>,</span><span>@words</span><span>);</span>

 <span>print</span> <span>"@distances"</span><span>;</span>
 <span># prints "2 0 3"</span><br /><br /><br /></pre><pre><span>use</span> Algorithm<span>::</span>LCSS <span>qw</span><span>(</span> LCSS CSS CSS_Sorted <span>);</span>
    <span>my</span> <span>$lcss_ary_ref</span> <span>=</span> <span>LCSS</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>  <span># ref to array</span>
    <span>my</span> <span>$lcss_string</span>  <span>=</span> <span>LCSS</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>    <span># string</span>
    <span>my</span> <span>$css_ary_ref</span> <span>=</span> <span>CSS</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>    <span># ref to array of arrays</span>
    <span>my</span> <span>$css_str_ref</span> <span>=</span> <span>CSS</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>      <span># ref to array of strings</span>
    <span>my</span> <span>$css_ary_ref</span> <span>=</span> <span>CSS_Sorted</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>  <span># ref to array of arrays</span>
    <span>my</span> <span>$css_str_ref</span> <span>=</span> <span>CSS_Sorted</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>    <span># ref to array of strings<br /><br /><br /><br /></span></pre><p>There are many different modules on CPAN for calculating the edit distance between two strings. Here's just a selection.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshteinXS">Text::LevenshteinXS</a>&nbsp;and&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3AXS">Text::Levenshtein::XS</a>&nbsp;are both versions of the Levenshtein algorithm that require a C compiler, but will be a lot faster than this module.</p><p>The Damerau-Levenshtein edit distance is like the Levenshtein distance, but in addition to insertion, deletion and substitution, it also considers the transposition of two adjacent characters to be a single edit. The module&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3ADamerau">Text::Levenshtein::Damerau</a>&nbsp;defaults to using a pure perl implementation, but if you've installed&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3ADamerau%3A%3AXS">Text::Levenshtein::Damerau::XS</a>&nbsp;then it will be a lot quicker.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3AWagnerFischer">Text::WagnerFischer</a>&nbsp;is an implementation of the Wagner-Fischer edit distance, which is similar to the Levenshtein, but applies different weights to each edit type.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ABrew">Text::Brew</a>&nbsp;is an implementation of the Brew edit distance, which is another algorithm based on edit weights.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3AFuzzy">Text::Fuzzy</a>&nbsp;provides a number of operations for partial or fuzzy matching of text based on edit distance.&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3AFuzzy%3A%3APP">Text::Fuzzy::PP</a>&nbsp;is a pure perl implementation of the same interface.</p><p><a href="http://search.cpan.org/perldoc?String%3A%3ASimilarity">String::Similarity</a>&nbsp;takes two strings and returns a value between 0 (meaning entirely different) and 1 (meaning identical). Apparently based on edit distance.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ADice">Text::Dice</a>&nbsp;calculates&nbsp;<a href="https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient">Dice's coefficient</a>&nbsp;for two strings. This formula was originally developed to measure the similarity of two different populations in ecological research.</p><pre><span>&nbsp;</span></pre>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7569/phd-at-university-of-calgary</guid>
  <pubDate>Fri, 27 Dec 2013 20:24:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD at University of Calgary]]></title>
  <description><![CDATA[
<p>Institution/Company: <br />University of Calgary<br />Location: <br />Calgary, AB<br />Job Description: </p>

<p>Novel diagnostic platform for detection of Osteoarthritis</p>

<p>I invite applications from highly motivated individuals to join my laboratory as a PhD student in Systems Biology at the University of Calgary McCaig Institute for Bone and Joint Health. This project is aimed at characterizing the networks of physical (protein-protein) interactions underlying inflammatory processes in patients with Osteoarthritis and how this differs from patients with Rheumatoid Arthritis and normal individuals. This work will eventually lead to the development of a novel diagnostic platform for the non-invasive and accurate detection of early Osteoarthritis. The selected candidate will use state-of-the-art computational methodologies to systematically analyze proteomic data, and develop /implement new algorithms to identify protein and functional interaction networks from high throughput experimental data. The individual will also benefit by working closely with experts at the UofC and UofA through an AIHS Alberta Osteoarthritis Team Grant which includes experts from all pillars of health research. The candidate will also be supported to attend bioinformatics workshops and conferences to advance and disseminate their research.<br />Qualifications: The ideal candidate will have a Master’s degree in Computational Biology, Bioinformatics, or equivalent with strong background knowledge of the Biological Sciences, Biochemistry, and Microbiology. The individual should additionally have experience in handling high-throughput data sets as well as programming skills. The candidate will be registered as a PhD student in Dr. Krawetz’s laboratory, located in the new state-of-the-art Health Research Innovation Centre at the UofC. The individual will have strong verbal and written skills and the ability to work efficiently in a team environment.</p>

<p>In addition to the outstanding research opportunities available in this setting, students also enjoy the many cultural and sporting amenities provided in the city of Calgary, and can take advantage of the unparalleled skiing and hiking in the Rocky Mountains that are less than an hour away.</p>

<p>Candidates must be academically competitive and will be expected to apply for external funding. The stipend is $25,000/yr. For outstanding PhD students, internal top-up award opportunities are available on a competitive basis. If interested in joining the lab, please contact Dr. Krawetz directly at rkrawetz@ucalgary.ca and provide the following information:</p>

<p>- Short cover letter explaining your interest in the lab<br />- Resume<br />- Scanned copy of transcript or listing of course grades<br />- Names and contact information for two individuals who will be willing to provide letters of reference</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35534/awk-for-bioinformatician-and-computational-biologist</guid>
	<pubDate>Tue, 06 Feb 2018 14:54:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35534/awk-for-bioinformatician-and-computational-biologist</link>
	<title><![CDATA[Awk for Bioinformatician and computational biologist]]></title>
	<description><![CDATA[<p>Awk is a programming language which allows easy manipulation of structured data and is mostly used for pattern scanning and processing. It searches one or more files to see if they contain lines that match with the specified patterns and then perform associated actions. The basic syntax is:</p><blockquote><p><br />awk '/pattern1/ {Actions}<br /> /pattern2/ {Actions}' file</p></blockquote><p><br />The working of Awk is as follows<br />Awk reads the input files one line at a time.<br />For each line, it matches with given pattern in the given order, if matches performs the corresponding action.<br />If no pattern matches, no action will be performed.<br />In the above syntax, either search pattern or action are optional, But not both.<br />If the search pattern is not given, then Awk performs the given actions for each line of the input.<br />If the action is not given, print all that lines that matches with the given patterns which is the default action.<br />Empty braces with out any action does nothing. It wont perform default printing operation.<br />Each statement in Actions should be delimited by semicolon.<br />Say you have data.tsv with the following contents:</p><p><br />$ cat data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />By default Awk prints every line from the file.</p><p><br />$ awk '{print;}' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />We print the line which matches the pattern contig3</p><p><br />$ awk '/contig3/' data/test.tsv<br />contig3 ACTTATATATATATA<br />Awk has number of builtin variables. For each record i.e line, it splits the record delimited by whitespace character by default and stores it in the $n variables. If the line has 5 words, it will be stored in $1, $2, $3, $4 and $5. $0 represents the whole line. NF is a builtin variable which represents the total number of fields in a record.</p><p><br />$ awk '{print $1","$2;}' data/test.tsv<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT</p><p>$ awk '{print $1","$NF;}' data/test.tsv<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT</p><p><br />Awk has two important patterns which are specified by the keyword called BEGIN and END. The syntax is as follows:</p><blockquote><p>BEGIN { Actions before reading the file}<br />{Actions for everyline in the file} <br />END { Actions after reading the file }</p></blockquote><p><br />For example,<br />$ awk 'BEGIN{print "Header,Sequence"}{print $1","$2;}END{print "-------"}' data/test.tsv<br />Header,Sequence<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT<br />------- <br />We can also use the concept of a conditional operator in print statement of the form print CONDITION ? PRINT_IF_TRUE_TEXT : PRINT_IF_FALSE_TEXT. For example, in the code below, we identify sequences with lengths &gt; 14:</p><p>$ awk '{print (length($2)&gt;14) ? $0"&gt;14" : $0"&lt;=14";}' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG&gt;14<br />contig2 ACTTTATATATT&lt;=14<br />contig3 ACTTATATATATATA&gt;14<br />contig4 ACTTATATATATATA&gt;14<br />contig5 ACTTTATATATT&lt;=14<br />We can also use 1 after the last block {} to print everything (1 is a shorthand notation for {print $0} which becomes {print} as without any argument print will print $0 by default), and within this block, we can change $0, for example to assign the first field to $0 for third line (NR==3), we can use:</p><p>$ awk 'NR==3{$0=$1}1' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT<br />You can have as many blocks as you want and they will be executed on each line in the order they appear, for example, if we want to print $1 three times (here we are using printf instead of print as the former doesn't put end-of-line character),</p><p>$ awk '{printf $1"\t"}{printf $1"\t"}{print $1}' data/test.tsv<br />contig1 contig1 contig1<br />contig2 contig2 contig2<br />contig3 contig3 contig3<br />contig4 contig4 contig4<br />contig5 contig5 contig5 <br />Although, we can also skip executing later blocks for a given line by using next keyword:</p><p>$ awk '{printf $1"\t"}NR==3{print "";next}{print $1}' data/test.tsv<br />contig1 contig1<br />contig2 contig2<br />contig3 <br />contig4 contig4<br />contig5 contig5</p><p>$ awk 'NR==3{print "";next}{printf $1"\t"}{print $1}' data/test.tsv<br />contig1 contig1<br />contig2 contig2</p><p>contig4 contig4<br />contig5 contig5<br />You can also use getline to load the contents of another file in addition to the one you are reading, for example, in the statement given below, the while loop will load each line from test.tsv into k until no more lines are to be read:</p><p>$ awk 'BEGIN{while((getline k &lt;"data/test.tsv")&gt;0) print "BEGIN:"k}{print}' data/test.tsv<br />BEGIN:contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />BEGIN:contig2 ACTTTATATATT<br />BEGIN:contig3 ACTTATATATATATA<br />BEGIN:contig4 ACTTATATATATATA<br />BEGIN:contig5 ACTTTATATATT<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />You can also store data in the memory with the syntax VARIABLE_NAME[KEY]=VALUE which you can later use through for (INDEX in VARIABLE_NAME) command:</p><p>$ awk '{i[$1]=1}END{for (j in i) print j"&lt;="i[j]}' data/test.tsv<br />contig1&lt;=1<br />contig2&lt;=1<br />contig3&lt;=1<br />contig4&lt;=1<br />contig5&lt;=1</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7215/postdoc-positions-in-computational-biology-center-for-genomic-science-milan-italy</guid>
  <pubDate>Thu, 12 Dec 2013 18:34:47 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoc positions in computational biology - Center for Genomic Science - Milan, Italy]]></title>
  <description><![CDATA[
<p>Job Description: three postdoc positions in computational biology are available at the Center for Genomic Science in Milan (Italy):</p>

<p>- Development of computational methods to investigate the interplay between epigenetic and genetic layers and their role in tumor progression, by integrating genomic, epigenomic and transcriptional data. PI: Mattia Pelizzola (http://tiny.cc/comEpi)<br />- Epigenome and transcriptome analysis in mouse models of Hepatocellular Carcinoma. PI: Bruno Amati - Small and long non-coding RNAs in cancer stem cells. PI: Francesco Nicassio</p>

<p>All projects will benefit from the availability of both in-house and publicly available next-generation sequencing datasets. Familiarity with Linux environment, programming skills (especially in R) and a background in either computational biology, or physics/engineering/math will be advantageous.</p>

<p>Deadline for the application January 6th, to apply: http://genomics.iit.it/resources.html</p>

<p>Start date: March 1st, 2014</p>

<p>Duration: 1+2 years</p>

<p>Contact Person (Referent): Mattia Pelizzola</p>

<p>Ref. E-Mail: mattia.pelizzola@iit.it</p>

<p>Tel: 0039-02-94375058<br />Group Web Page: http://genomics.iit.it</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/36483/popular-bioinformatics-educational-resources</guid>
	<pubDate>Fri, 04 May 2018 19:43:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/36483/popular-bioinformatics-educational-resources</link>
	<title><![CDATA[Popular bioinformatics educational resources !]]></title>
	<description><![CDATA[<p>Followings are the list of popular bioinformatics educational resources</p><p><a href="http://Bii.a-star.edu.sg"><strong>Bii.a-star.edu.sg</strong></a></p><p>Bio research and development. Has course information and research information.</p><p><a href="http://Isb-sib.ch"><strong>Isb-sib.ch</strong></a></p><p>SIB operates the ExPASy proteomics server and the Swiss node of EMBnet. Teaching activities include a series of post-graduate courses given at the Universities of Geneva and Lausanne, as well as at the EPFL, and a Masters Degree in bioinformatics. Major research areas include the development of integrated databases and software resources in the field of proteomics.</p><p><a href="http://Bioinformatics.ca"><strong>Bioinformatics.ca</strong></a></p><p>Provides information about bioinformatics in Canada. Workshops, certification and resources.</p><p><a href="http://Chickscope.beckman.uiuc.edu"><strong>Chickscope.beckman.uiuc.edu</strong></a></p><p>Students raise chicken embryos in the classroom and obtain magnetic resonance images through the Internet.</p><p><a href="http://Bcb.iastate.edu"><strong>Bcb.iastate.edu</strong></a></p><p>Graduate program at Iowa State University offering Undergraduate Major (BCBio) and the PhD program (BCB).</p><p><a href="http://Bu.edu/bioinformatics/"><strong>Bu.edu/bioinformatics/</strong></a></p><p>Interdisciplinary PhD and Masters Programs that include an internship in the local industry companies. In conjunction with the NE masters program.</p><p><a href="http://Bioinformatics.ubc.ca"><strong>Bioinformatics.ubc.ca</strong></a></p><p>A computational biology research centre covering many areas of genomics, proteomics, computer science and statistics. Research, training, news and events, resources and support, director's message, faculty and personnel.</p><p><a href="http://Openhelix.com"><strong>Openhelix.com</strong></a></p><p>Provides onsite training on specific bioinformatics databases and tools. Also offers bioinformatic software testing and research consulting services.</p><p><a href="http://Igb.uci.edu"><strong>Igb.uci.edu</strong></a></p><p>Specializing in making publicly available software and database services for computational biology.</p><p><a href="http://Bioinformatics.pe.kr"><strong>Bioinformatics.pe.kr</strong></a></p><p>Maintained by Dr. Seyeon Weon, Korea providing information on courses, a database archive, software archive and online resources.</p><p><a href="http://Groups.yahoo.com/group/bimatics/"><strong>Groups.yahoo.com/group/bimatics/</strong></a></p><p>Bioinformatics group for students interested and/or working in the bioinformatics/computationalbiology fields. Offers opportunities to exchanging information and sharing ideas.</p><p><a href="http://Ncbi.nlm.nih.gov/books/NBK22183/"><strong>Ncbi.nlm.nih.gov/books/NBK22183/</strong></a></p><p>Information about several medically important genes and related diseases. Illustrates the use of bioinformatics in their study.</p><p><a href="http://Bioinfo.mbb.yale.edu/mbb452a/2003/"><strong>Bioinfo.mbb.yale.edu/mbb452a/2003/</strong></a></p><p>Bioinformatics course at Yale University. All course slides are available online.</p><p><a href="http://Cs.iastate.edu/~honavar/comp-bio-courses.html"><strong>Cs.iastate.edu/~honavar/comp-bio-courses.html</strong></a></p><p>Listing of computational molecular biology course pages that have extensive online course materials.</p><p><a href="http://Bioinf.manchester.ac.uk/dbbrowser/bioactivity/prefacefrm.html"><strong>Bioinf.manchester.ac.uk/dbbrowser/bioactivity/prefacefrm.html</strong></a></p><p>A web-based tutorial associated with "Introduction to bioinformatics" published by Addison Wesley Longman.</p><p><a href="http://Northeastern.edu/bioinformatics/"><strong>Northeastern.edu/bioinformatics/</strong></a></p><p>From the Biology department and in cooperation with Boston University. Emphasis on the ability to integrate knowledge from biological, computational, and mathematical disciplines.</p><p><a href="http://Biocomp.unibo.it/lsbioinfo/"><strong>Biocomp.unibo.it/lsbioinfo/</strong></a></p><p>A two year, international master's programme in bioinformatics at the Universita di Bologna, Italy.</p><p><a href="http://Cs.helsinki.fi/bioinformatiikka/mbi/programme.html"><strong>Cs.helsinki.fi/bioinformatiikka/mbi/programme.html</strong></a></p><p>A two year Masters Degree Programme in Bioinformatics (MBI) offered by the University of Helsinki and Helsinki University of Technology, Finland.</p><p><a href="http://Ornl.gov/sci/techresources/Human_Genome/education/education.shtml"><strong>Ornl.gov/sci/techresources/Human_Genome/education/education.shtml</strong></a></p><p>A resource for introductory information on the Human Genome Project.</p><p><a href="http://His.se/bioinformatics"><strong>His.se/bioinformatics</strong></a></p><p>A one-year, international master's programme in bioinformatics at the University of Skovde, Sweden.</p><p><a href="http://Members.tripod.com/C.elegans/"><strong>Members.tripod.com/C.elegans/</strong></a></p><p>Resources in biochemical, molecular, cellular, system, and organism biology, including over 25,000 indexed links, accumulated since 2000, from topic menus or from search interface.</p><p><a href="http://Bioinformatics.org/faq/#contents"><strong>Bioinformatics.org/faq/#contents</strong></a></p><p>Summary of basics of bioinformatics for the intelligent newcomer.</p><p><a href="http://Jiscmail.ac.uk/archives/bioinformatics.html"><strong>Jiscmail.ac.uk/archives/bioinformatics.html</strong></a></p><p>Forum featuring various aspects, events and developments in the bioinformatics field.</p><p><a href="http://Biinoida.blogspot.com"><strong>Biinoida.blogspot.com</strong></a></p><p>Blog focusing on bioinformatics, biotechnology, pharma regulatory affairs, IPR and clinical trials.</p><p><a href="http://Colorbasepair.com/bioinformatics_courses_tutorials.html"><strong>Colorbasepair.com/bioinformatics_courses_tutorials.html</strong></a></p><p>A list of on-line course materials and tutorials for bioinformatics and computational biology.</p><p><a href="http://Geospiza.com/education/"><strong>Geospiza.com/education/</strong></a></p><p>Instructional materials for teaching bioinformatics. These include animated tutorials on topicssuch as BLAST, finding mutations in a protein, and graphing with MS-Excel.</p><p><a href="http://Bioinformatics.fi"><strong>Bioinformatics.fi</strong></a></p><p>An international, two-year Master's programme jointly managed by the University of Tampere and the University of Turku, Finland.</p><p><a href="http://Perlsource.net"><strong>Perlsource.net</strong></a></p><p>Provides online courses in Perl programming for bioinformatic tools.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>