<?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/26573?offset=1620</link>
	<atom:link href="https://bioinformaticsonline.com/related/26573?offset=1620" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44541/powerful-books-for-learning-data-analysis-with-r</guid>
	<pubDate>Tue, 28 May 2024 07:42:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44541/powerful-books-for-learning-data-analysis-with-r</link>
	<title><![CDATA[Powerful books for learning data analysis with R]]></title>
	<description><![CDATA[<p><span>R is powerful tool for data analysis, visualization, and machine learning. And it costs $0 to use! Here are six FREE books you can use to learn R today:</span></p>
<p><span>https://csgillespie.github.io/efficientR/</span></p>
<p><span>https://r-graphics.org/</span></p>
<p><span>https://rstudio-education.github.io/hopr/</span></p>
<p><span>https://r-pkgs.org/</span></p>
<p><span>https://r4ds.had.co.nz/</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://r-graphics.org/" rel="nofollow">https://r-graphics.org/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24364/ra-bioinformatics-at-university-of-delhi</guid>
  <pubDate>Thu, 10 Sep 2015 16:02:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at University of Delhi]]></title>
  <description><![CDATA[
<p>BIOINFORMATICS INFRASTRUCTURE FACILITY</p>

<p>GARGI COLLEGE (University of Delhi)</p>

<p>SiriFort Road, New Delhi-110049</p>

<p>Walk- in- interview Bioinformatics Infrastructure Facility (BIF), Gargi College, University of Delhi invites to appear for interview on 29th September, 2015 at 9.30 AM for filling up the following purely temporary position sponsored by DBT, New Delhi.</p>

<p>1. Traineeship – 01 (one post) purely temporary for a period of six months.</p>

<p>Salary: Rs.8000/- p.m. fixed.</p>

<p>Essential Qualification: Post Graduate degree in Bioinformatics or any other branch of Life Sciences preferably with dissertation in Bioinformatics.</p>

<p>Desirable Qualification: Prior knowledge of programming languages such as C, VB, SQL etc. and software/database development.</p>

<p>2. Research Associate-01(one post) purely temporary for a period of nine months.</p>

<p>Salary: Rs 36000/-+HRA p.m fixed.</p>

<p>Essential Qualification: PhD in Bioinformatics/Biological Sciences/Computer Science or allied sciences with proven experience in bioinformatics.</p>

<p>3. Studentship- 01 (one post) purely temporary for a period of six months.</p>

<p>Salary: Rs.8000/- p.m. fixed.</p>

<p>Essential Qualifications: Final year Post Graduate students pursuing a degree in Bioinformatics or any branch of Life Science with knowledge of bioinformatics.</p>

<p>Interested candidates are required to appear for the walk in interview on 29th September, 2015 at 9.30 AM in Principal’s Office, Gargi College, Sirifort Road, N. Delhi-110049, with their CVs, original documents and a set of Photostat copies of all original documents. Conditions: The original documents must be produced at the time of interview, otherwise will not be allowed to attend the same. No TA &amp; DA will be paid for appearing in the interview. The institute reserves the right to fill or not to fill the positions depending upon qualifications/credentials of the candidates etc. The appointment does not confer any right over the job and will not be considered as institute’s service. Dr Aparajita Mohanty Dr Shashi Tyagi (Co-coordinator,BIF) (Coordinator, BIF)</p>

<p>Advertisement:</p>

<p>http://gargi.du.ac.in/uploads/ngrey/News/Gargi_Advt_BIF_2015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44648/modern-statistics-with-r</guid>
	<pubDate>Thu, 22 Aug 2024 04:44:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44648/modern-statistics-with-r</link>
	<title><![CDATA[Modern Statistics with R]]></title>
	<description><![CDATA[<p>This is the online version of the second edition of&nbsp;<em>Modern Statistics with R</em>. It is free to use, and always will be.&nbsp;<a href="https://www.routledge.com/Modern-Statistics-with-R-From-Wrangling-and-Exploring-Data-to-Inference-and-Predictive-Modelling/Thulin/p/book/9781032512440">Printed copies</a>&nbsp;are available from CRC Press.</p>
<p><span>Live&nbsp;<a href="https://statistikakademin.se/in-english-r/">online courses on statistics with R</a></span>&nbsp;based on this book, led by the author, are offered regularly; see&nbsp;<a href="https://statistikakademin.se/in-english-r/">this page</a>&nbsp;for more information and dates.</p>
<p>The past decades have transformed the world of statistical data analysis, with new methods, new types of data, and new computational tools. The aim of&nbsp;<em>Modern Statistics with R</em>&nbsp;is to introduce you to key parts of the modern statistical toolkit. It teaches you:</p>
<ul>
<li><span>Data wrangling</span>&nbsp;- importing, formatting, reshaping, merging, and filtering data in R.</li>
<li><span>Exploratory data analysis</span>&nbsp;- using visualisations and multivariate techniques to explore datasets.</li>
<li><span>Statistical inference</span>&nbsp;- modern methods for testing hypotheses and computing confidence intervals.</li>
<li><span>Predictive modelling</span>&nbsp;- regression models and machine learning methods for prediction, classification, and forecasting.</li>
<li><span>Simulation</span>&nbsp;- using simulation techniques for sample size computations and evaluations of statistical methods.</li>
<li><span>Ethics in statistics</span>&nbsp;- ethical issues and good statistical practice.</li>
<li><span>R programming</span>&nbsp;- writing code that is fast, readable, and (hopefully!) free from bugs.</li>
</ul>
<p>The book includes plenty of examples and more than 200 exercises with worked solutions.&nbsp;<a href="http://www.modernstatisticswithr.com/data.zip">The datasets used for the examples and the exercises can be downloaded here.</a></p><p>Address of the bookmark: <a href="https://www.modernstatisticswithr.com/" rel="nofollow">https://www.modernstatisticswithr.com/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24665/national-research-centre-on-plant-biotechnology-for-rajrf-positions</guid>
  <pubDate>Sat, 26 Sep 2015 20:32:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[National Research Centre on Plant Biotechnology for RA/JRF positions]]></title>
  <description><![CDATA[
<p>National Research Centre on Plant Biotechnology - New Delhi, Delhi<br />National Research Centre on Plant Biotechnology recruitments job vacancies for RA/JRF positions</p>

<p>Name of post: Research Associate<br />Salary: Rs.36000/-+ 30% HRA*<br />Educational Qualification: Candidates should have PhD in Biotechnology / Bioinformatics Life Sciences (or) M.Sc Biotechnology / Bioinformatics with three years research experience in relevant field</p>

<p>Name of post: Junior Research Fellow<br />Salary: Rs.25000/-+ 30% HRA*<br />Educational Qualification: Candidates should have M.Sc in Biotechnology /Bioinformatics / Life Sciences with 1st Division or 60% marks or equivalent overall grade point from any recognized professional University</p>

<p>Age Limit: 35 years max. (5 years relaxation for SC/ST/OBC)</p>

<p>How to attend walk in interview?<br />Interested candidates may attend Walk- in-interview on 1st October, 2015 at 10 am at NRCPB, LBS Building, Pusa Campus, and New Delhi-110012 at the above address along with updated Bio-data (CV), ID Proof &amp; attested copies of Certificates and Original to prove qualification &amp; Experience.</p>

<p>Recruitment reference: http://www.nrcpb.org/jobslist</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</guid>
	<pubDate>Tue, 27 Nov 2018 04:43:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</link>
	<title><![CDATA[lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data]]></title>
	<description><![CDATA[<p><span>lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.</span></p>
<p>lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/lordfast" rel="nofollow">https://github.com/vpc-ccg/lordfast</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</guid>
	<pubDate>Fri, 26 Jul 2024 06:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</link>
	<title><![CDATA[Basics of BLAST Programs !]]></title>
	<description><![CDATA[<p>The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity. Developed by the National Center for Biotechnology Information (NCBI), BLAST is widely used for identifying species, finding functional and evolutionary relationships between sequences, and predicting the function of novel sequences.</p><p>Key Features of BLAST:<br />1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.</p><p>2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.</p><p>3. Versatility: There are several versions of BLAST for different types of sequence comparisons:<br /> - blastn: Compares a nucleotide query sequence against a nucleotide sequence database.<br /> - blastp: Compares a protein query sequence against a protein sequence database.<br /> - blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.<br /> - tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.<br /> - tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.</p><p>4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.</p><p>5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.</p><p>Applications of BLAST:<br />- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.<br />- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.<br />- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.<br />- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.</p><p>Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24942/bioinformatics-faculty-at-university-of-hyderabad</guid>
  <pubDate>Wed, 14 Oct 2015 22:53:44 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Faculty at UNIVERSITY OF HYDERABAD]]></title>
  <description><![CDATA[
<p>UNIVERSITY OF HYDERABAD</p>

<p>(A Central University established by an Act of Parliament)</p>

<p>Prof. C.R.Rao Road, P.O. Central University Campus, Gachibowli,</p>

<p>Hyderabad - 500 046</p>

<p>Advt.No. UH/HR/Rectt-2015/02 dt. 12.10.2015</p>

<p>The University invites applications from the Indian citizens for the following positions:</p>

<p>Professor / Associate Professor / Assistant Professor :</p>

<p>    Biotechnology &amp; Bioinformatics</p>

<p>Last date : 16th November 2015</p>

<p>More Info : http://www.uohyd.ac.in/images/recruitment/advt-121015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41442/gsp4pdb-a-web-tool-to-visualize-search-and-explore-protein-ligand-structural-patterns</guid>
	<pubDate>Sun, 15 Mar 2020 03:41:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41442/gsp4pdb-a-web-tool-to-visualize-search-and-explore-protein-ligand-structural-patterns</link>
	<title><![CDATA[GSP4PDB: a web tool to visualize, search and explore protein-ligand structural patterns]]></title>
	<description><![CDATA[<p><span><span>GSP4PDB is a user-friendly and efficient application to search and discover new patterns of protein-ligand interaction.</span></span></p>
<p><span>GSP4PDB</span><span>&nbsp;is part of the services provided by the&nbsp;</span><a href="https://structuralbio.utalca.cl/" target="_blank">Bioinformatic Group</a><span>&nbsp;of the&nbsp;</span><a href="http://www.utalca.cl/" target="_blank">University of Talca</a></p>
<p><a href="http://gdblab.com/gsp4pdb/gsp4pdb2/">http://gdblab.com/gsp4pdb/gsp4pdb2/</a></p>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3352-x</p><p>Address of the bookmark: <a href="http://gdblab.com/gsp4pdb/gsp4pdb2/" rel="nofollow">http://gdblab.com/gsp4pdb/gsp4pdb2/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25250/srfjrf-biotechnology-nrcpb-delhi-delhi</guid>
  <pubDate>Fri, 13 Nov 2015 02:52:11 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF Biotechnology NRCPB - Delhi, Delhi]]></title>
  <description><![CDATA[
<p>SRF/JRF job position in National Research Centre on Plant Biotechnology (NRCPB)</p>

<p>JRF /1</p>

<p>Qualification : Master’s Degree in Biotechnology / life sciences with four years Bachelor’s Degree (or) Master’s Degree in Biotechnology / life sciences with NET qualification with 1st Division or 60% marks or equivalent overall grade point average . Non NET/ Master’s degree with three years Bachelor’s degree as per DST/DBT norms. Desirable: Working Experience in Molecular Biology Techniques, genome sequence analysis Bioinformatics</p>

<p>Emoluments : Rs.25000</p>

<p>SRF</p>

<p>Qualification : Master’s degree in Biotechnology/Bioinformatics/Life Science with 1st division or 60% marks or equivalent overall grade point average with 4 year of Bachelor’s degree or 5 years integrated Masters degree. Desirable: Working experience in Bioinformatics, genomic analysis</p>

<p>Emoluments : Rs.25000/</p>

<p>Age Limit: 35 years</p>

<p>Walk-in-interview will be held on 20th November 2015 at 10 AM at NRCPB, LBS Building, Pusa Campus, and New Delhi-110012</p>

<p>More at http://www.nrcpb.org/sites/default/files/Adverdisement_0.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</guid>
	<pubDate>Fri, 07 Apr 2023 13:11:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</link>
	<title><![CDATA[Carrot2 clustering engine]]></title>
	<description><![CDATA[<h2>&nbsp;</h2>
<p>This is the demo application of the&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;clustering engine</a>. It uses Carrot<sup>2</sup>'s algorithms to organize search results into thematic folders.</p>
<h3>User interfaces</h3>
<ul>
<li><span><a href="https://search.carrot2.org/#/search/:source">Web Search Clustering</a></span>&nbsp;organizes search results from public search engines into clusters; offers treemap- and pie-chart visualizations of the clusters.</li>
<li><span><a href="https://search.carrot2.org/#/workbench">Clustering Workbench</a></span>&nbsp;clusters content from local files in JSON or Excel format, Solr or Elasticsearch; allows tuning of clustering parameters and exporting results as Excel or JSON.</li>
</ul>
<h3>Search engines</h3>
<ul>
<li><span>Web</span>:&nbsp;<span>web search results provided by&nbsp;<a href="https://etools.ch/" target="_blank">etools.ch</a>. Extensive use may require special arrangements with the&nbsp;<a href="mailto:sschmid@comcepta.com" target="_blank">owner</a>&nbsp;of the etools.ch service.</span></li>
<li><span>PubMed</span>:&nbsp;<span>abstracts of medical papers from the PubMed database provided by NCBI.</span></li>
<li><span>Local file</span>:&nbsp;<span>content read from a local file in Carrot2 XML, JSON, CSV or Excel format.</span></li>
<li><span>Solr</span>:&nbsp;<span>queries an Apache Solr instance.</span></li>
<li><span>Elasticsearch</span>:&nbsp;<span>queries an Elasticsearch instance.</span></li>
</ul>
<h3>Clustering algorithms</h3>
<ul>
<li><span>Lingo</span>:&nbsp;<span>creates well-described flat clusters. Does not scale beyond a few thousand search results. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a>.</span></li>
<li><span>STC</span>:&nbsp;<span>the classic search results clustering algorithm. Produces flat cluster with adequate description, very fast. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
<li><span>k-means</span>:&nbsp;<span>base line clustering algorithm, produces bag-of-words style cluster descriptions. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
</ul><p>Address of the bookmark: <a href="https://search.carrot2.org/#/search/web" rel="nofollow">https://search.carrot2.org/#/search/web</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>