<?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/28915?offset=690</link>
	<atom:link href="https://bioinformaticsonline.com/related/28915?offset=690" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</guid>
	<pubDate>Thu, 04 Oct 2018 16:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</link>
	<title><![CDATA[VariantBam: Filtering and profiling of next-generational sequencing data using region-specific rules]]></title>
	<description><![CDATA[<p>VariantBam is a tool to extract/count specific sets of sequencing reads from next-generational sequencing files. To save money, disk space and I/O, one may not want to store an entire BAM on disk. In many cases, it would be more efficient to store only those read-pairs or reads who intersect some region around the variant locations. Alternatively, if your scientific question is focused on only one aspect of the data (e.g. breakpoints), many reads can be removed without losing the information relevant to the problem.</p>
<h5>&nbsp;</h5><p>Address of the bookmark: <a href="https://github.com/broadinstitute/VariantBam" rel="nofollow">https://github.com/broadinstitute/VariantBam</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</guid>
	<pubDate>Fri, 17 Apr 2015 04:34:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</link>
	<title><![CDATA[BCIL Bioinformatics BITP Application !!]]></title>
	<description><![CDATA[<p>BCIL Bioinformatics BITP Application Form 2015 logoGrab latest Information! Biotech Consortium India Limited has announced a notification for offering admission in Biotech Industrial Training Program. The organization has invited online application from 7th April 2015 BCIL Admission 2015. BCIL has conducted an entrance exam which is scheduled on 20th June 2015. Candidates those who are looking for this program just go for it and don&rsquo;t miss this opportunity.<br /><br />To apply for Biotech Industrial Training Programme the candidates should have 50% marks in B.Tech/BE/M.Tech Degree in Bio technology, bio process technology and other related disciplines form any recognized institution. The organization has decided application fee of Rs.500/- for all candidates and that should be paid through demand draft. Applicants who satisfy the organization requirement, they can take their steps forward.<br /><br />Candidates should submit the online application before 10th May 2015. After registering the online application you need to take the hard copy of it and send through post. Print out of this application should be reached before 15th May 2015. All the latest updates like selection process, exam syllabus and other related information are updated soon at the main URL of the department and aspirants should keep in touch with this site. Further details of BCIL Bioinformatics BITP Application Form 2015 are explained below.<br /><br />Organization: Biotech Consortium India Limited<br /><br />Website URL: www.bcil.nic.in<br /><br />Location: New Delhi<br /><br />Course Name: Biotech Industrial Training Program<br /><br />Exam Name: BCIL Entrance Exam<br /><br />Educational Details: Applicants should complete their B.Tech/M.Tech/BE programs in Neuro- Science, Agricultural, Bio technology, bio process technology and other related disciplines having 50% aggregate from any authorized university.<br /><br />Application Fee: For all candidates application fee is Rs.500/- and it will be paid through Demand Draft drawn in favour of BCIL, New Delhi.<br /><br />How to Apply: Candidates who are willing to apply for this program they can apply through online mode. Then send the hard copy of registered application form to through post.<br /><br />Important Dates<br /><br />Opening Date of Submission Online Application Form: 7h April 2015<br /><br />Closing Date of Submission of Online Application Form: 10th May 2015<br /><br />Last Date of Receipt of Application Form: 15th May 2015<br /><br />Exam Date: 20th June 2015</p><p>More at http://bcil.nic.in/default.htm</p>]]></description>
	<dc:creator>Pranjali Yadav</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</guid>
	<pubDate>Fri, 26 Jul 2019 00:58:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</link>
	<title><![CDATA[jackalope: A swift, versatile phylogenomic and high-throughput sequencing simulator]]></title>
	<description><![CDATA[<p><code>jackalope</code> simply and efficiently simulates (i) variants from reference genomes and (ii) reads from both Illumina and Pacific Biosciences (PacBio) platforms. It can either read reference genomes from FASTA files or simulate new ones. Genomic variants can be simulated using summary statistics, phylogenies, Variant Call Format (VCF) files, and coalescent simulations&mdash;the latter of which can include selection, recombination, and demographic fluctuations. <code>jackalope</code> can simulate single, paired-end, or mate-pair Illumina reads, as well as reads from Pacific Biosciences These simulations include sequencing errors, mapping qualities, multiplexing, and optical/PCR duplicates. All outputs can be written to standard file formats.</p>
<p><span>A swift, versatile phylogenomic and high-throughput sequencing simulator </span> <span><a href="https://jackalope.lucasnell.com">https://jackalope.lucasnell.com</a></span></p><p>Address of the bookmark: <a href="https://github.com/lucasnell/jackalope" rel="nofollow">https://github.com/lucasnell/jackalope</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22024/research-associate-bioinformatics-job-position-in-indian-agricultural-statistics-research-institute-iasri-pusa-new-delhi</guid>
  <pubDate>Tue, 14 Apr 2015 11:57:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics job position in Indian Agricultural Statistics Research Institute (IASRI), Pusa, New Delhi]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute is inviting applications from indian citizens for recruiting following posts:</p>

<p>Vacancies:<br />Research Associate-02<br />Age Limits:<br />Candidates age limit should be not more than 40 years as on date of interview.<br />Qualification:<br />Candidates should possess Ph.D in Bioinformatics/Agricultural Statistics/Statistics/Computer Science/Computer Application or equivalent.<br />Selection Process:<br />Selection will be based on interview.<br />How to Apply:<br />Eligible candidates may attend for interview along with application in prescribed format, recent passport size photograph pasted on the application form, bio-data, original certificates and self attested copies of relevant documents, all experience certificates, testimonials etc, held at Indian Agricultural Statistics Research Institute, Pusa, New Delhi on 18-04-2015 at 10:30 AM.<br />Last Date:<br />18-04-2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</guid>
	<pubDate>Thu, 13 Feb 2020 00:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</link>
	<title><![CDATA[genomics public data links !]]></title>
	<description><![CDATA[<p>List of publically available databases on google server.</p>
<p>More at <a href="https://software.broadinstitute.org/gatk/download/bundle">https://software.broadinstitute.org/gatk/download/bundle</a></p>
<p><a href="ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/">ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/</a>.</p>
<p><a href="ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/">ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/</a></p><p>Address of the bookmark: <a href="https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1" rel="nofollow">https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22044/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:12:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22044/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper for round ONE.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22044" length="1260" type="text/plain" />
</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/file/view/22068/binc-examination-2015</guid>
	<pubDate>Fri, 17 Apr 2015 03:34:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22068/binc-examination-2015</link>
	<title><![CDATA[BINC examination 2015 !!!]]></title>
	<description><![CDATA[<p>BioInformatics National Certification (BINC) Examination 2015 organized by Department of Biotechnology, Government of India, New Delhi Pondicherry University, Puducherry</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22068" length="281577" type="application/pdf" />
</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/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>

</channel>
</rss>