<?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/45349?offset=970</link>
	<atom:link href="https://bioinformaticsonline.com/related/45349?offset=970" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4546/sowdhamini-lab</guid>
  <pubDate>Sun, 15 Sep 2013 09:19:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[SOWDHAMINI Lab]]></title>
  <description><![CDATA[
<p>Genome sequencing projects have enormous potential for benefiting human endeavors. However, just as acquiring a language's vocabulary does not enable one to speak it, databases that list the amino acid composition of proteins do not directly tell us much about these proteins' higher-level structure and function. The most productive way to indirectly exploit these databases has been to start with the small number of proteins that are fully-characterised and to assume that other "similar" proteins will have a related structure and function. Proteins with very similar amino acid sequence are "no-brainers", but the real test, which our group largely focuses on, is to detect the "essential" similarity in proteins whose non-critical sections have experienced random rearrangements during evolution. In such cases functionally similar proteins may have less than 25% sequence overlap.</p>

<p>More @ http://www.ncbs.res.in/sowdhamini/groups_sowdhamini.htm</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22786/ra-at-university-of-delhi</guid>
  <pubDate>Wed, 17 Jun 2015 20:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Delhi]]></title>
  <description><![CDATA[
<p>Research Scientist Jobs opportunity in University of Delhi on temporary basis</p>

<p>Qualifications : Ph. D.</p>

<p>Desirable : Experience on DNA Markers, plant genome mapping and bioinformatics</p>

<p>No. of Post : 03</p>

<p>Department : Genetics</p>

<p>Salary : Rs. 60,000/-<br />How to apply</p>

<p>The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room. Applicants are requested to bring all related documents, in original and a set of photocopy, for verification. Date and time of the interview : 25.06.2015 at 10:30 AM.</p>

<p>Click Here for Job Details http://www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&amp;cntnt01articleid=5492&amp;cntnt01returnid=83</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33789/i-pv-interactive-protein-sequence-visualization</guid>
	<pubDate>Mon, 03 Jul 2017 07:52:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33789/i-pv-interactive-protein-sequence-visualization</link>
	<title><![CDATA[I-PV: Interactive Protein Sequence Visualization]]></title>
	<description><![CDATA[<p><span>I-PV is a interactive data visualization software designed for inspection of protein sequences and mutation information. It is mainly used for Genetics and Bioinformatics. So what exactly makes it standout?</span></p>
<p><span>http://i-pv.org/ipv_rec</span></p><p>Address of the bookmark: <a href="http://i-pv.org/" rel="nofollow">http://i-pv.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/22906/at-what-age-did-you-gain-passion-in-bioinformatics</guid>
	<pubDate>Tue, 23 Jun 2015 10:39:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/22906/at-what-age-did-you-gain-passion-in-bioinformatics</link>
	<title><![CDATA[At what age did you gain passion in Bioinformatics?]]></title>
	<description><![CDATA[<p>Most of the bioinformatician were biologist ( yeah ... not all ;), and at later stage they gain a passion in Bioinformatics and learn it. When did you get inclined towards computational analysis of biological data?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/opportunity/view/22965/ra-bioinformatics-at-bharathidasan-university</guid>
  <pubDate>Sun, 28 Jun 2015 12:21:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Bharathidasan University]]></title>
  <description><![CDATA[
<p>National Facility for Marine Cyanobacteria <br />Department of Marine Biotechnology <br />Bharathidasan University <br />Tiruchirappalli -620024, Tamil Nadu </p>

<p>Applications are invited from individuals who have high motivation to do research for the below mentioned position, </p>

<p>1. Research Associate - 1 No. <br />in the DBT sponsored project under the supervision of Dr. D. Prabaharan, Principal Investigator, National Facility for Marine Cyanobacteria, Dept. of Marine Biotechnology, Bharathidasan University, Tiruchirappalli-24. </p>

<p>Title of the Project: “Establishment of National Repository for Micro algae &amp; Cyanobacteria” funded by Department of Biotechnology, Govt. of India </p>

<p>Qualification </p>

<p>1. Research Associate – 1 No. Rs. 36,000/38,000/40,000 per month for I, II and III year + 20% HRA </p>

<p>Essential : Doctoral degree in relevant subject from recognized University/ Institutes <br />Desirable: Research experience in molecular biology and bioinformatics </p>

<p>Interested candidates can send their complete CV in plain paper with a passport size photograph, with details of Marks secured in all subjects from plus two stage (with proof, full postal address, sex, date of birth, community etc., along with additional qualification or experiences and two address of references whom could be contacted (One of whom should be PG teacher/guide). Application should reach the Principal Investigator on or before 30.06.2015 by Email (nfmcbic@yahoo.com)/Registered post/ Speed post, with subject subscribed as “Application for Research Associate /Technical Assistant /Lab attendant”. Qualifying candidates will be short listed and communicated with date of interview. No TA and DA will be given for attending the interview. Addressfor Communication Dr. D. Prabaharan Principal Investigator National Facility for Marine Cyanobacteria Bharathidasan University Tiruchirappalli-620024, Tamil Nadu.</p>

<p>Advertisement: http://www.bdu.ac.in/adv/NFMC_Project_Positions.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44882/fantasia</guid>
	<pubDate>Wed, 20 Aug 2025 02:48:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44882/fantasia</link>
	<title><![CDATA[FANTASIA]]></title>
	<description><![CDATA[<p dir="auto">FANTASIA is an advanced pipeline for the automatic functional annotation of protein sequences using state-of-the-art protein language models. It integrates deep learning embeddings and in-memory similarity searches, retrieving reference vectors from a PostgreSQL database with pgvector, to associate Gene Ontology (GO) terms with proteins.</p>
<p>https://www.nature.com/articles/s42003-025-08651-2</p><p>Address of the bookmark: <a href="https://github.com/CBBIO/FANTASIA" rel="nofollow">https://github.com/CBBIO/FANTASIA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/23149/raphael-lab</guid>
  <pubDate>Sat, 04 Jul 2015 19:05:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Raphael Lab]]></title>
  <description><![CDATA[
<p>Raphael Lab research is focused on Bioinformatics and Computational Biology.</p>

<p>Current research interests include next-generation DNA sequencing, structural variation, genome rearrangements in cancer and evolution, and network analysis of somatic mutations in cancer. Earlier research included topics in comparative genomics, multiple sequence alignment, and motif finding.</p>

<p>More athttp://compbio.cs.brown.edu/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23627/ra-bioinformatics-at-nipgr</guid>
  <pubDate>Tue, 04 Aug 2015 18:53:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NIPGR]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for filling up one position of Research Associate (RA) in the Institute with Dr. Senthil-Kumar Muthappa, Scientist, NIPGR, in the scheme of "Short-Term Research Fellowship" programme. The position is completely on temporary basis with maximum duration of three years. The initial appointment will be for a period of one year, which can be curtailed or extended based on the performance of the candidate and discretion of the Competent Authority.</p>

<p>The candidate is expected to have experience in handling functional genomics tools to dissect defense responses against bacterial pathogens and drought stress tolerance. This project may involve use of bioinformatics tools, database development, large scale transcriptome profiling, virus-induced gene silencing and any other research work as assigned by the PI.</p>

<p>Qualification: Candidates having a Ph. D. degree in Bioinformatics/Plant Molecular Biology/Plant Physiology/Plant Pathology/Plant Breeding &amp; Genetics and strong publication record can apply. Candidates having prior work experience in using advanced molecular biology tools in laboratory with strong bioinformatics knowledge are preferred.</p>

<p>The Fellowship amount for the position will be given at par with the similar fellowships by DBT/DST.</p>

<p>NIPGR reserves the right to select the candidate against the above post depending upon the qualifications and experience of the candidate. Reservation of post shall be as per Govt. of India norms.</p>

<p>Eligible candidates may apply by sending hard copy of complete application in the given format with a cover letter showing interest and specifying the position. The attested copies of the mark-sheets, certificates, proof of research experience/publications are to be attached. The application should reach at the address given below within 15 days from the date of advertisement. The envelope must be superscribed by "Application for the post of RA under NIPGR Short-term research fellowship programme". No TA/DA will be paid for attending the interview.</p>

<p>ONLY hard copy of the application in the given format will be accepted.<br />www.nipgr.res.in/files/careers/format_RA2.doc</p>

<p>Dr. Senthil-Kumar Muthappa<br />Staff Scientist - III,<br />National Institute of Plant Genome Research (NIPGR)<br />Aruna Asaf Ali Marg, P.O. Box NO. 10531,<br />New Delhi - 110067</p>
]]></description>
</item>

</channel>
</rss>