<?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/29917?offset=1370</link>
	<atom:link href="https://bioinformaticsonline.com/related/29917?offset=1370" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44445/ppanggolin-depicting-microbial-species-diversity-via-a-partitioned-pangenome-graph-of-linked-neighbors</guid>
	<pubDate>Thu, 01 Feb 2024 00:24:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44445/ppanggolin-depicting-microbial-species-diversity-via-a-partitioned-pangenome-graph-of-linked-neighbors</link>
	<title><![CDATA[PPanGGOLiN: Depicting microbial species diversity via a Partitioned PanGenome Graph Of Linked Neighbors]]></title>
	<description><![CDATA[<p dir="auto"><span>PPanGGOLiN</span>&nbsp;(<a href="https://doi.org/10.1371/journal.pcbi.1007732">Gautreau et al. 2020</a>) is a software suite used to create and manipulate prokaryotic pangenomes from a set of either genomic DNA sequences or provided genome annotations. It is designed to scale up to tens of thousands of genomes. It has the specificity to partition the pangenome using a statistical approach rather than using fixed thresholds which gives it the ability to work with low-quality data such as&nbsp;<em>Metagenomic Assembled Genomes (MAGs)</em>&nbsp;or&nbsp;<em>Single-cell Amplified Genomes (SAGs)</em>&nbsp;thus taking advantage of large scale environmental studies and letting users study the pangenome of uncultivable species.</p>
<p dir="auto">A complete documentation is available&nbsp;<a href="https://ppanggolin.readthedocs.io/">here</a>.</p>
<p dir="auto" style="text-align: center;"><a href="https://github.com/labgem/PPanGGOLiN/blob/master/docs/_static/logo.png" target="_blank"><img src="https://github.com/labgem/PPanGGOLiN/raw/master/docs/_static/logo.png" alt="logo" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/labgem/PPanGGOLiN" rel="nofollow">https://github.com/labgem/PPanGGOLiN</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5623/yau-group</guid>
  <pubDate>Tue, 15 Oct 2013 13:05:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yau Group]]></title>
  <description><![CDATA[
<p>Yau Group are a new research group based at the Wellcome Trust Centre for Human Genetics and the Department of Statistics at the University of Oxford.</p>

<p>Yau Group develops statistical and computational methods for the analysis of genomic datasets with a particular interest in cancer sequencing applications and the use of Bayesian Statistics.</p>

<p>Yau Group are currently have projects in somatic mutation analysis of heterogeneous cancers, data fusion or integration techniques and single cell genomics.</p>

<p>More @ http://www.well.ox.ac.uk/~cyau/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</guid>
	<pubDate>Wed, 14 Nov 2018 04:50:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</link>
	<title><![CDATA[MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph]]></title>
	<description><![CDATA[<p><span>MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct&nbsp;</span><em>de Bruijn</em><span>&nbsp;graph (SdBG) to achieve low memory assembly. MEGAHIT can&nbsp;</span><span>optionally</span><span>&nbsp;utilize a CUDA-enabled GPU to accelerate its SdBG contstruction. The GPU-accelerated version of MEGAHIT has been tested on NVIDIA GTX680 (4G memory) and Tesla K40c (12G memory) with CUDA 5.5, 6.0 and 6.5. MEGAHIT v1.0 or greater also supports IBM Power PC and has been tested on IBM POWER8.</span></p>
<p><span>https://academic.oup.com/bioinformatics/article/31/10/1674/177884</span></p><p>Address of the bookmark: <a href="https://github.com/voutcn/megahit" rel="nofollow">https://github.com/voutcn/megahit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7218/associate-professor-centre-for-bioinformatics-at-maharshi-dayanand-university-rohtak</guid>
  <pubDate>Thu, 12 Dec 2013 20:49:59 -0600</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Centre for Bioinformatics at Maharshi Dayanand University, Rohtak]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT No. PR-54/2013</p>

<p>No. of Posts and Specialization: 1(UR)</p>

<p>Educational Qualification:</p>

<p>(i) Good academic record with a Ph.D. Degree in the concerned /allied /relevant disciplines.</p>

<p>(ii) The Ph.D. Degree shall be a mandatory qualification for all candidates to be appointed as Associate Professor through direct recruitment.</p>

<p>(iii) A Master‟s Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>(iv) A minimum of eight years of experience of teaching and /or research in an academic /research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/Industry excluding the period of Ph.D research with evidence of published work and a minimum of 5 publications as books and /or research papers in refereed journals only/policy papers.</p>

<p>(v) Contribution to educations innovation, design of new curricula and courses and technology-mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>(vi) A minimum score as stipulated in the Academic Performance Indicator (API) based performance Based Appraisal System (PBAS), set out in this notification in as mentioned in the advertisement.</p>

<p>Send your application to the A.R (Estt.Teaching), M.D.University, Rohtak on or before December 23, 2013.</p>

<p>For more details: http://www.mdurohtak.ac.in/pdf/Notices_Pdf/new_notice/Teaching%20Vacancy%20%28ADVT.%20No.%20PR-54%20of%202013%29.pdf</p>

<p>Last Apply Date: 23 Dec 2013</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</guid>
	<pubDate>Fri, 05 Feb 2021 21:22:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</link>
	<title><![CDATA[GraphUnzip: Phases an assembly graph using Hi-C data and/or long reads.]]></title>
	<description><![CDATA[<p>GraphUnzip, a fast, memory-efficient and accurate tool to unzip assembly graphs into their constituent haplotypes using long reads and/or Hi-C data. As GraphUnzip only connects sequences in the assembly graph that already had a potential link based on overlaps, it yields high-quality gap-less supercontigs. To demonstrate the efficiency of GraphUnzip, we tested it on a simulated diploid Escherichia coli genome, and on two real datasets for the genomes of the rotifer Adineta vaga and the potato Solanum tuberosum. In all cases, GraphUnzip yielded highly continuous phased assemblies.</p>
<p>https://www.biorxiv.org/content/biorxiv/early/2021/02/01/2021.01.29.428779.full.pdf</p><p>Address of the bookmark: <a href="https://github.com/nadegeguiglielmoni/GraphUnzip" rel="nofollow">https://github.com/nadegeguiglielmoni/GraphUnzip</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5888/nit-calicut-faculty-jobs-2013-in-bioinformatics</guid>
  <pubDate>Thu, 24 Oct 2013 13:00:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[NIT Calicut Faculty Jobs 2013 in Bioinformatics]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF TECHNOLOGY CALICUT, KERALA</p>

<p>NOTIFICATION FOR FACULTY RECRUITMENT – 2013</p>

<p>(Faculty openings in Technology, Science, Architecture and Management at NIT Calicut, Kerala)</p>

<p>National Institute of Technology Calicut, Kerala, established under Act XXIX/ 2007of the Parliament is one of the leading technological institutions in the Country with nearly 6000 students enrolled for various UG, PG and Ph.D. programmes in Technology, Science, Architecture and Management. The Institute invites applications from Indian nationals, possessing consistent excellent academic record, commitment to quality teaching and potential for carrying out outstanding research, for the post of Assistant Professors in various departments against the backlog reserved vacancies for Scheduled Caste (SC), Scheduled Tribe (ST), Other Backward Communities (OBC) and Persons with Disabilities (PWDs) and also under open merit quota as detailed below. Candidates belonging to SC, ST and OBC desirous of considering for selection under UR category also shall specifically indicate so in column 4.</p>

<p>Reservation quota for PWDs will be counted against the respective community. Young, meritorious, dynamic and student friendly academicians are welcome to join hands with the existing team in their effort to transform this Institute to a world class educational institution.</p>

<p>Candidates possessing Ph.D. degree will be considered for appointment on contract basis initially.</p>

<p>They will be considered for movement to AGP `7000 after one year of satisfactory performance.</p>

<p>Meritorious candidates possessing M.Tech./M.Phil. (*) with remarkably good potential to carry out outstanding research and already pursuing Ph.D. or aspiring to pursue Ph.D. will also be considered for appointment on contract, initially for a period of 3 years, extendable for a further period of 2 years on a year to year basis or till the candidate acquires Ph.D. degree whichever is earlier. Renewal of contract<br />will be done on an annual basis, subject to satisfactory progress of Ph.D. work, good conduct and good performance in teaching. Faculty appointed on contract basis will not be treated as regular staff till they are regularized, subject to the conditions stated earlier. The Institute has adopted 4-tier flexible faculty structure recommended by MHRD. </p>

<p>More Info : http://www.nitc.ac.in/index.php/?url=content/submenu/2345/5</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44497/graphpath-a-graph-attention-model-for-molecular-stratification-with-interpretability-based-on-the-pathway-pathway-interaction-network</guid>
	<pubDate>Wed, 27 Mar 2024 20:51:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44497/graphpath-a-graph-attention-model-for-molecular-stratification-with-interpretability-based-on-the-pathway-pathway-interaction-network</link>
	<title><![CDATA[GraphPath: A graph attention model for molecular stratification with interpretability based on the pathway-pathway interaction network]]></title>
	<description><![CDATA[<p><span>Achieving accurate and interpretable clinical predictions requires paramount attention to thoroughly characterizing patients at both the molecular and biological pathway levels. In this paper, we present GraphPath, a biological knowledge-driven graph neural network with multi-head self-attention mechanism that implements the pathway-pathway interaction network. We train GraphPath to classify the cancer status of patients with prostate cancer based on their multi-omics profiling.</span></p>
<p><span><img src="https://github.com/amazingma/GraphPath/raw/main/Figures/GraphPath.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/amazingma/GraphPath" rel="nofollow">https://github.com/amazingma/GraphPath</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5958/srfjrf-national-institute-of-immunology</guid>
  <pubDate>Wed, 30 Oct 2013 06:45:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF @ National Institute of Immunology]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT OF WALK-IN-INTERVIEW</p>

<p>NAME OF THE POST : SRF/JRF (Four Posts only)</p>

<p>DURATION : Indicated with the respective project mentioned below:</p>

<p>NAME OF THE PROJECT : As Mentioned below:</p>

<p>1. Serological diversity and molecular characterization of Dichelobector nodusus and development of vaccine against virulent footroot funded by NAIP. (Tenable upto 31.03.2014)</p>

<p>2. Development of oral vaccine against Clostridium perfringenes employing translational fusion of immunodominant epitopes of beta toxin with heat labile entertoxin B funded by DBT. (Tenable upto 25.02.2014)</p>

<p>3. Indo-Norwegian project, “Evaluation of major porins, ompC and ompR of Areomonas hydrophila as potential vaccine candidates and identification and characterization of immune genes of Indian major carp, Labeo rohita” (Tenable upto 31.03.2014)</p>

<p>EDUCATIONAL QUALIFICATIONS: For JRF- M.Sc/M.Tech in any subject of Biological  Sciences/Life Sciences</p>

<p>For SRF- M.Sc/M.Tech in any subject of Biological Sciences/Life Sciences with 2 years of Research Experience.</p>

<p>JOB DESCRIPTION : The Candidate should have experience in gene Expression, protein purification, molecular biology techniques and bioinformatics<br />EMOLUMENTS : SRF: Rs. 18,000/- per month consolidated plus 30% HRA if /NET/GATE qualified otherwise Rs. 14,000/- per month consolidated + 30% HRA.</p>

<p>JRF: Rs. 16,000/- per month consolidated + 30% HRA if NET/GATE qualified otherwise Rs. 12,000/- per month consolidated + 30% HRA</p>

<p>SCIENTIST NAME : Dr. Lalit C. Garg, SS-VII (Gene Regulation Lab)</p>

<p>SCIENTIST’S EMAIL : lalit@nii.ac.in</p>

<p>WALK IN INTERVIEW ON : October 31st, 2013</p>

<p>REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM </p>

<p>Advertisement: http://www1.nii.res.in/sites/default/files/project-Dr.Lalit-31oct2013.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38646/visnetwork-an-r-package-for-network-visualization-using-visjs-javascript-library</guid>
	<pubDate>Wed, 09 Jan 2019 11:00:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38646/visnetwork-an-r-package-for-network-visualization-using-visjs-javascript-library</link>
	<title><![CDATA[visNetwork: an R package for network visualization, using vis.js javascript library]]></title>
	<description><![CDATA[<div id="introduction">
<p><strong>visNetwork</strong>&nbsp;is an R package for network visualization, using&nbsp;<strong>vis.js</strong>&nbsp;javascript library (<a href="http://visjs.org/">http://visjs.org/</a>). All remarks and bugs are welcome on github :&nbsp;<a href="https://github.com/datastorm-open/visNetwork">https://github.com/datastorm-open/visNetwork</a>.</p>
</div>
<div id="features">
<h2>Features</h2>
<p>Based on&nbsp;<a href="http://www.htmlwidgets.org/">htmlwidgets</a>, so :</p>
<ul>
<li>compatible with&nbsp;<a href="http://shiny.rstudio.com/">shiny</a>, R Markdown documents, and RStudio viewer</li>
</ul>
<p>The package proposes all the features available in&nbsp;<strong>vis.js</strong>&nbsp;API, and even more with special features for R :</p>
<ul>
<li>easy to use</li>
<li>custom shapes, styles, colors, sizes, &hellip;</li>
<li>works smooth on any modern browser for up to a few thousand nodes and edges</li>
<li>interactivity controls (highlight, collapsed nodes, selection, zoom, physics, movement of nodes, tooltip, events, &hellip;)</li>
<li>visualize&nbsp;<code>rpart</code>&nbsp;tree</li>
<li></li>
</ul>
</div><p>Address of the bookmark: <a href="https://datastorm-open.github.io/visNetwork/" rel="nofollow">https://datastorm-open.github.io/visNetwork/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6104/incob-2014</guid>
  <pubDate>Thu, 07 Nov 2013 17:53:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[InCoB 2014]]></title>
  <description><![CDATA[
<p>The 13th International Conference on Bioinformatics (InCoB 2014) will be held in Novotel Sydney Brighton Beach, Sydney, New South Wales, Australia. This year, the InCoB will be held earlier from 31st July to 2nd August 2014 to run back-to-back with the International Biophysics Congress 2014 at the Brisbane Convention and Exhibition Centre, Queensland (3-7 Aug).</p>

<p>More at http://incob2014.org/</p>
]]></description>
</item>

</channel>
</rss>