<?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/43670?offset=700</link>
	<atom:link href="https://bioinformaticsonline.com/related/43670?offset=700" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22234/national-institute-of-biologicals-recruitment-2015</guid>
  <pubDate>Mon, 27 Apr 2015 19:44:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[National Institute of Biologicals Recruitment 2015]]></title>
  <description><![CDATA[
<p>National Institute of Biologicals (NIB), Noida<br />Job Code: 260415(04)Y</p>

<p>National Institute of Biologicals (NIB), Noida invites applications to recruit on vacant posts of Scientist, Training Officer, Administrative Assistant, Stenographer, Junior Engineer, Computer Operator etc. Applications against these Government Jobs can be submitted on or before 01 July 2015.</p>

<p>NIB Vacancy 2015 Details<br />1. Scientist Grade III – 06<br />Qualification: PG degree in the concern field.<br />Age Limit: 35 Years</p>

<p>2. Junior Scientist – 07<br />Qualification: M.Sc. in Microbiology / Clinical Microbiology / Biotechnology/ Bioinformatics/ Biochemistry/Bacteriology/Pharmacology/ Serology / Molecular Biology/Physiology from any recognized University with at least 60% marks.<br />Age Limit: 30 Years</p>

<p>How to Apply: Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Administrative Officer, National Institute of Biologicals (Ministry of Health &amp; Family Welfare), A-32, Sector-62, Institutional Area, Noida-201309. Click here to obtain application form.</p>

<p>The Last Date to apply to NIB Job is 01 July 2015.</p>

<p>Click here to view details http://nib.gov.in/Advt%20%20%2824.04.2015%29.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22429/walk-ins-for-jrf-ans-srf-post-in-nirrh-mumbai</guid>
  <pubDate>Thu, 28 May 2015 19:04:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-ins for JRF ans SRF post in NIRRH, Mumbai]]></title>
  <description><![CDATA[
<p>Title of project- "EXPLORING THE HINGE AND TRANSMEMBRANE REGION OF HUMAN FSHR FOR DESIGN OF SMALL MOLECULE AND PEPTIDOMIMETIC MODULATORS"<br />Name of the Post- Junior Research Fellow<br />No. of vacancy- One<br />Stipend- Rs. 25000/ +30% HRA<br />Essential qualification- Candidate should be Post Graduate Degree in Life Sciences / Bioinformatics /Pharmacology/ Chemistry or any other relevant area of Biology or Graduate Degree in Professional Course with NET qualification or Post Graduate Degree in Professional Course.<br />Desirable- Candidate with Good knowledge of protein structures, docking, MD simulations will be preferred.<br />Age Limit- Not exceeding 28 Years<br />Duration of project- Upto May 2018</p>

<p>Title of project- "Analysis of the structures of known antimicrobial peptides using machine learning algorithms and molecular dynamics simulations".<br />Name of the Post- Senior Research Fellow<br />No. of vacancy- One<br />Stipend- Rs. 14000/ +30% HRA<br />Essential qualification- Candidate should be having M.Sc. degree in Life Sciences / Bioinformatics / Pharmacology/ Chemistry or any other relevant area of Biology and 2 years of research experience.<br />Desirable- Candidate with Good knowledge of protein structures, docking, MD simulations will be preferred.<br />Age Limit- Not exceeding 35 Years<br />Duration of project- Upto April 2016<br />How to Apply- Interested candidates can download the application form from below mentioned link- http://www.nirrh.res.in/links/BiodataForm.pdf<br />Candidate must bring the filled up application form along with all the relevant documents in original and one set of attested photocopies of the same and one passport size recent colour photograph.</p>

<p>Ref. - http://www.nirrh.res.in/links/job_jrf-srf.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/36427/php-mysql-ajax-wordpress-jquery-api-integration-xml-parsingjson-parsingcodeigniter</guid>
	<pubDate>Sun, 29 Apr 2018 01:03:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/36427/php-mysql-ajax-wordpress-jquery-api-integration-xml-parsingjson-parsingcodeigniter</link>
	<title><![CDATA[PHP, MySQL, AJAX, Wordpress, jQuery, API integration, xml parsing,json parsing,CodeIgniter]]></title>
	<description><![CDATA[<p>My name is Ram Yash Pal. I&rsquo;m web developer. I have 5+ years of experience on web development, specially on developing large scale web application with complex business logic.<br /><br /><span>My main expertises are on PHP, jQuery, Ajax, CodeIgniter, Wordpress Plugin Development and Wordpress theme customization.</span></p><p>PHP, MySQL, AJAX, Wordpress, jQuery, API integration, xml parsing,json parsing,CodeIgniter</p><p>https://phpajaxhtml.blogspot.in/</p>]]></description>
	<dc:creator>Ram Yash Pal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22286/jrf-bioinformatics-pune-university</guid>
  <pubDate>Wed, 06 May 2015 06:21:09 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics @ Pune University]]></title>
  <description><![CDATA[
<p>Pune University is inviting applications from indian citizens for recruiting following posts:</p>

<p>Vacancies:<br />Junior Research Fellow-04<br />Age Limits:<br />Candidates age should be not more than 28 years.<br />Qualification:<br />Candidates should possess M.Sc in Microbiology/ Marine microbiology/Marine Biotechnology/ Bioinformatics/Zoology or equivalent degree with minimum 60% marks.<br />Selection Process:<br />Shortlisted candidates will be called for interview.<br />How to Apply:<br />Eligible candidates may send their applications in the prescribed format along with CV in an envelope should be superscribed as the "Application for the post of JRF" to Head Department of Zoology, Savitribai Phule Pune University on or before 10-05-2015.<br />Last Date:<br />10-05-2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</guid>
	<pubDate>Sat, 09 Dec 2017 08:59:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</link>
	<title><![CDATA[MOSS: A System for Detecting Software Similarity]]></title>
	<description><![CDATA[<p><span>Moss (for a Measure Of Software Similarity) is an automatic system for determining the similarity of programs. To date, the main application of Moss has been in detecting plagiarism in programming classes. Since its development in 1994, Moss has been very effective in this role. The algorithm behind moss is a significant improvement over other cheating detection algorithms (at least, over those known to us).</span></p>
<p><span><span>Moss can currently analyze code written in the following languages:</span></span></p>
<p>C, C++, Java, C#, Python, Visual Basic, Javascript, FORTRAN, ML, Haskell, Lisp, Scheme, Pascal, Modula2, Ada, Perl, TCL, Matlab, VHDL, Verilog, Spice, MIPS assembly, a8086 assembly, a8086 assembly, MIPS assembly, HCL2.</p><p>Address of the bookmark: <a href="https://theory.stanford.edu/~aiken/moss/" rel="nofollow">https://theory.stanford.edu/~aiken/moss/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22352/affy-has-acquired-eureka-genomics-for-15m</guid>
	<pubDate>Wed, 20 May 2015 15:11:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22352/affy-has-acquired-eureka-genomics-for-15m</link>
	<title><![CDATA[Affy has acquired Eureka Genomics for 15M $]]></title>
	<description><![CDATA[<p>Affymetrix Acquires Assets Of Eureka Genomics Corporation To Provide High Throughput And Economical Crop And Animal Genotyping</p><p>http://www.thestreet.com/story/13151062/1/affymetrix-acquires-assets-of-eureka-genomics-corporation-to-provide-high-throughput-and-economical-crop-and-animal-genotyping.html</p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</guid>
	<pubDate>Fri, 04 Sep 2020 20:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</link>
	<title><![CDATA[Tools and Method for Haplotype phasing !]]></title>
	<description><![CDATA[<div>Huge amounts of genotype data are being produced with recent technological advances, both from increasingly&nbsp; comprehensive and inexpensive genome-wide SNP microarrays and from ever more accessible whole-genome and whole-exome sequencing methods. The vast amount of knowledge contained in these results, however, is best&nbsp; exploited through phased haplotypes, which classify the alleles co-located on the same chromosome. Since sequence and SNP array data normally take the form of unphased genotypes, one does not specifically observe which of the two parental chromosomes, or haplotypes, falls on a specific allele. Fortunately, new advances in both computational and laboratory methods promise improved determination of haplotype phase. Following are useful tools :</div><div>&nbsp;</div><p><strong>Arlequin:</strong>&nbsp;<a href="http://cmpg.unibe.ch/software/arlequin3/" target="_blank">http://cmpg.unibe.ch/software/arlequin3/</a></p><p><strong>BEAGLE:</strong>&nbsp;<a href="http://faculty.washington.edu/browning/beagle/beagle.html" target="_blank">http://faculty.washington.edu/browning/beagle/beagle.html</a></p><p><strong>fastPHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>GENEHUNTER:</strong>&nbsp;<a href="http://linkage.rockefeller.edu/soft/gh/" target="_blank">http://linkage.rockefeller.edu/soft/gh/</a></p><p><strong>The Genome Analysis Toolkit:</strong></p><p><a href="http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit</a></p><p><strong>IMPUTE2:</strong>&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html" target="_blank">https://mathgen.stats.ox.ac.uk/impute/impute_v2.html</a></p><p><strong>MACH:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/MACH/" target="_blank">http://www.sph.umich.edu/csg/abecasis/MACH/</a></p><p><strong>MERLIN:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/Merlin/" target="_blank">http://www.sph.umich.edu/csg/abecasis/Merlin/</a></p><p><strong>PHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>PL-EM:</strong>&nbsp;<a href="http://www.people.fas.harvard.edu/~junliu/plem/" target="_blank">http://www.people.fas.harvard.edu/~junliu/plem/</a></p><p><strong>&ldquo;Read-backed phasing&rdquo; algorithm</strong>:&nbsp;<a href="http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm</a></p><p><strong>SHAPE-IT:</strong>&nbsp;<a href="http://www.griv.org/shapeit/" target="_blank">http://www.griv.org/shapeit/</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22402/alessandra-carbone-lab</guid>
  <pubDate>Tue, 26 May 2015 08:54:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Alessandra Carbone Lab]]></title>
  <description><![CDATA[
<p>Our group works on various problems connected with the functioning and evolution of biological systems. We use mathematical tools, coming from statistics and combinatorics, algorithmic tools and molecular physics tools to study basic principles of cellular functioning starting from genomic data. We run several projects in parallel, all aiming at understanding the basic principles of evolution and co-evolution of molecular structures in the cell. They are intimately linked to each other.</p>

<p>Our main research themes are:</p>

<p>Domain annotation and metagenomics <br />Transcriptomics and sequence analysis<br />Protein evolution and interactions<br />Protein conformational dynamics</p>

<p>More at http://www.lcqb.upmc.fr/AnalGenom/home.html</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>

</channel>
</rss>