<?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/30966?offset=830</link>
	<atom:link href="https://bioinformaticsonline.com/related/30966?offset=830" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13338/protein-function-annotation-and-machine-learning-upmc-paris-france</guid>
  <pubDate>Sat, 02 Aug 2014 01:22:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Protein function annotation and machine learning - UPMC - Paris, France]]></title>
  <description><![CDATA[
<p>Protein function annotation and machine learning - UPMC - Paris, France</p>

<p>Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.</p>

<p>We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.</p>

<p>Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>Start date: September 1st, 2014<br />Contact Person: Alessandra Carbone<br />Contact: alessandra.carbone@lip6.fr</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</guid>
	<pubDate>Wed, 25 Apr 2018 04:53:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</link>
	<title><![CDATA[Protein-Protein Interaction Sites Predictions !]]></title>
	<description><![CDATA[<p><span>The study of Protein&ndash;Protein Interactions (PPIs) has a crucial role in biology, medicine and the pharmaceutical industry. PPIs can be investigated from two aspects: The interaction partners of a specific protein and the amino acid residues participating in a given PPI. Information about a protein&rsquo;s interaction partners allows scientists to construct protein interaction networks, such as signaling pathways, which in turn facilitate the understanding of many biological and clinical observations.&nbsp;</span></p><p><span>Following are the list of tools commonly used to PPIs predictions:</span></p><p>Protein-Protein Interaction Sites</p><p><a href="http://pipe.scs.fsu.edu/ppisp.html" target="_blank">PPISP</a></p><p>A consensus neural network method for predicting protein-protein interaction sites</p><p><a href="http://biunit.naist.jp/homcos/" target="_blank">HOMCOS</a></p><p>A server to predict interacting protein pairs and interacting sites by homology modeling of complex structures</p><p><a href="http://prism.ccbb.ku.edu.tr/hotpoint/" target="_blank">HotPOINT</a></p><p>Prediction of protein interfaces using an empirical model</p><p><a href="http://cubic.bioc.columbia.edu/services/isis/" target="_blank">ISIS</a></p><p>Prediction of interaction hotspots from sequence</p><p><a href="http://kfc.mitchell-lab.org/" target="_blank">KFC server</a></p><p>Automated decision-tree approach to predicting protein-protein interaction hot spots</p><p><a href="http://pipe.scs.fsu.edu/meta-ppisp.html" target="_blank">meta-PPISP</a></p><p>A meta server for predicting protein-protein interaction sites. meta-PPISP is built on three individual web servers:&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#cons">cons-PPISP</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pin">PINUP</a>, and&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pro">Promate</a></p><p><a href="http://www.molsoft.com/oda.html" target="_blank">ODA</a></p><p>Identification of optimal surface patches with the lowest docking desolvation energy values</p><p><a href="http://sparks.informatics.iupui.edu/PINUP/" target="_blank">PINUP</a></p><p>Protein binding site prediction with an empirical scoring function</p><p>Other Sites (DNA, RNA, Metals)</p><p><a href="http://ligin.weizmann.ac.il/~lpgerzon/mbs4/mbs.cgi" target="_blank">CHED</a>&nbsp;</p><p>Web server for predicting soft metal binding sites in proteins</p><p><a href="http://cssb.biology.gatech.edu/skolnick/webservice/DBD-Hunter/" target="_blank">DBD-Hunter</a></p><p>A knowledge-based method for the prediction of DNA-protein interactions</p><p><a href="http://pipe.scs.fsu.edu/displar.html" target="_blank">DISPLAR</a></p><p>Given the structure of a protein known to bind DNA, the method predicts residues that contact DNA using neural network method</p><p><a href="http://idbps.tau.ac.il/" target="_blank">iDBPs</a></p><p>Predicts DNA binding proteins for proteins with known 3D structure.</p><p><a href="http://pfp.technion.ac.il/" target="_blank">PFplus</a></p><div style="text-align: left;">A tool for extracting and displaying positive electrostatic patches on protein surfaces which can be indicative of nucleic acid binding interfaces.</div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</guid>
	<pubDate>Sun, 10 Aug 2014 03:01:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</link>
	<title><![CDATA[Swabs to Genomes: A Comprehensive Workflow]]></title>
	<description><![CDATA[<p>The sequencing, assembly, and basic analysis of microbial genomes, once a painstaking and expensive undertaking, has become almost trivial for research labs with access to standard molecular biology and computational tools. However, there are a wide variety of options available for DNA library preparation and sequencing, and inexperience with bioinformatics can pose a significant barrier to entry for many who may be interested in microbial genomics. The objective of the present study was to design, test, troubleshoot, and publish a simple, comprehensive workflow from the collection of an environmental sample (a swab) to a published microbial genome; empowering even a lab or classroom with limited resources and bioinformatics experience to perform it.</p><p>Address of the bookmark: <a href="https://peerj.com/preprints/453.pdf" rel="nofollow">https://peerj.com/preprints/453.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36508/mitobim-mitochondrial-baiting-and-iterative-mapping</guid>
	<pubDate>Tue, 08 May 2018 04:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36508/mitobim-mitochondrial-baiting-and-iterative-mapping</link>
	<title><![CDATA[MITObim - mitochondrial baiting and iterative mapping]]></title>
	<description><![CDATA[<p>This document contains instructions on how to use the MITObim pipeline described in Hahn et al. 2013. The full article can be found&nbsp;<a href="http://nar.oxfordjournals.org/content/41/13/e129" title="MITObim full article at NAR">here</a>. Kindly cite the article if you are using MITObim in your work. The pipeline was originally developed for&nbsp;<span>Illumina</span>&nbsp;data, but thanks to the versatility of the MIRA assembler, MITObim supports in principle also data from the&nbsp;<span>Iontorrent</span>,&nbsp;<span>454</span>&nbsp;and&nbsp;<span>PacBio</span>&nbsp;sequencing platforms.</p>
<p>Below you can find a few basic tutorials for how to run MITObim and I encorage you to give them a try with the testdata that comes with this Repo, just to make sure everything is running smoothly on your system. It'll only take a few minutes and will potentially safe you a lot of time down the line.</p>
<p>I provide further examples&nbsp;<a href="https://github.com/chrishah/MITObim/tree/master/examples">here</a>&nbsp;as Jupyter notebooks. Get in touch if you feel like sharing your particular MITObim solution and I'd be happy to put it up here, too!</p><p>Address of the bookmark: <a href="https://github.com/chrishah/MITObim" rel="nofollow">https://github.com/chrishah/MITObim</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14050/assistant-professor-in-bioinformatics-at-indian-institute-of-technology-delhi</guid>
  <pubDate>Fri, 15 Aug 2014 06:16:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor 	in Bioinformatics at Indian Institute of Technology Delhi]]></title>
  <description><![CDATA[
<p>Indian Institute of Technology Delhi Hauz Khas ,New Delhi – 110016</p>

<p>ROLLING ADVERTISEMENT NO. 01/2014(E-1)<br />ADVERTISEMENT FOR THE POSITIONS OF ASSISTANT PROFESSOR CANDIDATES CAN APPLY ANY TIME DURING THE YEAR.</p>

<p>IIT Delhi invites applications from qualified Indian Nationals, Persons of Indian Origin (PIOs) and Overseas Citizens of India (OCIs) for the following positions in the various Departments/Centres/Schools (in the fields<br />mentioned alongwith them):<br />Post Pay Band Assistant Professor and Assistant Professor (on Contract) Rs.15600-39100 (PB-3) (Minimum pay of Rs.30000/-)+ AGP Rs.8000/-</p>

<p>The following norms will be followed for fixing the basic pay + AGP for Assistant Professors appointed on<br />contract with Ph.D but experience of 3 years or less:-<br />Type Qualification &amp; Experience on the date of joining<br />Assistant Professor (Contract) PB3 (Rs. 15,600-39,100).</p>

<p>MINIMUM QUALIFICATIONS AND EXPERIENCE:<br />Ph.D. with First class at the preceding degree or equivalent in the appropriate branch with very good academic record throughout. A minimum of three years industrial/research/teaching experience, excluding however, the experience gained while Pursuing Ph. D. The candidates should preferably be below<br />35 years of age for male and 38 years for female ( to be relaxed by 5 years in case of persons with physical disability, SC/ST and 3 years in case of OBC-NCL).</p>

<p>Qualified persons include:<br />(a) Indian Nationals,<br />(b) Foreign Nationals who are “Persons of Indian Origin” (PIO) or Overseas<br />Citizens of India (OCI), in whose case, if selected, permission will be sought from Govt. of India<br />before he/she can join IIT Delhi, or<br />(c) Other Foreign Nationals, in whose case, if selected, appointment will be on a contract basis for up to 5 (five) years subject to permission from the Govt. of India before he/she can join IIT Delhi.<br />(d) Institute specifically encourages applicants from SC/ST/OBC category as well as persons<br />with disability to apply for these positions. </p>

<p>AMAR NATH &amp; SHASHI KHOSLA SCHOOL OF INFORMATION TECHNOLOGY:<br />Computational Neuroscience, Medical Applications of Information Technologies, Computational &amp; Systems Biology, Machine to Machine (M2M) Technologies, Embedded Systems &amp; Sensors, Computer Security.<br />KUSUMA SCHOOL OF BIOLOGICAL SCIENCES:<br />In-silico Biology Applications, Systems Biology, Infection Biology, Neurodegeneration. </p>

<p>More at http://www.iitd.ac.in/sites/default/files/jobs/faculty/spl-areas-rolling-advt.pdf</p>

<p>http://www.iitd.ac.in/content/faculty-positions</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 11 May 2018 05:07:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads]]></title>
	<description><![CDATA[<p>MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>. MECAT performance were compared with&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>,&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>&nbsp;and&nbsp;<a href="http://canu.readthedocs.io/en/latest/">Canu(v1.3)</a>&nbsp;in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>&nbsp;and&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>.&nbsp;</p>
<p>https://www.nature.com/articles/nmeth.4432</p><p>Address of the bookmark: <a href="https://github.com/xiaochuanle/MECAT" rel="nofollow">https://github.com/xiaochuanle/MECAT</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14272/lecturersenior-lecturer-level-bc-in-bioinformatics</guid>
  <pubDate>Fri, 22 Aug 2014 12:45:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Lecturer/Senior Lecturer (Level B/C) in Bioinformatics]]></title>
  <description><![CDATA[
<p>Lecturer/Senior Lecturer (Level B/C) in Synthetic Biology, Research Fellow (Level B) in Synthetic Biology &amp; Lecturer/Senior Lecturer (Level B/C) in Bioinformatics</p>

<p>Apply now Job no: 494553<br />Work type: Continuing full time<br />Vacancy type: External Vacancy, Internal Vacancy<br />Categories: Academic - Teaching and Research</p>

<p>The Faculty of Science is launching a new and innovative branch of biological science at Macquarie University – Synthetic Biology. Synthetic biology combines engineering principles with molecular biological approaches to design and construct biological devices and systems. Recent highlights in this field include the design and synthesis of a functional bacterial genome and a yeast chromosome, and generation of synthetic bacterial cells. The rational synthesis of "designer" organisms yield important insights into how organisms work and has the potential to revolutionise biotechnological applications in areas such as bioenergy and biomanufacturing.</p>

<p>Find more at http://jobs.mq.edu.au/cw/en/job/494553/lecturersenior-lecturer-level-bc-in-synthetic-biology-research-fellow-level-b-in-synthetic-biology-lecturersenior-lecturer-level-bc-in-bioinformatics</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43546/introduction-to-phylogenies-in-r</guid>
	<pubDate>Wed, 13 Oct 2021 02:27:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43546/introduction-to-phylogenies-in-r</link>
	<title><![CDATA[Introduction to phylogenies in R]]></title>
	<description><![CDATA[<p><span>R phylogenetics is built on the contributed packages for phylogenetics in R, and there are many such packages. Let's begin today by installing a few critical packages, such as ape, phangorn, phytools, and geiger. To get the most recent CRAN version of these packages, you will need to have R 3.3.x installed on your computer!</span></p><p>Address of the bookmark: <a href="http://www.phytools.org/Cordoba2017/ex/2/Intro-to-phylogenies.html" rel="nofollow">http://www.phytools.org/Cordoba2017/ex/2/Intro-to-phylogenies.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14758/phd-opportunity-at-universite-de-liege-belgium</guid>
  <pubDate>Mon, 01 Sep 2014 17:16:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[PhD opportunity at Université de Liège - Belgium]]></title>
  <description><![CDATA[
<p>The Bioinformatics and Systems Biology Unit of Université de Liège (Belgium) is looking for a highly motivated master student with programming skills for a PhD thesis project (4 years, fully funded) with the goal of designing computational tools that use literature, genomic and structural data in order to infer regulatory and metabolic networks.  </p>

<p>Applicants are invited to send their resume and a recommendation letter to Prof. Patrick Meyer (more details at   www.biosys.ulg.ac.be )</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44213/bioinformatics-tools-to-explore-ssrs-in-genomes</guid>
	<pubDate>Tue, 07 Mar 2023 13:06:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44213/bioinformatics-tools-to-explore-ssrs-in-genomes</link>
	<title><![CDATA[Bioinformatics tools to explore SSRs in genomes !]]></title>
	<description><![CDATA[<p>There are several bioinformatics tools that can be used to explore Simple Sequence Repeats (SSRs), which are also known as microsatellites. Here are a few examples:</p><ol>
<li>
<p>MISA: MISA (MIcroSAtellite) is a web-based tool that can identify SSRs in DNA sequences. It can be used to analyze nucleotide sequences from various organisms and can identify perfect, compound, and imperfect SSRs.</p>
</li>
<li>
<p>SSR Locator: SSR Locator is a web-based tool that identifies SSRs in both DNA and RNA sequences. It can identify perfect, compound, and imperfect SSRs, and can also filter out low complexity regions.</p>
</li>
<li>
<p>SciRoKo: SciRoKo is a software tool that can identify SSRs in DNA sequences. It can be used to analyze genomic and transcriptomic sequences from various organisms and can identify perfect, compound, and imperfect SSRs.</p>
</li>
<li>
<p>Primer3: Primer3 is a web-based tool that designs PCR primers for SSRs. It can design primers for perfect and imperfect SSRs, and can be used to design primers for SSRs in various organisms.</p>
</li>
<li>
<p>QDD: QDD (Quick Detection of Duplication) is a software tool that can identify SSRs in DNA sequences and can also identify duplicate loci. It can be used to analyze genomic and transcriptomic sequences from various organisms.</p>
</li>
</ol><p>These are just a few examples of the many bioinformatics tools available for exploring SSRs. Depending on your specific needs and research questions, you may find that other tools are more appropriate for your analysis.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>