<?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/29272?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/related/29272?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27691/histonedb-20-%E2%80%93-with-variants</guid>
	<pubDate>Fri, 03 Jun 2016 05:06:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27691/histonedb-20-%E2%80%93-with-variants</link>
	<title><![CDATA[HistoneDB 2.0 – with variants]]></title>
	<description><![CDATA[<p><span>This histone database can be used to explore the diversity of histone proteins and their sequence variants in many organisms. The resource was established to better understand how sequence variation may affect functional and structural features of nucleosomes. To get started, select a histone type to explore its variants.</span></p>
<p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/</span></p><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/" rel="nofollow">http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27713/mutabind</guid>
	<pubDate>Mon, 06 Jun 2016 13:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27713/mutabind</link>
	<title><![CDATA[MutaBind]]></title>
	<description><![CDATA[<p><span>MutaBind is a new computational method and server created through NCBI research efforts that maps mutations on a protein structural complex, calculates changes in binding affinity, identifies deleterious mutations and produces a downloadable mutant structural model.&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/" target="_blank">http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</a></p><p><img src="http://www.ncbi.nlm.nih.gov/projects/mutabind/prj-sunddg/static/myimgs/CirclesDiamondBlueThiner.png" width="471" height="258" alt="image" style="border: 0px;"></p><p><span>MutaBind guides you through this process, step by step, starting with selecting a protein complex and inputting PDB code or uploading PDB files. You can also retrieve results with a job ID number, view help documents, and review the MutaBind method and references.</span></p><p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28879/projects-opening-at-nbagr</guid>
  <pubDate>Wed, 24 Aug 2016 04:13:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Projects opening at NBAGR]]></title>
  <description><![CDATA[
<p>ICAR - NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES</p>

<p>Karnal -132001 (Haryana)</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 05.09.2016 for the selection of Three Research Associate &amp; One Young Professional - II as per details given below:</p>

<p>Name of the Scheme / Project: Center for Agricultural Bioinformatics. The post duration is Upto 31.032017 or earlier &amp; Co-terminus with the project.</p>

<p>Research Associate (Three posts)</p>

<p>Date &amp; Time of Interview: 10.30 A.M. on 05.09.2016</p>

<p>Essential Qualifications: PhD degree in any one of discipline/Subject Biotechnology/ Animal Genetics and Breeding/ Biochemistry/ Bioinformatics/Molecular Genetics OR Master’s degree in any one of above mentioned discipline/Subject with 4 years/5 years of Bachelor’s degree having 1st division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from Fellowship/Associateship</p>

<p>Desirable Qualifications: Experience in Database/Next Generation Sequencing Data analysis for 02 RA posts or working experience in molecular biology, gene expression data analysis, SNP genotyping and sequence data analysis, functional gene characterization for 01 RA post.</p>

<p>Young Professionals II One position</p>

<p>Date &amp; Time of Interview: 10.30 A.M. on 05.09.2016</p>

<p>Essential: B. Tech or M.Tech. in Bioinformatics / Computer Science / Computer Application.</p>

<p>Desirable: Experience in Linux, MySQL, Java, C++/ PHP/ PERL R based data analysis and application development in Bioinformatics.</p>

<p>More Info : http://14.139.252.116/ADvertisementforCabinScheme.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27927/research-assistant-bioinformatics-at-andhra-university</guid>
  <pubDate>Sat, 18 Jun 2016 18:39:09 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Assistant Bioinformatics at Andhra University]]></title>
  <description><![CDATA[
<p>Advt. No. AUMLR/BIF/ RA /6-2016 <br />Research Assistant Job Position in Andhra University on temporary basis <br />No. of Post : 01<br />Eligibility : Applicants who have completed their Post Graduate degree in Bioinformatics.<br />Desirable : Undergone traineeship in BIF; at least one publication in Bioinformatics. <br />Stipend : A monthly stipend of Rs. 22,000/- + HRA (HRA is applicable only for NET qualified candidates)<br />How to apply<br />Applications on plain paper, stating the name, address, date of birth, educational qualifications and experiences, and Institute, along with attested photocopies of mark sheets and certificates, should be submitted to K. UMADEVI, Coordinator, BIF Programme, Department of Marine Living Resources, Andhra University, Visakhapatnam-530 003, Andhra Pradesh, on or before 15th July, 2016. </p>

<p>Candidates are required to appear for an interview, with all the necessary certificates in original along with a set of attested copies in the office of the Principal, AU College of Science &amp; Technology, Andhra University, Visakhapatnam. Applications may be sent by Email to andhrauniv.btisnet@nic.in / katruumadevi@gmail.com.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</guid>
	<pubDate>Wed, 29 Jun 2016 15:38:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</link>
	<title><![CDATA[SAM flags]]></title>
	<description><![CDATA[<p>Decoding SAM flags</p>
<p>This utility makes it easy to identify what are the properties of a read based on its SAM flag value, or conversely, to find what the SAM Flag value would be for a given combination of properties.</p>
<p>To decode a given SAM flag value, just enter the number in the field below. The encoded properties will be listed under Summary below, to the right.</p><p>Address of the bookmark: <a href="https://broadinstitute.github.io/picard/explain-flags.html" rel="nofollow">https://broadinstitute.github.io/picard/explain-flags.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28286/nipgr-hires-research-associate-jrf-laboratory-assistant</guid>
  <pubDate>Mon, 04 Jul 2016 20:12:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[NIPGR Hires Research Associate, JRF, Laboratory Assistant]]></title>
  <description><![CDATA[
<p>National Institute of Plant Genome Research (NIPGR), Aruna Asaf Ali Marg - Delhi, Delhi <br />₹15,000 a month<br />National Institute of Plant Genome Research (NIPGR) invites applications to recruit on vacant posts of Research Associate (RA), Junior Research Fellow (JRF) and Laboratory Assistant. Applications against these Sarkari Naukri can be submitted on or before 16 July 2016. <br />NIPGR Vacancy 2016 Details <br />1. Research Associate (RA) <br />Qualification: Ph.D. degree (awarded) in Molecular Biology/Biotechnolgy/Biochemistry/Plant Science/ Life Sciences/Bioinformatics or related field with 03 years post-doctoral research experience or 02 research papers in the journals of International repute are eligible to apply. Experience in the area of functional genomics, proteomics, metabolomics, multiomics and system biology will be preferred. <br />Age Limit: As Per Rules <br />2. Junior Research Fellow (JRF) <br />Qualification: M.Sc. degree or equivalent in Biotechnolgy/Biochemistry/Plant Science or Botany/ Life Sciences/Bioinformatics/ Molecular Biology or any other related field. Experience in advanced multiomics, big data analysis, molecular and system biology techniques will be given preference. <br />Age Limit: As Per Rules <br />3. Laboratory Assistant <br />Qualification: B.Sc. degree with 05 years working experience in government R&amp;D Laboratory assisting in the field of molecular biology and genomis. <br />Pay Scale: Rs.15000/- Per Month <br />Age Limit: As Per Rules <br />How to Apply : Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Dr. Subhra Chakraborty, Staff Scientist-VII, National Institute of Plant Genome Research (NIPGR), Aruna Asaf Ali Marg, P.O. Box NO. 10531, New Delhi – 110067 . The Last Date to submit application is 16 July 2016</p>

<p>Source: http://www.nipgr.res.in/careers/vacancies_latest.php#<br />Form at http://www.nipgr.res.in/files/careers/format_RA_JRF_LA.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</guid>
	<pubDate>Wed, 13 Jul 2016 08:08:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</link>
	<title><![CDATA[WiseScaffolder]]></title>
	<description><![CDATA[<p>Function</p>
<p>WiseScaffolder is a stand-alone semi-automatic application for genome scaffolding of pre-assembled contigs using mate-pair data. It also produces editable scaffold maps, allowing either to build gapped scaffolds or usable as a common thread for the manual improvement of scaffolds.</p>
<p>Description&nbsp;</p>
<p>WiseScaffolder includes 4 subcommands: dumpconfig generates a configuration file that notably specifies the average insert size of the mate-pair library preprocess allows the detection and correction of chimerae, the estimation of contigs copy number and produces valuable outputs for the manual improvement of scaffolds scaffold constitutes the central scaffold-builder and comprises two modules:</p>
<p>i) the interative_scaffold_extender, which works with big, unambiguous contigs, or when they run out, single copy contigs, and</p>
<p>ii) the small_contig_inserter, which inserts the small contigs within scaffolds buildfasta converts the scaffold(s) map(s) into Fasta sequences.</p><p>Address of the bookmark: <a href="http://abims.sb-roscoff.fr/wisescaffolder" rel="nofollow">http://abims.sb-roscoff.fr/wisescaffolder</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>