<?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/32379?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/related/32379?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</guid>
	<pubDate>Fri, 02 Nov 2018 08:16:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</link>
	<title><![CDATA[Ancestral Genomes: a resource for reconstructed ancestral genes and genomes across the tree of life]]></title>
	<description><![CDATA[<p><span>&nbsp;Ancestral Genomes (</span><a href="http://ancestralgenomes.org/" target="">http://ancestralgenomes.org</a><span>) is a resource for comprehensive reconstructions of these &lsquo;fossil genomes&rsquo;. Comprehensive sets of protein-coding genes have been reconstructed for 78 genomes of now-extinct species that were the common ancestors of extant species from across the tree of life.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ancestralgenomes.org/" rel="nofollow">http://ancestralgenomes.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5702/research-fellow-in-bioinformatics-queens-university-belfast-institute-for-global-food-security-school-of-biological-sciences</guid>
  <pubDate>Thu, 17 Oct 2013 04:33:02 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Fellow in Bioinformatics @  Queen's University Belfast -Institute for Global Food Security, School of Biological Sciences]]></title>
  <description><![CDATA[
<p>Ref: 13/102900</p>

<p>Available immediately until 30th November 2015, to work on the development of bioinformatics approaches to aid analysis of data derived from the metabolomic profiling of biological matrices. The successful applicant will lead research activities on an FP7 funded EU-wide collaborative project aimed at establishing biomarker-based strategies for high throughput diagnostic screening. Key tasks will involve multivariate analysis of large datasets, bioinformatic-based selection and validation of identified markers, construction of metabolomic spectral profile databases and development of machine learning/database searching approaches amenable to analytical screening techniques. This position will offer the opportunity to travel and undertake work with project collaborators based in the Republic of Ireland and Europe.</p>

<p>Informal enquiries may be directed to Dr Terry McGrath, email: terry.mcgrath@qub.ac.uk.</p>

<p>Anticipated interview date: Thursday 31st October 2013<br />Salary scale: £30,424 – £39,649 per annum (including contribution points)<br />Closing date: Monday 21st October 2013  </p>

<p>Telephone (028) 90973044 FAX: (028) 90971040 or e-mail on personnel@qub.ac.uk</p>

<p>The University is committed to equality of opportunity and to selection on merit.  It therefore welcomes applications from all sections of society and particularly welcomes applications from people with a disability. </p>

<p>Fixed term contract posts are available for the stated period in the first instance but in particular circumstances may be renewed or made permanent subject to availability of funding.</p>

<p>More @ https://hrwebapp.qub.ac.uk/tlive_webrecruitment/wrd/run/ETREC107GF.open?VACANCY_ID=5616943npO&amp;WVID=6273090Lgx&amp;LANG=USA</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42042/cluego-a-cytoscape-plug-in-that-visualizes-the-non-redundant-biological-terms-for-large-clusters-of-genes</guid>
	<pubDate>Thu, 13 Aug 2020 10:24:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42042/cluego-a-cytoscape-plug-in-that-visualizes-the-non-redundant-biological-terms-for-large-clusters-of-genes</link>
	<title><![CDATA[ClueGO: a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes]]></title>
	<description><![CDATA[<p>ClueGO is a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes in a functionally grouped network and it can be used in combination with GOlorize. The identifiers can be uploaded from a text file or interactively from a network of Cytoscape. The type of identifiers supported can be easely extended by the user. ClueGO performs single cluster analysis and comparison of clusters. From the ontology sources used, the terms are selected by different filter criteria. The related terms which share similar associated genes can be fused to reduce redundancy. The ClueGO network is created with kappa statistics and reflects the relationships between the terms based on the similarity of their associated genes. On the network, the node colour can be switched between functional groups and clusters distribution. ClueGO charts are underlying the specificity and the common aspects of the biological role. The significance of the terms and groups is automatically calculated. ClueGO is easy updatable with the newest files from Gene Ontology and KEGG.</p><p>Address of the bookmark: <a href="http://www.ici.upmc.fr/cluego/" rel="nofollow">http://www.ici.upmc.fr/cluego/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5947/jrf-national-jalma-institute-of-leprosy-and-other-mycobacterial-diseases</guid>
  <pubDate>Mon, 28 Oct 2013 10:42:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF @ NATIONAL JALMA INSTITUTE OF LEPROSY AND OTHER MYCOBACTERIAL DISEASES]]></title>
  <description><![CDATA[
<p>NATIONAL JALMA INSTITUTE OF LEPROSY AND OTHER MYCOBACTERIAL DISEASES</p>

<p>(INDIAN COUNCIL OF MEDICAL RESEARCH)</p>

<p>P.O BOX 101,<br />Dr. M. Miyazaki Marg,<br />Tajganj, Agra - 282001</p>

<p>Applications are invited for a walk-in interview to be held in the Seminar Hall of the on 15th November, 2013, 9:30 am for temporary positions of JRF, Lab Technician and Field attendant in a ICMR funded project entitled "Elucidating the strain differentiation and transmission dynamics of M. leprae through simple sequence repeats ISSR-PCR marker"</p>

<p>1. JRF (one Post)</p>

<p>    Essential qualification: Candidates with M.Sc/IVI.Tech or equivalent degree in any life science related subjects with UGC-CSIR/ICMR/DBT-Net qualified</p>

<p>    Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.</p>

<p>    Age. Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>    Emoluments: Rs. 6,000 + 20% HRA per Month</p>

<p>2. Lab Technician (One Post)</p>

<p>    Essential Qualification: 12th with DMLT/B.SCA4.SC in Life sciences</p>

<p>    Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.</p>

<p>    Age: Maximum 30 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>    Emoluments: Rs13,760/ Per Month</p>

<p>3. Field Attendant (One Post)</p>

<p>Essential Qualification: 10th Pass</p>

<p>Desirable Qualification: Experience in field work</p>

<p>Age: Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>Emoluments: Rsl2,040l Per Month</p>

<p>Terms: posts are purely temporary. Appointment will be initially made for a period of one (01) year and may be extended further based on the performance of the candidate up to completion of the project.</p>

<p>Application &amp; Selection procedure: candidates have to appear in the walk-in-interview in person along with an application/CV on plain paper giving details of at educational qualificationq experience and submit photocopies of relevant documents at the time of interview. Selection will be based on the performance of the candidate in the interview' Candidates will not be sent any interview call letter separately. No TA/DA will be paid to the candidate for appearing in the interview. selection is not possible without appearing in the interview. All candidates must report by 9:00am on the date of interview. Advance copy of CV may be sent to m.sarathipartha@gmail.com</p>

<p>Advertisement: http://www.jalma-icmr.org.in/P_S_M_advertisment.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43013/deg-50-a-database-of-essential-genes-in-both-prokaryotes-and-eukaryotes</guid>
	<pubDate>Tue, 30 Mar 2021 11:47:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43013/deg-50-a-database-of-essential-genes-in-both-prokaryotes-and-eukaryotes</link>
	<title><![CDATA[DEG 5.0: a database of essential genes in both prokaryotes and eukaryotes]]></title>
	<description><![CDATA[<p><span>Essential genes are those indispensable for the survival of an organism, and their functions are therefore considered a foundation of life. Determination of a minimal gene set needed to sustain a life form, a fundamental question in biology, plays a key role in the emerging field, synthetic biology. </span></p>
<p><span></span><span>DEG is freely available at the website&nbsp;</span><a href="http://tubic.tju.edu.cn/deg" target="_blank">http://tubic.tju.edu.cn/deg</a><span>&nbsp;or&nbsp;</span><a href="http://www.essentialgene.org/" target="_blank">http://www.essentialgene.org</a><span>.</span></p><p>Address of the bookmark: <a href="http://www.essentialgene.org/" rel="nofollow">http://www.essentialgene.org/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7815/post-doc-in-systems-genetics</guid>
  <pubDate>Wed, 08 Jan 2014 19:23:37 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post-doc in Systems Genetics]]></title>
  <description><![CDATA[
<p>Gagneur lab at Gene Center, Ludwig-Maximilians-Universitaet, Munich, Germany</p>

<p>Deadline for applications : January 15, 2014.</p>

<p>Description :</p>

<p>We seek a talented and motivated post-doc to develop computational methods for inferring the molecular basis of genetic diseases by integration of personal omics data. Research topics include: identifying causal mutations of rare disease patients by meta-analysis; inferring disease-causing molecular pathways from genotype, human phenotypes, and omics profile of patient-derived cell lines; and causal inference from longitudinal omics studies of patients. The developed methods will be applied to analyze data from our medical collaborators.</p>

<p>Candidates must either hold a PhD in computational biology or bioinformatics, or hold a PhD in physics, statistics, or applied mathematics with practical experience with high-dimensional data analysis. Experience in quantitative genetics is a plus. Applicants must have a proven publication record and an interest for translational research.</p>

<p>The Gagneur lab is a young, lively and multidisciplinary group with a research focus on systems genetics and gene regulation. It is located at the Gene Center of the LMU (University of Munich), an interdisciplinary institution whose 16 independent research groups investigate the regulation of gene expression at all levels - from the underlying molecular mechanisms to the biological system. The institute is located on the biomedical research campus Munich-Grosshadern, offering a dynamic, interactive and internationally oriented research environment. The dynamism of Munich and the proximity of the Alps provide an excellent quality of life.</p>

<p>The salary is according to the TV-L (German academic salary scale).<br />Applications including a cover letter, CV, and references must be sent by January 15th 2014 to Julien Gagneur (gagneur@genzentrum.lmu.de)</p>

<p>About the lab: http://www.gagneur.genzentrum.lmu.de</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</guid>
	<pubDate>Tue, 05 Mar 2024 00:23:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</link>
	<title><![CDATA[doubletrouble: identify duplicated genes from whole-genome protein sequences and classify]]></title>
	<description><![CDATA[<p><span>doubletrouble aims to identify duplicated genes from whole-genome protein sequences and classify them based on their modes of duplication. The duplication modes are i. segmental duplication (SD); ii. tandem duplication (TD); iii. proximal duplication (PD); iv. transposed duplication (TRD) and; v. dispersed duplication (DD). Transposon-derived duplicates (TRD) can be further subdivided into rTRD (retrotransposon-derived duplication) and dTRD (DNA transposon-derived duplication). If users want a simpler classification scheme, duplicates can also be classified into SD- and SSD-derived (small-scale duplication) gene pairs. Besides classifying gene pairs, users can also classify genes, so that each gene is assigned a unique mode of duplication. Users can also calculate substitution rates per substitution site (i.e., Ka and Ks) from duplicate pairs, find peaks in Ks distributions with Gaussian Mixture Models (GMMs), and classify gene pairs into age groups based on Ks peaks.</span></p><p>Address of the bookmark: <a href="https://bioconductor.org/packages/release/bioc/html/doubletrouble.html" rel="nofollow">https://bioconductor.org/packages/release/bioc/html/doubletrouble.html</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/7032/computer-experts-in-biotechnology-laboratory</guid>
	<pubDate>Wed, 04 Dec 2013 02:11:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/7032/computer-experts-in-biotechnology-laboratory</link>
	<title><![CDATA[Computer experts in biotechnology laboratory]]></title>
	<description><![CDATA[<p>Only bioinformatician can understand that <strong>multiplication</strong> and <strong>division</strong> are different but same thing :)</p><p><span>Disclaimer:</span>&nbsp;This cartoon is solely designed to create humour and fun, not to offend any computer experts.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/7032" length="35726" type="image/gif" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/36870/understanding-liftover</guid>
	<pubDate>Wed, 06 Jun 2018 10:00:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/36870/understanding-liftover</link>
	<title><![CDATA[Understanding liftOver !]]></title>
	<description><![CDATA[<p>LiftOver is a necesary step to bring all genetical analysis to the same reference build. LiftOver can have three use cases:</p><p>(1) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_genome_positions">Convert genome position from one genome assembly to another genome assembly</a></p><p>In most scenarios, we have known genome positions in NCBI build 36 (UCSC hg 18) and hope to lift them over to NCBI build 37 (UCSC hg19).</p><p>(2) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_dbSNP_rs_numbers">Convert dbSNP rs number from one build to another</a></p><p>(3) <a href="https://genome.sph.umich.edu/wiki/LiftOver#Lift_Merlin.2FPLINK_format">Convert both genome position and dbSNP rs number over different versions</a></p><p>Run:</p><pre>liftOver input.bed hg18ToHg19.over.chain.gz output.bed unlifted.bed</pre><p>The outformat is as follow:</p><pre>Deleted in new:
    Sequence intersects no chains
Partially deleted in new:
    Sequence insufficiently intersects one chain
Split in new:
    Sequence insufficiently intersects multiple chains
Duplicated in new:
    Sequence sufficiently intersects multiple chains
Boundary problem:
    Missing start or end base in an exon</pre><p>For example:</p><p>If you liftOver <span>chr4:6497-6497 from <span>hg19 to GRch38 </span>and it return "deleted in new". </span></p><p>It means chr4:6497-6497 is part of a genomic contig on hg19 that is not anymore mapped on GRch38 because the new assembly is now better built without including this contig.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/6380/hidden-markov-models-viterbi-algorithm-markov-chain-exploration-with-script</guid>
	<pubDate>Thu, 14 Nov 2013 13:36:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/6380/hidden-markov-models-viterbi-algorithm-markov-chain-exploration-with-script</link>
	<title><![CDATA[Hidden Markov Models, Viterbi Algorithm, Markov Chain Exploration with script]]></title>
	<description><![CDATA[<p><strong>Hidden Markov Models, the Viterbi Algorithm, and CpG Islands (in VB6)</strong></p><p><strong>Problem :</strong></p><p>The CG island is a stretch of DNA (usually longer than 200 bases) in which the frequency of the CG sequence is higher than other regions. It is also called the CpG island, where "p" simply indicates that "C" and "G" are connected by a phosphodiester bond.<br /><br />CpG islands are often located around the promoters of housekeeping genes (which are essential for general cell functions) or other genes frequently expressed in a cell. At these locations, the CG sequence is not methylated. By contrast, the CG sequences in inactive genes are usually methylated to suppress their expression. The methylated cytosine may be converted to thymine by accidental deamination. Unlike the cytosine to uracil mutation which is efficiently repaired, the cytosine to thymine mutation can be corrected only by the mismatch repair which is very inefficient. Hence, over evolutionary time scales, the methylated CG sequence will be converted to the TG sequence.</p><p>Find step wise explanationand implementation steps at <a href="http://dna.cs.byu.edu/bio465/Labs/hmm.shtml">http://dna.cs.byu.edu/bio465/Labs/hmm.shtml</a></p><p>Source code with explanation <a href="http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/">http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/</a></p><p>Fore detail understanding of HMM read this excellent tutorial <a href="http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf">http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf</a></p><p>Viterbi Algo at <a href="http://en.wikipedia.org/wiki/Viterbi_path">http://en.wikipedia.org/wiki/Viterbi_path</a></p><p>For firther reading Wiki page <a href="http://en.wikipedia.org/wiki/Hidden_Markov_model">http://en.wikipedia.org/wiki/Hidden_Markov_model</a></p><p>On CpG island paper and for indepth understanding <a href="http://www.biomedcentral.com/1471-2164/12/S2/S10">http://www.biomedcentral.com/1471-2164/12/S2/S10</a></p><p>&nbsp;</p><p>If you are more interested in exploring&nbsp;Markov Chain Exploration and understand it with graphical version please visit <a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1">http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1</a></p><p>Reference:</p><p>1.<a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1">http://www.planet-source-code.com</a></p><p>2. <a href="http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/">http://www.tannerhelland.com</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

</channel>
</rss>