<?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/39674?offset=290</link>
	<atom:link href="https://bioinformaticsonline.com/related/39674?offset=290" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/43048/coverm-read-coverage-calculator-for-metagenomics</guid>
	<pubDate>Thu, 29 Apr 2021 23:39:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</link>
	<title><![CDATA[CoverM: Read coverage calculator for metagenomics]]></title>
	<description><![CDATA[<p>CoverM aims to be a configurable, easy to use and fast DNA read coverage and relative abundance calculator focused on metagenomics applications.</p>
<p>CoverM calculates coverage of genomes/MAGs&nbsp;<code>coverm genome</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-genome.html">help</a>) or individual contigs&nbsp;<code>coverm contig</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-contig.html">help</a>). Calculating coverage by read mapping, its input can either be BAM files sorted by reference, or raw reads and reference genomes in various formats.</p><p>Address of the bookmark: <a href="https://github.com/wwood/CoverM" rel="nofollow">https://github.com/wwood/CoverM</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45314/nf-coremag-v5-advancing-genome-resolved-metagenomics</guid>
	<pubDate>Sat, 12 Sep 2026 20:27:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45314/nf-coremag-v5-advancing-genome-resolved-metagenomics</link>
	<title><![CDATA[nf-core/mag v5: Advancing Genome-Resolved Metagenomics]]></title>
	<description><![CDATA[<p>Metagenomics is rapidly moving beyond short-read sequencing. With the increasing adoption of long-read technologies, researchers can generate more contiguous assemblies&mdash;but converting these reads into reliable metagenome-assembled genomes (MAGs) remains computationally challenging.</p><p>nf-core/mag v5 (https://github.com/nf-core/mag) addresses this challenge by extending its reproducible Nextflow-based workflow for modern genome-resolved metagenomics.</p><p>A key addition is support for long-read-only metagenomic assembly and bin refinement, enabling long-read data to be processed through an integrated workflow. The release also introduces five additional binning tools, providing complementary strategies for recovering genomes from complex microbial communities.</p><p>The workflow has also expanded beyond conventional bacterial and archaeal MAGs, with improved classification of viruses and eukaryotes, together with enhanced genome-quality assessment.</p><p>Conceptually, the workflow brings together:</p><p>Reads &rarr; QC &rarr; Assembly &rarr; Binning &rarr; Bin refinement &rarr; Taxonomic classification &rarr; MAG quality assessment</p><p>The real strength of nf-core/mag is not any single algorithm, but the integration and reproducibility of multiple tools within a standardized workflow. This is particularly important for large-scale metagenomic studies where software versions, parameters, databases and computational environments can strongly influence results.</p><p>After seven years of development involving multiple curator teams and the wider nf-core community, v5 demonstrates how community-driven workflow development can keep metagenomic analysis aligned with rapidly evolving sequencing technologies.</p><p>The future of genome-resolved metagenomics is not simply longer reads&mdash;it is better integration of assembly, binning, refinement and quality control within reproducible computational workflows.</p><p>Read the full paper in Bioinformatics https://academic.oup.com/bioinformatics/article/42/9/btag628/8770536?</p>]]></description>
	<dc:creator>LEGE</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/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</guid>
	<pubDate>Thu, 15 Feb 2018 10:21:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</link>
	<title><![CDATA[Tallymer: method to compute K-mer frequencies and its application to annotate large repetitive plant genomes]]></title>
	<description><![CDATA[<p>Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the&nbsp;<span>k</span>-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set whole genome shotgun sequences from maize (B73) (total size 10<sup>9</sup>&nbsp;bp).&nbsp;<br>Tallymer was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available.</p>
<p>A manual can be found&nbsp;<a href="https://www.zbh.uni-hamburg.de/fileadmin/gi/tallymer/tallymer.pdf" target="_blank" title="tallymer.pdf (111 KB)">here</a>.</p><p>Address of the bookmark: <a href="https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html" rel="nofollow">https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/2336/3rd-annual-next-generation-sequencing-asia-congress-2013-at-singapore-singapore</guid>
  <pubDate>Wed, 14 Aug 2013 09:55:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[3rd Annual Next Generation Sequencing Asia Congress 2013 at Singapore, Singapore]]></title>
  <description><![CDATA[
<p>The 3rd Annual Next Generation Sequencing Asia Congress is to be held on the 22nd and 23rd of October 2013 in Singapore. Over the 2 days, the conference will provide an overview of the current options of next-generation sequencing platforms, technologies, applications and the newest computational tools for the analysis of next-generation sequencing data and analytical genomics as well as overcoming data management problems. The event will attract over 200 senior-level decision makers working in areas such as next generation sequencing, analytical genomics, computational biology, oncology, RNA profiling, molecular genomics, biomarkers, bioinformatics &amp; data management and clinical &amp; diagnostics development.</p>

<p>Dated : 22 Nov 2013 -23 Nov 2013</p>

<p>http://www.ngsasia-congress.com/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3868/next-generation-sequencing-ngs-tutorials</guid>
	<pubDate>Sat, 24 Aug 2013 06:01:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3868/next-generation-sequencing-ngs-tutorials</link>
	<title><![CDATA[Next Generation Sequencing (NGS) Tutorials]]></title>
	<description><![CDATA[<p>Institute of computational biomedicine, Cornell University provide an NGS workshop tutorial at&nbsp;<a href="http://chagall.med.cornell.edu/NGScourse/">http://chagall.med.cornell.edu/NGScourse/</a>&nbsp;</p>
<p>You can also add your favourite NGS educational material, or workshop tutorial by commenting on this bookmarks for user benefit.&nbsp;</p>
<p>Understanding the basics of genome sequencing:</p>
<p>Tutorial by Luke Jostins.</p>
<p>http://www.genetic-inference.co.uk/blog/2009/04/basics-sequencing-dna-part-1/</p>
<p>http://www.genetic-inference.co.uk/blog/2009/08/basics-sequencing-dna-part-2/</p>
<p>A window into third-generation sequencing</p>
<p>http://hmg.oxfordjournals.org/content/19/R2/R227.full.pdf</p>
<p>==============================================</p>
<p>NGS data analysis pipelines</p>
<ul>
<li><strong>Detecting and annotating genetic variations using the HugeSeq pipeline</strong>&nbsp; DOI: <a href="http://dx.doi.org/10.1038/nbt.2134">10.1038/nbt.2134</a></li>
<li><strong> NARWHAL, a primary analysis pipeline for NGS data</strong> <a href="http://bioinformatics.oxfordjournals.org/cgi/content/abstract/28/2/284?etoc">http://bioinformatics.oxfordjournals.org/cgi/content/abstract/28/2/284?etoc</a></li>
<li><strong>RseqFlow: Workflows for RNA-Seq data analysis</strong>&nbsp; DOI: <a href="http://dx.doi.org/10.1093/bioinformatics/btr441">10.1093/bioinformatics/btr441</a></li>
<li><strong>ngs_backbone: a pipeline for read cleaning, mapping and SNP calling using Next Generation Sequence</strong>&nbsp;&nbsp;<a href="http://dx.doi.org/10.1186/1471-2164-12-285">10.1186/1471-2164-12-285</a></li>
<li><strong>A framework for variation discovery and genotyping using next-generation DNA sequencing data</strong>&nbsp; PubMed: <a href="http://www.ncbi.nlm.nih.gov/pubmed/21478889">21478889</a></li>
<li><strong>SNiPlay: a web-based tool for detection, management and analysis of SNPs. Application to grapevine diversity projects</strong>&nbsp; DOI: <a href="http://dx.doi.org/10.1186/1471-2105-12-134">10.1186/1471-2105-12-134</a> Abstract: <a href="http://www.biomedcentral.com/1471-2105/12/134/abstract">http://www.biomedcentral.com/1471-2105/12/134/abstract</a></li>
<li><strong>WEP: a high-performance analysis pipeline for whole-exome data&nbsp;</strong>http://www.biomedcentral.com/1471-2105/14/S7/S11</li>
<li><strong>DDBJ read annotation pipeline: a cloud computing-based pipeline for high-throughput analysis of next-generation sequencing data.&nbsp;</strong>http://www.ncbi.nlm.nih.gov/pubmed/23657089</li>
<li><strong>GATK: a Toolkit for Genome Analysis&nbsp;</strong>http://www.broadinstitute.org/gatk/</li>
<li><strong>Metagenomics</strong>:http://www.nbic.nl/education/nbic-phd-school/course-schedule/ngsmetagenomics/</li>
<li><strong>RNASeq</strong>:http://www.nbic.nl/education/nbic-phd-school/course-schedule/ngsrnaseq/</li>
<li><strong>Bioinformatics and Seq courses</strong>:&nbsp;http://www.isb-sib.ch/training/training-activities-schedule/archive-2013.html</li>
<li><strong>Variant Detection (Model organism) Advanced tutorial</strong> https://docs.google.com/document/pub?id=1CuKkKylVDb03tnN7RSWl5EUzleetn0ctjmvaidPKLxM</li>
<li><strong>Variant Detection Introductory tutorial</strong> https://docs.google.com/document/pub?id=1ZRzrjjOCvtAu3m-IKL-rbJ1f4On60dDL_IEwG7oejdI</li>
<li><strong>Microbial de novo Assembly for Illumina Data Introductory tutorial</strong> https://docs.google.com/document/pub?id=1N3AB9ptISUu4zULqe1kXpVF0BDyGb5f5yzxWSJd_WNM</li>
<li><strong>RNAseq Differential Gene Expression Introductory tutorial</strong> https://docs.google.com/document/pub?id=1KbTiBHtvHLfPRZ39AY3uriazrINA8TJzgjjwn1zPP7Y</li>
</ul>
<blockquote>
<p>" Please add your favourite NGS link below in comment section for the benefit of bioinformatics community ".&nbsp;</p>
</blockquote><p>Address of the bookmark: <a href="http://chagall.med.cornell.edu/NGScourse/" rel="nofollow">http://chagall.med.cornell.edu/NGScourse/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>