<?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/13267?offset=1410</link>
	<atom:link href="https://bioinformaticsonline.com/related/13267?offset=1410" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29883/ra-bioinformatics-at-school-of-computational-integrative-sciences-jnu-india</guid>
  <pubDate>Fri, 18 Nov 2016 03:57:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at School of Computational &amp; Integrative Sciences, JNU, India]]></title>
  <description><![CDATA[
<p>School of Computational &amp; Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi – 110067</p>

<p>Date: Nov 11th. 2016                                                            Last Date:  Nov 25th. 2016</p>

<p>PROJECT ID: 632</p>

<p>The following posts are urgently required to be filled for the Department of Biotechnology, Government of India funded project entitled "Computational Core for Plant Metabolomics" administrated by Prof Indira Ghosh,  School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi-110 067</p>

<p>NB:For all Bioinformatics posts, preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.</p>

<p>RA / Research Associate (Metabolic engineering/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA<br />Vacancy: 1<br />Essential Qualifications: PhD in  Bioinformatics /Mathematics/Computer Science with experience in analyzing high throughput omics-based data/ system Biology/ Analysis of Network Biology. Published paper in the field is a must to prove the experience.<br />Desired Skills: Prior experience in handling and guiding bioinformatics, metabolomics data, planning of new research area in metabolic driven network , managing the project portal, preparing and filing reports etc. Will be expected to communicate with user groups and coordinate with LIMS group in Hyderabad and the Cheminformatics group in Delhi.</p>

<p>RA / Research Associate (Chemo-informatics/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA<br />Vacancy: 1<br />Essential Qualifications: PhD in Bioinformatics/ computational biology/ Biophysics/Computer Science. Computational and Chemical structure related experience is a necessary qualification proven by paper published and program developed. <br />Desired Skills:  Research experience in Chemical scaffold mapping, in silico Spectral analysis, Biological Database Designing &amp; Integration is required. Individual is responsible to develop methods related to metabolite identification, Testing and refining and integrate LIMS with IIIT Hyderabad and will be expected to communicate with user groups.</p>

<p>Project SRF (Bioinformatics/Programming)</p>

<p>Salary: As per DBT rules<br />Vacancy: 1<br />Essential Qualifications: Masters/B Tech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building &amp; maintenance ,high throughput data handling and analysis etc. For M.Sc/B.Tec, Published paper  in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</guid>
	<pubDate>Tue, 01 Feb 2022 04:56:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</link>
	<title><![CDATA[Spades tutorial PDF]]></title>
	<description><![CDATA[<p>SPAdes&mdash;St. Petersburg genome Assembler&mdash;was originally developed for de novo assembly of genome sequencing data produced for cultivated microbial isolates and for single-cell genomic DNA sequencing. With time, the functionality of SPAdes was extended to enable assembly of IonTorrent data, as well as hybrid assembly from short and long reads (PacBio and Oxford Nanopore). In this article we present protocols for five different assembly pipelines that comprise the SPAdes package and that are used for assembly of metagenomes and transcriptomes as well as assembly of putative plasmids and biosynthetic gene clusters from whole-genome sequencing and metagenomic datasets.&nbsp;</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/43732" length="268093" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29917/gojs</guid>
	<pubDate>Tue, 22 Nov 2016 08:25:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29917/gojs</link>
	<title><![CDATA[GoJS]]></title>
	<description><![CDATA[<p><strong>GoJS</strong> is a feature-rich JavaScript library for implementing custom interactive diagrams and complex visualizations across modern web browsers and platforms. <strong>GoJS</strong> makes constructing JavaScript diagrams of complex nodes, links, and groups easy with customizable templates and layouts.</p>
<p><strong>GoJS</strong> offers many advanced features for user interactivity such as drag-and-drop, copy-and-paste, in-place text editing, tooltips, context menus, automatic layouts, templates, data binding and models, transactional state and undo management, palettes, overviews, event handlers, commands, and an extensible tool system for custom operations.</p>
<p><strong>GoJS</strong> is pure JavaScript, so users get interactivity without requiring round-trips to servers and without plugins. <strong>GoJS</strong> normally runs completely in the browser, rendering to an HTML5 Canvas element or SVG without any server-side requirements. <strong>GoJS</strong> does not depend on any JavaScript libraries or frameworks, so it should work with any HTML or JavaScript framework or with no framework at all. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</p>
<p>More at&nbsp;http://gojs.net/latest/index.html</p><p>Address of the bookmark: <a href="http://gojs.net/latest/index.html" rel="nofollow">http://gojs.net/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</guid>
	<pubDate>Wed, 08 May 2024 07:32:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</link>
	<title><![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]></title>
	<description><![CDATA[<p dir="auto">ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.</p>
<p dir="auto">More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/</p>
<p dir="auto"><a href="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" target="_blank"><img src="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" alt="extension process" title="extension process" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/dengzac/contig-extender" rel="nofollow">https://github.com/dengzac/contig-extender</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30015/scripts</guid>
	<pubDate>Wed, 30 Nov 2016 10:35:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30015/scripts</link>
	<title><![CDATA[Scripts]]></title>
	<description><![CDATA[<p>Useful script for NGS analysis.</p><p>Address of the bookmark: <a href="http://augustus.gobics.de/binaries/scripts/" rel="nofollow">http://augustus.gobics.de/binaries/scripts/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30203/e-rga-enhanced-reference-guided-assembly-of-complex-genomes</guid>
	<pubDate>Mon, 19 Dec 2016 05:56:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30203/e-rga-enhanced-reference-guided-assembly-of-complex-genomes</link>
	<title><![CDATA[e-RGA: enhanced Reference Guided Assembly of Complex Genomes]]></title>
	<description><![CDATA[<p><span>Next Generation Sequencing has totally changed genomics: we are able to produce huge amounts of data at an incredibly low cost compared to Sanger sequencing. Despite this, some old problems have become even more difficult, de novo assembly being on top of this list. Despite efforts to design tools able to assemble, de novo, an organism sequenced with short reads, the results are still far from those achievable with long reads. In this paper, we propose a novel method that aims to improve de novo assembly in the presence of a closely related reference. The idea is to combine de novo and reference-guided assembly in order to obtain enhanced results.</span></p><p>Address of the bookmark: <a href="http://journal.embnet.org/index.php/embnetjournal/article/view/208" rel="nofollow">http://journal.embnet.org/index.php/embnetjournal/article/view/208</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30111/eager</guid>
	<pubDate>Sat, 10 Dec 2016 18:07:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30111/eager</link>
	<title><![CDATA[EAGER]]></title>
	<description><![CDATA[<p><span>The automated reconstruction of genome sequences in ancient genome analysis is a multifaceted process.</span></p>
<p><span>EAGER encompasses both state-of-the-art tools for each step as well as new complementary tools tailored for ancient DNA data within a single integrated solution in an easily accessible format.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0918-z</p><p>Address of the bookmark: <a href="https://github.com/apeltzer/EAGER-GUI" rel="nofollow">https://github.com/apeltzer/EAGER-GUI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30168/gene-synteny-database</guid>
	<pubDate>Fri, 16 Dec 2016 11:09:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30168/gene-synteny-database</link>
	<title><![CDATA[Gene Synteny Database]]></title>
	<description><![CDATA[<p>Comparative genomics remains a pivotal strategy to study the evolution of gene organization, and this primacy is reinforced by the growing number of full genome sequences available in public repositories. Despite this growth, bioinformatic tools available to visualize and compare genomes and to infer evolutionary events remain restricted to two or three genomes at a time, thus limiting the breadth and the nature of the question that can be investigated. Here we present Genomicus, a new synteny browser that can represent and compare unlimited numbers of genomes in a broad phylogenetic view. In addition, Genomicus includes reconstructed ancestral gene organization, thus greatly facilitating the interpretation of the data.</p>
<p><strong>Availability:</strong>&nbsp;Genomicus is freely available for online use at&nbsp;<a href="http://www.dyogen.ens.fr/genomicus" target="pmc_ext">http://www.dyogen.ens.fr/genomicus</a>&nbsp;while data can be downloaded at&nbsp;<a href="ftp://ftp.biologie.ens.fr/pub/dyogen/genomicus" target="pmc_ext">ftp://ftp.biologie.ens.fr/pub/dyogen/genomicus</a></p>
<p><strong>Contact:</strong>&nbsp;<a href="mailto:dev@null">rf.sne.eigoloib@crh</a></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2853686/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2853686/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>

</channel>
</rss>