<?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=900</link>
	<atom:link href="https://bioinformaticsonline.com/related/2759?offset=900" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5957/assistant-professor-in-molecular-synthesis-for-drug-discovery-and-development-cbmr-lucknow</guid>
  <pubDate>Wed, 30 Oct 2013 06:42:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor in Molecular Synthesis for Drug Discovery and Development @ CBMR, Lucknow]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT FOR FACULTY POSITIONS AT CENTRE OF BIOMEDICAL RESEARCH (CBMR), LUCKNOW</p>

<p>Details of the Positions and Pay Structure:</p>

<p>03 Posts for Assistant Professor in Molecular Synthesis for Drug Discovery and Development</p>

<p>Essential Qualifications and Requirements:</p>

<p>1. PhD in Synthetic Organic Chemistry/Medicinal Chemistry with research publications in high quality international journals and first class grade at the preceding degree from recognised University/Institute in India or abroad with consistently good academic record.<br />2. Three Yrs of Post-doctoral experience in relevant area.<br />3. Below 35 Yrs of age at the time of application</p>

<p>Desirable Experience: Candidates having strong research background in organic synthesis, total synthesis of structurally complex and medicinally important natural products/drugs related to cancer, neurodegenerative diseases (neurotropically active molecules for Alzheimer's, Parkinson’s, dementia etc) and infectious diseases such as malaria, TB etc. will be preferred.</p>

<p>Interested candidates may apply with:</p>

<p>1. Filled up Application Form (download from CBMR Website: http://www.cbmr.res.in) along with the Cover Letter, Curriculum Vitae including academic record (Bachelor degree onwards), awards, honours, list of Publications and reprints of 5 best publications.<br />2. Proposed research plan (max 3-4 pages).<br />3. Names and address (with valid e-mail and Phone number) of at least 3 academic referees.<br />4. Online Payment Receipt with transaction reference no. of Rs. 1000/- (USD 100 or equivalent foreign currency) on following details.<br />Account Number: 30054847814 Name: Director, Centre of Biomedical Research<br />Bank: STATE BANK OF INDIA, SGPGI Campus Branch, LUCKNOW</p>

<p>IFSC Code: SBIN0007789<br />MICR No: 22602034</p>

<p>Applications can be sent by registered/speed post or by e-mail to the following address:</p>

<p>The Director,<br />Centre of Biomedical Research (CBMR),<br />Sanjay Gandhi PGI Campus,<br />Raebareli Road, Lucknow-226014<br />e-mail: cbmr.admin@cbmr.res.in,<br />gp.pandey@cbmr.res.in</p>

<p>More Info:</p>

<p>http://www.cbmr.res.in/career/Advertisement%20for%20the%20post%20of%20Professors%20and%20Assistant%20Professors.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6131/rehmsmeier-group</guid>
  <pubDate>Sat, 09 Nov 2013 20:07:07 -0600</pubDate>
  <link></link>
  <title><![CDATA[Rehmsmeier group]]></title>
  <description><![CDATA[
<p>"Our research focuses on understanding development, gene regulation, and epigenetics on a genome-wide scale, in the context of evolution. This involves the design and application of algorithms, statistics, and experimental approaches."</p>

<p>http://www.bccs.uni.no/units/cbu/research/rehmsmeier/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24041/junior-bioinformatic-position</guid>
  <pubDate>Wed, 26 Aug 2015 05:35:28 -0500</pubDate>
  <link></link>
  <title><![CDATA[Junior Bioinformatic position]]></title>
  <description><![CDATA[
<p>Junior Bioinformatic position in the laboratory of Inflammation and immunology in cardiovascular pathologies at Humanitas:</p>

<p>We are seeking a highly motivated young PhD student with strong interest in high throughput data analysis.<br />Detailed descriptions of our recent research activities may be found here:<br />http://www.humanitas-research.org/condorelli-gianluigi-md-phd/</p>

<p>Position is available starting from October/November. A probationary period of one month will be required.<br /> <br />Please send a CV along with a cover letter stating the reasons for applying and contact details of one or more referees to Dr. Paolo Kunderfranco (paolo.kunderfranco@humanitasresearch.it).</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9675/application-scientist-in-strand-lifesciences-bangalore</guid>
  <pubDate>Mon, 07 Apr 2014 08:17:32 -0500</pubDate>
  <link></link>
  <title><![CDATA[Application Scientist in Strand LifeSciences Bangalore]]></title>
  <description><![CDATA[
<p>Job Description<br />We are looking for a motivated application scientist to help evaluate, compare, and develop next generation sequencing (NGS) data analysis methods. The successful candidate should be able to quickly understand the state-of-art computational biology techniques, prototype them and perform benchmarking studies. The candidate must also be comfortable working with people from different disciplines and be able to present data analysis results in a clear and effective manner. The candidate is also expected to interact with customers as needed, write technical reports and publish new methods and/or data analysis findings in public forums.</p>

<p>Candidate Requirements:<br />A PhD in computer science, computational biology, Bioinformatics, or a related field, along with sufficient programming skills for prototyping. Experience with next generation sequencing data analysis is required. Candidates with MS degree but with relevant work experience can also be considered. </p>

<p>To Apply<br />To apply, please send your updated CV and cover letter to Dr. Rohit Gupta (rohit@strandls.com). </p>

<p>Source: http://www.strandls.com/application-scientist</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6268/project-fellow-national-institute-of-malaria-research</guid>
  <pubDate>Tue, 12 Nov 2013 07:40:51 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow @ National Institute of Malaria Research]]></title>
  <description><![CDATA[
<p>National Institute of Malaria Research</p>

<p>Sector 8, Dwarka, Delhi -110077</p>

<p>WALK IN INTERVIEW</p>

<p>One position of project fellow is to be filled up in a DRL- funded research project on Molecular and morphological characterization of An. fluviatilis in North-eastern states and bordering areas. The position is purely temporary for one year and can be extended</p>

<p>Essential qualifications</p>

<p>Master’s degree in any branch of Life Sciences with hands on experience in molecular biology and/or bioinformatics.</p>

<p>Age limit: 28 years, (relaxation for SC/ST/OBC candidates as per government of India rules)</p>

<p>Stipend: Rs.12, 000.00 per month (fixed)</p>

<p>Eligible candidates may walk in for an interview on 15 November 2013 at 11 AM at the above mentioned address along with a copy of CV (with a passport size photograph affixed), photocopies of all mark sheets/certificates and originals (for verifications). No TA/DA will be paid for attending the interview .Registration of candidates will start at 10:00AM and end at 10:45 AM.</p>

<p>Advertisement: http://www.mrcindia.org/vacancy/add-4.doc</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/researchlabs/view/6560/the-graveley-lab</guid>
  <pubDate>Tue, 19 Nov 2013 18:02:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[The Graveley Lab]]></title>
  <description><![CDATA[
<p>Research in the Graveley lab is primarily focused on the regulation of alternative splicing and small RNA mediated gene regulation. These are fascinating and extraordinarily important mechanisms by which genes can be regulated. Our long-term goals are to understand how these processes are regulated at a mechanistic level and to understand the logic of these processes in significant biological settings. To achieve these goals, we strive to think outside the box to creatively attack the problems being addressed using a wide variety of approaches that include biochemistry, genetics, imaging, deep sequencing, large-scale RNAi screening and bioinformatics.</p>

<p>Lab page @ http://graveleylab.cam.uchc.edu/Graveley/index.html</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/opportunity/view/7153/phd-student-in-computational-systems-biology</guid>
  <pubDate>Tue, 10 Dec 2013 18:46:05 -0600</pubDate>
  <link></link>
  <title><![CDATA[Ph.D. student in Computational Systems Biology]]></title>
  <description><![CDATA[
<p>Ph.D. student in Computational Systems Biology</p>

<p>Location : The Luxembourg Centre for Systems Biomedicine (LCSB) at the University of Luxembourg, Luxembourg, Luxembourg<br />Deadline for applications : unknown.<br />Description :</p>

<p>The Luxembourg Centre for Systems Biomedicine (LCSB) was created within the Health Technologies Initiative from the Government of Luxembourg as one of the research priorities of the University of Luxembourg. The LCSB is an Interdisciplinary Centre of the University that combines experimental and computational approaches to analyse complex biological systems and disease processes. The Computational Biology Group (CBG) provides the LCSB with a solid infrastructure in developing theoretical framework for computational modeling on biomedical problems, especially in the area of network biology in the context of cellular programming/reprogramming. The CBG group includes researchers with theoretical, computational and wet lab backgrounds, thereby providing an unusually interdisciplinary environment.<br />The Computational Biology Group seeks a highly-skilled Ph.D. student to work on an exciting project on reconstruction and analysis of an integrated gene regulatory network model to elucidate key mechanisms of cellular reprogramming. The model will rely on the integration and mining of diverse transcriptomics and epigenomics data of different cell types from the Central Nervous System. The Ph.D. student is expected to collaborate with other members of the CBG to develop a computational methodology aiming at designing, in-silico, cellular reprogramming events, with a focus on the nervous system. This project will be carried out in collaboration with Prof. Noel Buckleys lab at Kings College London.<br />Requirements of the ideal candidate:<br />Master degree in Bioinformatics, Computer Science, Biology or a related discipline<br />Prior experience in mathematical modelling of biological networks, especially in network inference and analysis<br />Excellent working knowledge in English.<br />.<br />We offer:<br />Full contract for Ph.D. student for three years with possibility of renewal<br />Opportunity to do applied research to medical problems within a highly dynamic research institution (LCSB) and in collaboration with internationally recognized partners<br />An exciting international environment<br />A very competitive salary</p>

<p>For further information, please contact:</p>

<p>Prof. Dr. Antonio del Sol<br />E-mail: antonio.delsol@uni.lu</p>

<p>Applications should contain the following documents:<br />A detailed curriculum vitae<br />cover letter mentioning the reference number<br />description of past research experience and future interests<br />name and addresses of three referees</p>

<p>All applications should be sent preferably in electronic version until December 31st, 2013 to the following address:</p>

<p>Luxembourg Centre for Systems Biomedicine (LCSB)<br />University of Luxembourg<br />7, avenue des Hauts-Fourneaux<br />L-4362 Esch-sur-Alzette<br />Tel: +352-466644-6982 (Office)<br />Email: antonio.delsol@uni.lu<br />http://www.lcsb.lu</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>

</channel>
</rss>