<?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/31295?offset=760</link>
	<atom:link href="https://bioinformaticsonline.com/related/31295?offset=760" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/31258/bioinformatics-walk-in-interview-at-tezpur-university</guid>
  <pubDate>Thu, 02 Mar 2017 04:24:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics walk-in-interview at Tezpur University]]></title>
  <description><![CDATA[
<p>A walk-in-interview will be held on 09 March, 2017, 11.15 a.m. at the office of the Head, Department of Computer Science and Engineering, Tezpur University for one (01) temporary position of Junior Research Fellow (JRF) in the DBT, Govt. of India sponsored project entitled “Integrating genome scale metabolic analysis of model plant pathogen Ralstonia solanacearum with RNAseq and fluxomics” under Dr. Siddhartha Sankar Satapathy (ssankar@tezu.ernet.in), Associate Professor, Department of Computer Science and Engineering, Tezpur University.<br /> <br />Interested candidates may appear before the interview board with original documents from 10th standard onwards and photocopies of mark sheets, certificates, testimonials, caste certificate (if applicable), experience certificate certificates of NET/GATE/BET or similar examination qualifications, any other testimonials and a copy of recent curriculum vitae (CV) on the day of interview.<br /> <br />Essential qualification: M.Tech. in CSE/IT (With specialization in Computational Biology/Bioinformatics) or M.Sc. in Bioinformatics/Biosciences/Molecular Biology Biotechnology preferably with NET/GATE/BET.<br /> <br />Candidates should have minimum 55 % mark both in 10th and 10+2 Science examinations and mathematics at 10+2 Science.<br /> <br />Desirable: Preference will be given to the candidates having experience in computational analysis of genome sequences or similar projects.<br /> <br />Remuneration: Rs. 25,000/- (Rupees twenty five thousand) only + HRA as admissible per month for the 1st two years and Rs. 28,000/- (Rupees twenty eight thousand) only + HRA as admissible per month for the 3rd year for SRF and applicable to the candidate having post graduate degree in Basic Science with NET/GATE/BET qualification or post graduate degree in professional course. Rs. 12,000/- (Rupees twelve thousand) only + HRA as admissible per month for the 1st two years and Rs. 14,000/- (Rupees fourteen thousand) only + HRA as admissible per month for the 3 rd year for SRF, for the candidate without NET/GATE/BET qualification. HRA will not be provided if campus accommodation is availed.<br /> <br />Age: Candidate shall not be more than 28 years of age on the date of interview. Upper age limit may be relaxed up to 5 years in the case of candidate belonging to SC/ST/ OBC/Women/Differently abled.<br /> <br />Duration: Three (03) years or till completion of the project or until further order, whichever is earlier.<br /> <br />N.B. No TA/DA will be paid to the candidates for attending the interview. For further details please contact: Dr. S. S. Satapathy Associate Professor Department of Computer Science and Engineering Tezpur University, Napaam-784028 Email: ssankar@tezu.ernet.in Contact no.: +91-9435979648<br /> <br />More Info:  www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-SSS-20-295-188-A.pdf</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/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</guid>
	<pubDate>Thu, 24 Jan 2019 10:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</link>
	<title><![CDATA[NxRepair: error correction in de novo assemblies using Nextera Mate Pair Reads]]></title>
	<description><![CDATA[<p>NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file containing both the corrected contigs and the correct, unaffected contigs.</p>
<p>https://nxrepair.readthedocs.io/en/latest/tutorial.html</p>
<div>
<div>
<div id="js-repo-pjax-container">
<div>
<div>
<div id="readme">
<div>
<div>
<pre>nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta</pre>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://github.com/rebeccaroisin/nxrepair" rel="nofollow">https://github.com/rebeccaroisin/nxrepair</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</guid>
	<pubDate>Mon, 10 Apr 2017 05:42:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</link>
	<title><![CDATA[Lifemap]]></title>
	<description><![CDATA[<p><strong>Lifemap</strong> is an interactive tool to explore the WHOLE NCBI TAXONOMY. The concept used in <strong>Lifemap</strong> is similar to the one used in cartography with tools like Google Maps&copy; or Open Street Maps: exploring is done by zooming and panning.</p>
<div>
<p>&nbsp;The current tree contains ALL species present in NCBI taxonomy as of <span style="text-decoration: underline;">October 18th, 2016</span>: 1,135,169 species including 10,545 Archaea, 418,777 Bacteria and 705,847 Eukaryotes. The Lifemap tree is updated every two weeks.</p>
</div>
<p>&nbsp;All the nodes in the tree are clickable. This displays various information and options:</p>
<ul>
<li>The species name (and the associated common name if there is one)</li>
<li>The rank (kingdom, family, class, species...)</li>
<li>Ability to go to the corresponding node/species on NCBI web site (displayed in a new window)</li>
<li>Possibility to download the corresponding subtree in newick extended format</li>
<li>Possibilty to get the whole lineage from the current node/tip to the root of the tree.</li>
</ul><p>Address of the bookmark: <a href="http://lifemap-ncbi.univ-lyon1.fr/" rel="nofollow">http://lifemap-ncbi.univ-lyon1.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</guid>
	<pubDate>Tue, 05 Mar 2019 10:00:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</link>
	<title><![CDATA[SDA: Long-read sequence and assembly of segmental duplications]]></title>
	<description><![CDATA[<p><span><span>Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.<br></span></span></p>
<p><span><span>https://github.com/mvollger/SDA</span></span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/s41592-018-0236-3" rel="nofollow">https://www.nature.com/articles/s41592-018-0236-3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/32374/ra-bioinformatics-at-jnu-new-delhi-india</guid>
  <pubDate>Thu, 27 Apr 2017 03:29:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at JNU, New Delhi, INDIA]]></title>
  <description><![CDATA[
<p>School of Computational &amp; Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi-110067, INDIA</p>

<p>Date: April 24th. 2017	Last Date: May 6th 2017<br />PROJECT ID: 632</p>

<p>The following posts are urgently required to be filled for the Department of Biotechnology, Government of India funded project jointly running with IIIT-Hyderabad &amp; JNU, entitled "Computational Core for Plant Metabolomics" administrated by Prof Indira Ghosh, School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi-110 067.<br />NB: For all the posts, preference will be given to candidates with a good knowledge of Python and/or R in UNIX platform , knowledge of JAVA will also get a special consideration.</p>

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

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

<p>Vacancy: 1</p>

<p>Essential Qualifications: PhD in Bioinformatics /Mathematics/Computer Science with experience in analyzing high throughput omics-based data/Analysis of Network Biology/Chemoinformatics/Computational Biology related Software development. Published paper in the field is a must to prove the experience. Special consideration will be given if have experience in Industry, teaching &amp; product development.</p>

<p>Desired Skills: Prior experience in handling and guiding bioinformatics, metabolomics data, planning of new research area in metabolic driven network , collaborating with industry , 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>2.	Project SRF (Network model building/Systems biology integration)</p>

<p>Salary*: Rs.18000/- + HRA</p>

<p>Vacancy: 1</p>

<p>Essential Qualifications: M.Tech in Computational Biology with project experience or Masters / B.Tech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Mathematical Model building using Computational Biology tools &amp; related Database / Network analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal whereas for M.Tech, the degree obtained in computational biology is a must.</p>

<p>Desired Skills: Will be expected to manage ongoing research activities in LIMS, interact with LIMS group, build network model using data compiled by experimentalist, prepare and file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40099/contiguator</guid>
	<pubDate>Fri, 04 Oct 2019 01:27:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40099/contiguator</link>
	<title><![CDATA[CONTIGuator !]]></title>
	<description><![CDATA[<p><span>CONTIGuator is a Python script for Linux environments whose purpose is to speed-up the bacterial genome assembly process and to obtain a first insight of the genome structure using the well-known artemis comparison tool (ACT).</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/contiguator/" rel="nofollow">https://sourceforge.net/projects/contiguator/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32420/fastq-format</guid>
	<pubDate>Wed, 03 May 2017 04:23:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32420/fastq-format</link>
	<title><![CDATA[Fastq format]]></title>
	<description><![CDATA[<p><strong>FASTQ format</strong>&nbsp;is a text-based&nbsp;<a href="https://en.wikipedia.org/wiki/File_format" title="File format">format</a>&nbsp;for storing both a biological sequence (usually&nbsp;<a href="https://en.wikipedia.org/wiki/Nucleotide_sequence" title="Nucleotide sequence">nucleotide sequence</a>) and its corresponding quality scores. Both the sequence letter and quality score are each encoded with a single&nbsp;<a href="https://en.wikipedia.org/wiki/ASCII" title="ASCII">ASCII</a>&nbsp;character for brevity.</p>
<p>It was originally developed at the&nbsp;<a href="https://en.wikipedia.org/wiki/Wellcome_Trust_Sanger_Institute" title="Wellcome Trust Sanger Institute">Wellcome Trust Sanger Institute</a>&nbsp;to bundle a&nbsp;<a href="https://en.wikipedia.org/wiki/FASTA_format" title="FASTA format">FASTA</a>&nbsp;sequence and its quality data, but has recently become the&nbsp;<em>de facto</em>&nbsp;standard for storing the output of high-throughput sequencing instruments such as the&nbsp;<a href="https://en.wikipedia.org/wiki/Illumina_(company)" title="Illumina (company)">Illumina</a>&nbsp;Genome Analyzer.<sup id="cite_ref-Cock2009_1-0"><a href="https://en.wikipedia.org/wiki/FASTQ_format#cite_note-Cock2009-1">[1]</a></sup></p><p>Address of the bookmark: <a href="https://en.wikipedia.org/wiki/FASTQ_format" rel="nofollow">https://en.wikipedia.org/wiki/FASTQ_format</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32629/bienko-and-crosetto-labs</guid>
  <pubDate>Fri, 12 May 2017 07:42:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bienko and Crosetto Labs]]></title>
  <description><![CDATA[
<p>We are two groups of scientists doing frontier research in quantitative biology and biomedicine. The Bienko group is interested in exploring the fundamental design principles controlling how DNA is packed in the eukaryotic nucleus and its relation to gene expression regulation. The Crosetto group engineers new molecular methods for single-cell and spatially resolved omic measurements of DNA, RNA, and proteins, with a strong focus on tumor heterogeneity. By sharing ideas and resources, we work synergistically towards a more quantitative understanding of life’s processes in healthy and diseased conditions.</p>

<p>https://bienkocrosettolabs.org/</p>
]]></description>
</item>

</channel>
</rss>