<?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/38443?offset=390</link>
	<atom:link href="https://bioinformaticsonline.com/related/38443?offset=390" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41272/rainbowr-reliable-association-inference-by-optimizing-weights-with-r-r-package-for-snp-set-gwas-and-multi-kernel-mixed-model</guid>
	<pubDate>Fri, 28 Feb 2020 23:27:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41272/rainbowr-reliable-association-inference-by-optimizing-weights-with-r-r-package-for-snp-set-gwas-and-multi-kernel-mixed-model</link>
	<title><![CDATA[RAINBOWR: Reliable Association INference By Optimizing Weights with R (R package for SNP-set GWAS and multi-kernel mixed model)]]></title>
	<description><![CDATA[<p><code>RAINBOWR</code>(Reliable Association INference By Optimizing Weights with R) is a package to perform several types of <code>GWAS</code> as follows.</p>
<ul>
<li>Single-SNP GWAS with <code>RGWAS.normal</code> function</li>
<li>SNP-set (or gene set) GWAS with <code>RGWAS.multisnp</code> function (which tests multiple SNPs at the same time)</li>
<li>Check epistatic (SNP-set x SNP-set interaction) effects with <code>RGWAS.epistasis</code> (very slow and less reliable)</li>
</ul>
<p>https://github.com/KosukeHamazaki/RAINBOWR</p>
<p>https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007663</p>
<p>https://cran.r-project.org/web/packages/RAINBOWR/index.html</p><p>Address of the bookmark: <a href="https://github.com/KosukeHamazaki/RAINBOWR" rel="nofollow">https://github.com/KosukeHamazaki/RAINBOWR</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42313/crbhits-from-conditional-reciprocal-best-hits-to-codon-alignments-and-kaks-in-r</guid>
	<pubDate>Wed, 11 Nov 2020 23:06:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42313/crbhits-from-conditional-reciprocal-best-hits-to-codon-alignments-and-kaks-in-r</link>
	<title><![CDATA[CRBHits: From Conditional Reciprocal Best Hits to Codon Alignments and Ka/Ks in R]]></title>
	<description><![CDATA[<p>CRBHits is a coding sequence (CDS) analysis pipeline in R (R Core Team, 2019). It reimplements the Conditional Reciprocal Best Hit (CRBH) algorithm crb-blast and covers all necessary steps from sequence similarity searches, codon alignments to Ka/Ks calculations and synteny. The new R package targets ecology, population and evolutionary biologists working in the field of comparative genomics.</p><p>Address of the bookmark: <a href="https://gitlab.gwdg.de/mpievolbio-it/crbhits" rel="nofollow">https://gitlab.gwdg.de/mpievolbio-it/crbhits</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<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/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</guid>
	<pubDate>Tue, 17 Sep 2024 02:34:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</link>
	<title><![CDATA[SVbyEye: R Package to visualize alignments between two or multiple DNA sequences]]></title>
	<description><![CDATA[<p dir="auto">R Package to visualize alignments between two or multiple DNA sequences including<br>a number of functionalities to facilitate processing of alignments in PAF format.</p>
<p dir="auto"><span>SVbyEye, an open-source R package to visualize and annotate sequence-to-sequence alignments along with various functionalities to process alignments in PAF format. The tool facilitates the characterization of complex SVs in the context of sequence homology helping resolve the mechanisms underlying their formation. Availability and implementation SVbyEye is available at https://github.com/daewoooo/SVbyEye.</span></p>
<p dir="auto">Author: David Porubsky</p><p>Address of the bookmark: <a href="https://github.com/daewoooo/SVbyEye" rel="nofollow">https://github.com/daewoooo/SVbyEye</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/1973/webinar-wednesday-21-august-2013-at-noon-edt</guid>
	<pubDate>Sun, 11 Aug 2013 19:31:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/1973/webinar-wednesday-21-august-2013-at-noon-edt</link>
	<title><![CDATA[Webinar: Wednesday 21 August 2013 at Noon EDT]]></title>
	<description><![CDATA[<p>This webinar will describe the use of combinatorial pooling to reconstruct gene sequences within BACs. Recent work in barley has shown that this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.</p><p>http://www.extension.org/pages/67926/upcoming-webinar:-selective-sequencing-through-combinatorial-pooling#.UggsVuHyPqU</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10392/research-associate-ra-at-institute-of-advanced-study-in-science-and-technology</guid>
  <pubDate>Mon, 05 May 2014 08:44:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate (RA) at INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY]]></title>
  <description><![CDATA[
<p>INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY<br />(An Autonomous Institute under Department of Science and Technology, Govt. of India)<br />Paschim Boragaon, Garchuk, Guwahati-781035</p>

<p>Appointment Adv.No.2</p>

<p>Applications in plain paper are invited from Indian citizens for one/two position each of Research Associate, Traineeship and Studentship for BIF facility, Division of Life Sciences, IASST.</p>

<p>Applications with complete Bio-data containing contact address, e-mail and phone number, two recent passport size photographs and attested copies of mark sheets, certificates etc., should be sent to the Registrar, IASST, Paschim Boragaon, Garchuk, Guwahati – 781035, Assam, so as to reach on or before 5/05/2014.</p>

<p>A. Research Associate:</p>

<p>Number of vacancies: 1 (One)</p>

<p>Qualifications:</p>

<p>PhD in Bioinformatics or allied disciplines with knowledge of Bioinformatics. The candidates who have submitted PhD thesis may also apply.</p>

<p>In case, candidates having PhD are not found, candidates having MSc in Bioinformatics or allied disciplines with sound knowledge of Bioinformatics will be preferred.</p>

<p>Remuneration: Candidate having PhD will get a consolidated remuneration of Rs. 22,000/- +HRA per month. MSc having NET/GATE/SLET qualified candidate will get a remuneration of Rs. 16,000/= and HRA and candidate with only MSc will get a remuneration of Rs.14,000/- and HRA.</p>

<p>Tenure:</p>

<p>The post is initially for one year and may be extended depending on the performance till the tenure of the project.</p>

<p>B. Traineeship:</p>

<p>Number of vacancies: 2 (Two)</p>

<p>Qualifications:</p>

<p>Candidate with a postgraduate degree in Bioinformatics/Biotechnology/Life sciences from a recognised University</p>

<p>Remuneration: Rs. 5000/month for 6 months</p>

<p>C. Studentship:</p>

<p>Number of vacancies: 2 (Two)</p>

<p>Qualifications:</p>

<p>Candidate pursuing M.Sc in bioinformatics in a recognised University.</p>

<p>Remuneration: Rs. 5000/month for 6 months</p>

<p>Advertisement:</p>

<p>http://iasst.gov.in/pdf/recruitment/advt%20no_2_24042014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11195/ncbi-gene-screencast</guid>
	<pubDate>Fri, 30 May 2014 06:21:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11195/ncbi-gene-screencast</link>
	<title><![CDATA[NCBI Gene Screencast]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/WyFIf7YdM8A" frameborder="0" allowfullscreen></iframe>A short walkthrough of the NCBI Gene page]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</guid>
	<pubDate>Wed, 22 Jun 2016 05:41:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</link>
	<title><![CDATA[NearHGT]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the transfer of genetic material between organisms, is crucial for genetic innovation and the evolution of genome architecture. Existing HGT detection algorithms rely on a strong phylogenetic signal distinguishing the transferred sequence from ancestral (vertically derived) genes in its recipient genome. Detecting HGT between closely related species or strains is challenging, as the phylogenetic signal is usually weak and the nucleotide composition is normally nearly identical. Nevertheless, there is a great importance in detecting HGT between congeneric species or strains, especially in clinical microbiology, where understanding the emergence of new virulent and drug-resistant strains is crucial, and often time-sensitive.</p>
<p>We developed a novel, self-contained technique named&nbsp;<em>Near HGT</em>, based on the&nbsp;<em>synteny index</em>, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the&nbsp;<em>constant relative mutability</em>&nbsp;(CRM). Using CRM, the algorithm assigns a confidence score based on &ldquo;unusual&rdquo; sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three&nbsp;<em>E. coli</em>&nbsp;strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.</p>
<p>When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.</p>
<p><strong>Availability:</strong><span>&nbsp;The method is publicly available at</span><a href="http://research.haifa.ac.il/~ssagi/software/nearHGT.zip">http://research.haifa.ac.il/~ssagi/software/nearHGT.zip</a></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</guid>
	<pubDate>Tue, 26 Dec 2017 21:14:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</link>
	<title><![CDATA[PASA: Gene Structure Annotation and Analysis]]></title>
	<description><![CDATA[<p><span>PASA, acronym for Program to Assemble Spliced Alignments, is a eukaryotic genome annotation tool that exploits spliced alignments of expressed transcript sequences to automatically model gene structures, and to maintain gene structure annotation consistent with the most recently available experimental sequence data. PASA also identifies and classifies all splicing variations supported by the transcript alignments.</span></p><p>Address of the bookmark: <a href="http://pasapipeline.github.io/" rel="nofollow">http://pasapipeline.github.io/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

</channel>
</rss>