<?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/27427?offset=1350</link>
	<atom:link href="https://bioinformaticsonline.com/related/27427?offset=1350" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/25987/chekulaevalab</guid>
  <pubDate>Tue, 12 Jan 2016 02:32:03 -0600</pubDate>
  <link></link>
  <title><![CDATA[Chekulaevalab]]></title>
  <description><![CDATA[
<p>Focusing on understanding the molecular mechanisms that regulate mRNA translation, localization and stability and role of non-coding RNAs in this process. Up to 90% of human DNA is estimated to be transcribed into so called non-coding RNAs that are not translated into proteins. Many of them act as potent modifiers of gene expression. miRNAs are a class of such short non-coding RNAs. They regulate expression of more than a half of eukaryotic genes, thus, affecting multiple biological processes, including cell proliferation, differentiation, apoptosis and senescence. Not surprisingly, miRNAs are involved in many human pathologies, including cancer and neurological disorders and hold great potential as drug targets, disease markers, as well as therapeutic agents.<br />Our lab is located at the Berlin Institute for Medical Systems Biology (BIMSB), a part of the Max Delbrück Center for Molecular Medicine (MDC).</p>

<p>http://www.chekulaevalab.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37732/making-2d-hilbert-curve</guid>
	<pubDate>Mon, 17 Sep 2018 05:43:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37732/making-2d-hilbert-curve</link>
	<title><![CDATA[Making 2D Hilbert Curve]]></title>
	<description><![CDATA[<p><a href="https://en.wikipedia.org/wiki/Hilbert_curve">Hilbert curve</a>&nbsp;is a type of space-filling curves that folds one dimensional axis into a two dimensional space, but still keeps the locality. It has advantages to visualize data with long axis in following two aspects:</p>
<ol>
<li>greatly improve resolution of the visualization fron n to&nbsp;<span><span><span><span><span><span><span>&radic;</span></span><span><span><span><span>n</span></span></span></span></span></span></span></span><span>n</span></span>;</li>
<li>easy to visualize clusters because generally data points in the axis will also be close in the 2D space.</li>
</ol>
<p>This package aims to provide an easy and flexible way to visualize data through Hilbert curve. The implementation and example figures are based on following sources:</p>
<ul>
<li><a href="http://mkweb.bcgsc.ca/hilbert/">http://mkweb.bcgsc.ca/hilbert/</a></li>
<li><a href="http://corte.si/posts/code/hilbert/portrait/index.html">http://corte.si/posts/code/hilbert/portrait/index.html</a></li>
<li><a href="http://bioconductor.org/packages/devel/bioc/html/HilbertVis.html">http://bioconductor.org/packages/devel/bioc/html/HilbertVis.html</a></li>
</ul><p>Address of the bookmark: <a href="https://bioconductor.org/packages/devel/bioc/vignettes/HilbertCurve/inst/doc/HilbertCurve.html" rel="nofollow">https://bioconductor.org/packages/devel/bioc/vignettes/HilbertCurve/inst/doc/HilbertCurve.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26567/ra-at-university-of-pune</guid>
  <pubDate>Mon, 07 Mar 2016 03:48:33 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Pune]]></title>
  <description><![CDATA[
<p>Research Associate Job vacancies in University of Pune on temporary basis</p>

<p>No. of Post : 01</p>

<p>Department : Science and Technology</p>

<p>Qualifications : Ph.D. with specialization in Bioinformatics/Machine Learning/ Mathematical Biology/ Computational Biology/ Systems Biology with a minimum of 55% marks in M. Sc. (50% for candidates belongs to reserved category) or equivalent grade.  Candidates who have submitted their Ph.D. thesis and are waiting for award of Ph.D. are also eligible. OR M. Sc. Bioinformatics with two years of research experience in the areas mentioned above, a minimum of 55% marks in M.Sc. (50% for candidates belongs to reserved categories) or equivalent grade and at least one publication in Science Citation Index (SCI) journal. Preference will be given to B.I.N.C. /J.R.F. /N.E.T. /S.E.T. qualified candidates.  </p>

<p>Emoluments : Rs. 20,000/- (Including H.R.A.) per month.<br />How to apply</p>

<p>The complete application along with necessary documents and certificates should reach to 'The Director, Bioinformatics Centre, Savitribai Phule Pune University (Formerly University of Pune), Caneshkhind Road. Pune - 411 007 on or before 21st March, 2016 within official hours except Sundays (i.e. 10.20 am to 06.00 pm).</p>

<p>More at http://collegecirculars.unipune.ac.in/sites/documents/Job%20Openings/Forms/AllItems.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39884/retrieving-taxonomic-information-with-r</guid>
	<pubDate>Thu, 29 Aug 2019 01:38:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39884/retrieving-taxonomic-information-with-r</link>
	<title><![CDATA[Retrieving Taxonomic Information with R]]></title>
	<description><![CDATA[<p>This vignette will introduce users to the retrieval of taxonomic information with&nbsp;<code>myTAI</code>. The&nbsp;<code>taxonomy()</code>&nbsp;function implemented in&nbsp;<code>myTAI</code>&nbsp;relies on the powerful package&nbsp;<a href="https://github.com/ropensci/taxize">taxize</a>. Nevertheless, taxonomic information retrieval has been customized for the&nbsp;<code>myTAI</code>&nbsp;standard and for organism specific information retrieval.</p>
<p>Specifically, the&nbsp;<code>taxonomy()</code>&nbsp;function implemented in&nbsp;<code>myTAI</code>&nbsp;can be used to classify genomes according to phylogenetic classification into Phylostrata (Phylostratigraphy) or to retrieve species specific taxonomic information when performing Divergence Stratigraphy (see&nbsp;<a href="https://cran.r-project.org/web/packages/myTAI/vignettes/Introduction.html">Introduction</a>&nbsp;for details).</p><p>Address of the bookmark: <a href="https://cran.r-project.org/web/packages/myTAI/vignettes/Taxonomy.html" rel="nofollow">https://cran.r-project.org/web/packages/myTAI/vignettes/Taxonomy.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40463/%E2%80%98dockr%E2%80%99-the-r-container</guid>
	<pubDate>Mon, 23 Dec 2019 09:56:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40463/%E2%80%98dockr%E2%80%99-the-r-container</link>
	<title><![CDATA[‘dockr’: the R container]]></title>
	<description><![CDATA[<p><code>dockr</code> 0.8.6 is now available on CRAN. <code>dockr</code> is a minimal toolkit to build a lightweight Docker container image for your R package, in which the package itself is available. The Docker image seeks to mirror your R session as close as possible with respect to R specific dependencies. Both dependencies on CRAN R packages as well as local non-CRAN R packages will be included in the Docker container image.</p>
<p>If you want to know, how Docker works, and why you should consider using Docker, please take a look at the <a href="https://www.docker.com/why-docker" target="_blank">Docker website</a>.</p><p>Address of the bookmark: <a href="https://www.docker.com/why-docker" rel="nofollow">https://www.docker.com/why-docker</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/41496/new-machine-learning-packages-in-r</guid>
	<pubDate>Fri, 27 Mar 2020 12:11:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/41496/new-machine-learning-packages-in-r</link>
	<title><![CDATA[New Machine Learning Packages in R]]></title>
	<description><![CDATA[<h3 id="machine-learning">Machine Learning</h3><p><a href="https://cran.r-project.org/package=autokeras">autokeras</a>&nbsp;v1.0.1: Implements an interface to&nbsp;<a href="https://autokeras.com/">AutoKeras</a>, an open source software library for automated machine learning. See&nbsp;<a href="https://cran.r-project.org/web/packages/autokeras/readme/README.html">README</a>&nbsp;for an example.</p><p><a href="https://cran.r-project.org/package=MTPS">MTPS</a>&nbsp;v0.1.9: Implements functions to predict simultaneous multiple outcomes based on revised stacking algorithms as described in&nbsp;<a href="denied:doi:10.1093/bioinformatics/btz531">Xing et al. (2019)</a>. See the&nbsp;<a href="https://cran.r-project.org/web/packages/MTPS/vignettes/Guide.html">vignette</a>&nbsp;to get started.</p><p><a href="https://cran.r-project.org/package=quanteda.textmodels">quanteda.textmodels</a>&nbsp;v0.9.1: Implements methods for scaling models and classifiers based on sparse matrix objects representing textual data. It includes implementations of the&nbsp;<a href="denied:doi:10.1017/S0003055403000698">Laver et al. (2003)</a>&nbsp;wordscores model, the&nbsp;<a href="denied:arxiv:1710.08963">Perry &amp; Benoit&rsquo;s (2017)</a>&nbsp;class affinity scaling model, and the&nbsp;<a href="denied:doi:10.1111/j.1540-5907.2008.00338.x">Slapin &amp; Proksch (2008)</a>&nbsp;wordfish model. See the&nbsp;<a href="https://cran.r-project.org/web/packages/quanteda.textmodels/vignettes/textmodel_performance.html">vignette</a>&nbsp;to get started.</p><p><a href="https://cran.r-project.org/package=SeqDetect">SeqDetect</a>&nbsp;v1.0.7: Implements the automaton model found in&nbsp;<a href="https://ieeexplore.ieee.org/document/8910574">Krleža, Vrdoljak &amp; Brčić (2019)</a>&nbsp;to detect and process sequences. See the&nbsp;<a href="https://cran.r-project.org/web/packages/SeqDetect/vignettes/SequentialDetector.pdf">vignette</a>&nbsp;for examples and theory.</p><p><a href="https://cran.r-project.org/package=studyStrap">studyStrap</a>&nbsp;v1.0.0: Implements multi-Study Learning algorithms such as Merging, Study-Specific Ensembling (Trained-on-Observed-Studies Ensemble), the Study Strap, and the Covariate-Matched Study Strap. and offers over 20 similarity measures. See&nbsp;<a href="denied:doi:10.1101/856385">Kishida, et al. (2019)</a>&nbsp;for background and the&nbsp;<a href="https://cran.r-project.org/web/packages/studyStrap/vignettes/vignette.html">vignette</a>&nbsp;for how to use the package.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26336/project-fellow-bioinformatics-at-central-university-of-himachal-pradesh</guid>
  <pubDate>Tue, 09 Feb 2016 03:58:00 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow Bioinformatics at Central University of Himachal Pradesh]]></title>
  <description><![CDATA[
<p>Project Fellow Bioinformatics</p>

<p>Eligibility : MSc(Bio-Chemistry, Bio-Informatics)</p>

<p>Location : Kulu</p>

<p>Last Date : 07 Mar 2016</p>

<p>Hiring Process : Face to Face Interview<br />Central University of Himachal Pradesh</p>

<p>Project Fellow Bioinformatics Job in Central University of Himachal Pradesh</p>

<p>Project (MRP) entitled: “A project proposal on targeting novel prokaryotic ubiquitin like post-translational modification pathway for therapeutic interventions against Mycobacterium tuberculosis” (No. MRP-MAJOR-MICR-2013-26840)</p>

<p>Essential Qualification: 1. Master degree in Bioinformatics/Biochemistry/Biotechnology/Environmental Science/Microbiology or any branch of Life Sciences with a minimum of 55% marks for general category (50% in case of SC/ST/PH) 2. UGC/CSIR NET, GATE qualified candidates will be given preference. Desirable Qualification: Experience in basic Bioinformatics and Molecular Biology techniques.</p>

<p>Age: Below 40 years as on 01/10/2015.</p>

<p>No.of Post: 1</p>

<p>Salary: NET/GATE qualified candidate: Rs. 16,000/-p.m. for initial two years and Rs. 18,000/- p.m. for the third year. Non-NET/GATE candidates: Rs. 14,000/-p.m. for initial two years and Rs. 16,000/-p.m. for the third year.</p>

<p>Mode of Selection: The selection shall be made on the basis of merit. The eligible candidates are required to appear for interview before the duly constituted Selection Committee for the purpose. The scheduled date, time and venue for the interview shall be intimated to the eligible candidates through phone/ e-mail.<br />How to apply</p>

<p>Last date for the receipt of applications is 07.03.2016. </p>

<p>More at http://www.cuhimachal.ac.in/news_all.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</guid>
	<pubDate>Fri, 01 Apr 2022 19:05:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</link>
	<title><![CDATA[R Shiny in Life Sciences – Top 7 Dashboard Examples]]></title>
	<description><![CDATA[<p><span>&nbsp;R Shiny is one of the easiest ways for developers to make production-ready dashboards when speed and functionality are crucial. Shiny is approachable with a lot of documentation available, and because of this, a lot of developers/researchers with non-coding backgrounds are able to produce some impressive results. The whole ecosystem is easy to get your head around and pretty much limitless with regard to what you can do.</span></p><p>Address of the bookmark: <a href="https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/" rel="nofollow">https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26378/centurion</guid>
	<pubDate>Fri, 12 Feb 2016 04:45:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26378/centurion</link>
	<title><![CDATA[Centurion]]></title>
	<description><![CDATA[<p>Although centromeres are essential for life and are the subject of extensive research, centromere locations in yeast genomes are difficult to infer, and in most species they are still unknown. Recently, the chromatin conformation assay Hi-C has been re-purposed for diverse applications, including de novo genome assembly, deconvolution of metagenomic samples, and inference of centromere locations. We describe a method, Centurion, that jointly infers the locations of all centromeres in a single yeast genome by exploiting the centromeres&rsquo; tendency to cluster in 3D space. We first demonstrate the accuracy of Centurion in identifying known centromere locations from high coverage Hi-C data of budding yeast and a human malaria parasite. We then use two metagenomic samples with relatively low coverage Hi-C data to infer centromere locations for each chromosome in 14 different yeast species. For yeasts with large centromeres (e.g., S. pombe) Centurion predicts the exact centromere locations. For seven yeasts with point centromeres, Centurion predicts most of the centromeres at an average of 5~kb distance from their known locations. Finally, we predict centromere coordinates for six yeast species that currently lack centromere annotations. These results suggest that Centurion can be used for centromere identification for a large number of yeast species, even with a limited amount of Hi-C sequencing.</p>
<p>Paper:http://www.ncbi.nlm.nih.gov/pubmed/25940625</p>
<p>More at http://cbio.ensmp.fr/centurion/</p><p>Address of the bookmark: <a href="http://cbio.ensmp.fr/centurion/" rel="nofollow">http://cbio.ensmp.fr/centurion/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>