<?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/26306?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/26306?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</link>
	<title><![CDATA[Cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</guid>
	<pubDate>Mon, 06 Mar 2017 03:44:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</link>
	<title><![CDATA[MetaBAT:  An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities]]></title>
	<description><![CDATA[<p>MetaBAT, An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities</p>
<p>Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (&gt;200kb) in 3 hours, where 621 genome bins are &gt;50% complete with &lt;5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.</p><p>Address of the bookmark: <a href="https://bitbucket.org/berkeleylab/metabat" rel="nofollow">https://bitbucket.org/berkeleylab/metabat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30973/abacas</guid>
	<pubDate>Thu, 16 Feb 2017 12:15:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30973/abacas</link>
	<title><![CDATA[ABACAS]]></title>
	<description><![CDATA[<p><span>ABACAS is intended to rapidly contiguate (align, order, orientate) , visualize and design primers to close gaps on shotgun assembled contigs based on a reference sequence. It uses MUMmer to find alignment positions and identify syntenies of assembly contigs against the reference. The output is then processed to generate a pseudomolecule taking overlaping contigs and gaps in to account. MUMmer's alignment generating programs, Nucmer and Promer are used followed by the 'delta-filter' utility function. Users could also run tblastx on contigs that are not used to generate the pseudomolecule.&nbsp;</span></p><p>Address of the bookmark: <a href="http://abacas.sourceforge.net/Manual.html#9._Colour_code" rel="nofollow">http://abacas.sourceforge.net/Manual.html#9._Colour_code</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31137/finishersc-a-repeat-aware-and-scalable-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 27 Feb 2017 09:49:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31137/finishersc-a-repeat-aware-and-scalable-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC: a repeat-aware and scalable tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><span>FinisherSC, a repeat-aware and scalable tool for upgrading&nbsp;</span><em>de novo</em><span>&nbsp;assembly using long reads. Experiments with real data suggest that FinisherSC can provide longer and higher quality contigs than existing tools while maintaining high concordance.</span></p><p>Address of the bookmark: <a href="http://kakitone.github.io/finishingTool/" rel="nofollow">http://kakitone.github.io/finishingTool/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</guid>
	<pubDate>Fri, 03 Mar 2017 10:14:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</link>
	<title><![CDATA[Multi-metagenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes<br><br>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</guid>
	<pubDate>Tue, 07 Mar 2017 08:50:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</link>
	<title><![CDATA[COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)]]></title>
	<description><![CDATA[<p>COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.</p>
<p>News: Python version of COCACOLA is available now!</p><p>Address of the bookmark: <a href="https://github.com/younglululu/COCACOLA" rel="nofollow">https://github.com/younglululu/COCACOLA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32481/sspace</guid>
	<pubDate>Fri, 05 May 2017 05:42:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32481/sspace</link>
	<title><![CDATA[SSPACE]]></title>
	<description><![CDATA[<p>SSPACE standard is a stand-alone program for scaffolding pre-assembled contigs using NGS paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (Illumina/454/Solid FASTA or FASTQ). The final scaffolds are provided in FASTA format.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE" rel="nofollow">https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material</guid>
	<pubDate>Wed, 05 Apr 2017 04:29:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material</link>
	<title><![CDATA[NGS teaching material]]></title>
	<description><![CDATA[<p><span>High throughput sequencing (HTS) technologies are being applied to a wide range of important topics in biology. However, the analyses of non-model organisms, for which little previous sequence information is available, pose specific problems. This course addresses the specific strengths and weaknesses of alternative HTS technologies, the computational resources needed for HTS, and how to analyze non-model species using HTS. The course consists of a practical training module, HTS bioinformatics training, and lecturing/seminars of HTS approaches specifically targeting non-model organisms.</span></p><p>Address of the bookmark: <a href="http://marinetics.org/teaching/hts/Assembly.html" rel="nofollow">http://marinetics.org/teaching/hts/Assembly.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/35257/india-and-germany-to-begin-joint-research-in-the-area-of-bioinformatics-in-health-research</guid>
	<pubDate>Wed, 17 Jan 2018 14:10:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/35257/india-and-germany-to-begin-joint-research-in-the-area-of-bioinformatics-in-health-research</link>
	<title><![CDATA[India and Germany to begin joint research in the area of 'Bioinformatics in Health Research']]></title>
	<description><![CDATA[<p><span>To facilitate bilateral cooperation in biotechnology between the scientific communities of India and Germany, the Department of Biotechnology (DBT) will soon begin collaborative research in the identified priority area of 'Bioinformatics in Health Research' under the programme of Indo-German Cooperation in Health Research.&nbsp;</span><br /><br /><span>The purpose of the programme is to stimulate new collaborations, e.g. the preparation of joint projects under national funding programmes. The programme facilitates bilateral cooperation in biotechnology between the scientific communities of India and Germany by way of joint research projects which will encompass bilateral workshops/seminar and exchange visits of scientists.&nbsp;</span><br /><br /><span>The programme is being implemented within the agreement of Indo-German cooperation in S&amp;T of 1974, under which the Department of Biotechnology, Government of India and Forschungszentrum Julich BMBH (FZJ), Federal Republic of Germany, have agreed for cooperative programme in biotechnology.</span><br /><br /><span>DBT of the Ministry of Science &amp; Technology, Government of India and the Project Management Agency at the German Aerospace Center (DLR-PT, European and International Cooperation), Bonn are the nodal implementing agencies from the Indian and German side respectively.</span><br /><br /><span>Through this programme, it is expected that the funded cooperation enables the partners to develop applicable scientific results which can be published and/ or could be commercialised and may lead to formation of joint ventures. All publications, patents coming out of these projects, need to be jointly authored by both Indian and German scientists. All necessary approvals like ethical clearance, HMSC approval from Indian point of view as well as EU, if applicable, from German point of view, e.g. before conducting animal experimentation if any needs to be obtained by PIs before undertaking the project.&nbsp;</span><br /><br /><span>Now, both the nodal agencies have invited research proposals in identified priority area of 'Bioinformatics in Health Research' from eligible scientists.&nbsp; Joint research projects are required to be submitted to both the nodal agencies by 15 January 2018. Scientists/faculty members working in regular capacity in universities, national R&amp;D laboratories/institutes and private R&amp;D institutes can be part of this joint research programme.&nbsp;&nbsp; For the private sector, partners from all kind of private sectors are eligible, but financing is limited. For Indian scientists from the private sector, only local hospitality in Germany as part of the exchange visit is available from the German side.&nbsp; For German scientists from the private sector, only travel costs are available for small and medium size enterprises (for definition of SME ref. to 2003/361/EC) as well as local hospitality in India will be borne by themselves.</span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/915/researcher-in-computer-sciencebiology</guid>
  <pubDate>Mon, 15 Jul 2013 18:38:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Researcher in computer science/biology]]></title>
  <description><![CDATA[
<p>Researcher in Computer Science at the Computational Biology Unit - temporary employment</p>

<p>The Department of Informatics is a vacant position as a researcher in computer science, related to Computational Biology Unit (CBU), for 3 years.<br /> <br />The position is part of CBU Service Group and will focus on bioinformatic analysis project and especially the analysis of high-throughput data, including NGS (sequencing), and proteomics data.<br /> <br />The successful candidate will be part of the Norwegian bioinformatics platform's national helpdesk within the project ELIXIR.NO<br /> <br />Applicants must hold a PhD in a relevant subject such as computer science, mathematics, molecular biology and also possess expertise and experience in bioinformatics statistics and analysis of data from high-throughput molecular experiment.<br /> <br />Basic programming or scripting skills are required. Experience in Python, R, Perl, Linux-based operating systems and moreover knowledge of databases and web programming will be a strength for applicants.<br /> <br />We expect enthusiasm and independence and moreover the ability to work in an interdisciplinary team environment.<br /> <br />Good knowledge of English is required.<br /> <br />Salaries start at level 57 (code 1109/LR 24.1) by appointment. Further promotion occurs after<br />service seniority in the position (at grade 57-65). Of particularly highly qualified applicants may be considered a higher salary.<br /> <br />Further information about the position is available from the chair of the CBU, <br />Professor Inge Jonassen, e-mail: Inge.Jonassen @ ii.uib.no<br /> <br />The successful applicant must comply with the guidelines that apply at any given time the position.<br /> <br />State employment shall as far as possible reflect the diversity of the population. It is therefore an objective to achieve a balanced age and sex composition and the recruitment of persons with immigrant backgrounds. Persons with immigrant background are requested to apply for the position.<br /> <br />Women are particularly encouraged to apply. If the experts find that several applicants have approximately equivalent qualifications, the rules on equal in the Personnel Regulations for Academic Positions will be applied.<br /> <br />University of Bergen applies the principles of public openness when recruiting staff to scientific positions.<br /> <br />Information about the applicant may be made public even though the applicant has requested not to be named in the list of applicants. If the request does not host admitted to the result, the applicant shall be notified of this.<br /> <br />Send application, CV, certificates, diplomas, undergraduate work and a list of publications (list of publications) online by clicking on https://www.jobbnorge.no/jobbsoknet/login.aspx?returnurl=/jobbsoknet/jobapplication.aspx?jobid=95196<br /> <br />You need to upload certified translations into English or a Scandinavian language of appendices, such as diplomas and transcripts.<br /> <br />Applications sent by email to individuals at the institute will not be considered.<br /> <br />Deadline: 9 August 2013</p>
]]></description>
</item>

</channel>
</rss>