<?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/44545?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/44545?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/39826/data-scientist-mwd</guid>
  <pubDate>Wed, 07 Aug 2019 03:19:46 -0500</pubDate>
  <link></link>
  <title><![CDATA[Data Scientist (m/w/d)]]></title>
  <description><![CDATA[
<p>https://uk-erlangen.concludis.de/prj/shw/b8b26f24186191c7af8a25e2cc6115ca_0/27008/Data_Scientist_m_w_d.htm?b=0</p>

<p>Deadline: 30.09.2019</p>

<p>Requirement:<br />Microsoft SQL Server: Administration, Transact-SQL<br />Machine Learning<br />Know Deutsch und Englisch langauge</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/39865/blast-nr-version-5-database-nr-v5</guid>
	<pubDate>Fri, 23 Aug 2019 11:35:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/39865/blast-nr-version-5-database-nr-v5</link>
	<title><![CDATA[BLAST nr version 5 database, (nr_v5)]]></title>
	<description><![CDATA[<p>NCBI have made changes the nr version 5 database, (nr_v5), to facilitate better search results and improved performance by reducing the number of redundant titles in the nr_v5 database used by webBLAST, which is also available for&nbsp;BLAST+ users.</p><p><span style="text-decoration: underline;"></span></p><p>The changes in nr preserve the taxonomic diversity of the entries in the database while reducing the number of titles for identical sequences. GenPept accessions are still accessible via&nbsp;<a href="http://www.ncbi.nlm.nih.gov/protein/$GENBANK_ACCESSION" target="_blank">www.ncbi.nlm.nih.gov/protein/$GENBANK_ACCESSION</a>&nbsp;or the IPG website&nbsp;<a href="https://www.ncbi.nlm.nih.gov/ipg/" target="_blank">https://www.ncbi.nlm.nih.gov/ipg/</a>.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>The "Identical Proteins" link in the alignments section of the webBLAST results takes you to a full list of all accessions associated with a sequence.</p><p><span style="text-decoration: underline;"></span></p><p>For&nbsp;BLAST+ users downloading nr_v5: the database is now approximately 50% smaller, resulting in faster downloads and&nbsp;BLAST&nbsp;searches, and smaller disk space requirements. The database is downloadable at: &nbsp;<a href="ftp://ftp.ncbi.nlm.nih.gov/blast/db/v5/" target="_blank">ftp://ftp.ncbi.nlm.nih.gov/blast/db/v5/</a></p><p><span style="text-decoration: underline;"></span></p><p>For&nbsp;BLAST+ there is a cleanup script to help you manage the transition to this smaller database. The script removes unused database volumes:&nbsp;<a href="ftp://ftp.ncbi.nlm.nih.gov/blast/temp/cleanup-blastdb-volumes.py" target="_blank">ftp://ftp.ncbi.nlm.nih.gov/blast/temp/cleanup-blastdb-volumes.py</a></p><p><span style="text-decoration: underline;"></span></p><p>Here are the new rules on how we keep titles in nr_v5:</p><p><span style="text-decoration: underline;"></span></p><p>1.&nbsp;&nbsp;&nbsp; We keep all refseq, swissprot, pir and PDB titles.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>2.&nbsp; &nbsp;&nbsp;We keep any GenPept titles with a TAXID that has not already been seen in the record.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>3.&nbsp; &nbsp;&nbsp;We keep at least five GenPept titles regardless of whether the TAXIDS have been seen before or not in this record.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43011/deg-50-a-database-of-essential-genes-in-both-prokaryotes-and-eukaryotes</guid>
	<pubDate>Tue, 30 Mar 2021 11:47:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43011/deg-50-a-database-of-essential-genes-in-both-prokaryotes-and-eukaryotes</link>
	<title><![CDATA[DEG 5.0: a database of essential genes in both prokaryotes and eukaryotes]]></title>
	<description><![CDATA[<p><span>Essential genes are those indispensable for the survival of an organism, and their functions are therefore considered a foundation of life. Determination of a minimal gene set needed to sustain a life form, a fundamental question in biology, plays a key role in the emerging field, synthetic biology. </span></p>
<p><span></span><span>DEG is freely available at the website&nbsp;</span><a href="http://tubic.tju.edu.cn/deg" target="_blank">http://tubic.tju.edu.cn/deg</a><span>&nbsp;or&nbsp;</span><a href="http://www.essentialgene.org/" target="_blank">http://www.essentialgene.org</a><span>.</span></p><p>Address of the bookmark: <a href="http://www.essentialgene.org/" rel="nofollow">http://www.essentialgene.org/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43685/chipbase-open-database-for-studying-the-transcription-factor-binding-sites-and-motifs</guid>
	<pubDate>Wed, 29 Dec 2021 05:36:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43685/chipbase-open-database-for-studying-the-transcription-factor-binding-sites-and-motifs</link>
	<title><![CDATA[ChIPBase: open database for studying the transcription factor binding sites and motifs]]></title>
	<description><![CDATA[<p>ChIPBase v2.0 is an open database for studying the transcription factor binding sites and motifs, and decoding the transcriptional regulatory networks of lncRNAs, miRNAs, other ncRNAs and protein-coding genes from ChIP-seq data. Our database currently contains ~10,200 curated peak datasets derived from ChIP-seq methods in 10 species.</p><p>Address of the bookmark: <a href="https://rna.sysu.edu.cn/chipbase/" rel="nofollow">https://rna.sysu.edu.cn/chipbase/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/8317/new-version-of-modeller-913</guid>
	<pubDate>Thu, 13 Feb 2014 09:07:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/8317/new-version-of-modeller-913</link>
	<title><![CDATA[New version of Modeller, 9.13]]></title>
	<description><![CDATA[<p>The new version of Modeller, 9.13, is now available for download! Please see the download page at <a href="http://www.facebook.com/l.php?u=http%3A%2F%2Fsalilab.org%2Fmodeller%2F&amp;h=mAQG5wo_Z&amp;enc=AZOoq2B7BxT95AT3Mw3za3VlbmRFke43YMI5vAjCAbBlIcf3bptn8pmFC1Idxrssy98117S03IgdcNmEWcQBi9bmi8Or_ut1D1yybt1ZonvPoCT3_LOglcYV7o6bEaa442_6LhbjefEaelkq0aq6dl0w&amp;s=1" target="_blank">http://salilab.org/modeller/</a> for more information.</p><p><img src="http://salilab.org/modeller/gifs/modeller.jpg" alt="image" width="848" height="272" style="border: 0px; border: 0px;"><br /> <br /> If you have a license key for Modeller 8 or 9, there is no need to reregister for Modeller 9.13 - the same license key will work. (It won't <span>do any harm to reregister if you want to, though!)<br /> <br /> 9.13 is primarily a bugfix release relative to the last public release(9.12). Major user-visible changes include:<br /> <br /> # Modeller now includes a variety of SOAP (statistically optimized atomic potential) scores for assessing proteins, loops, and interfaces.<br /> <br /> # The Lennard-Jones interaction energy is now artificially truncated at very short distance; this makes simulations with poor starting conditions much less likely to 'blow up'.<br /> <br /> # model.get_insertions(), model.get_deletions() and model.loops() now have an include_termini option; if False, residue ranges that include chain termini are excluded from the output.<br /> <br /> See the Modeller manual for a full change log: <a href="http://salilab.org/modeller/9.13/manual/node39.html" target="_blank">http://salilab.org/modeller/9.13/manual/node39.html</a><br /> <br /> If you encounter bugs in Modeller 9.13, please see <a href="http://salilab.org/modeller/9.13/manual/node10.html" target="_blank">http://salilab.org/modeller/9.13/manual/node10.html</a> for information on how to report them.</span></p><p><span>Reference:</span></p><p><span>http://salilab.org/modeller/</span></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43376/hisat2-index-files-download</guid>
	<pubDate>Wed, 15 Sep 2021 22:17:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43376/hisat2-index-files-download</link>
	<title><![CDATA[HISAT2 Index Files Download !]]></title>
	<description><![CDATA[<p>Resource for downloading all the HISAT2 related files&nbsp;</p>
<p>Please cite:</p>
<blockquote>
<p>Kim, D., Paggi, J.M., Park, C.&nbsp;<em>et al.</em>&nbsp;Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype.&nbsp;<em>Nat Biotechnol</em>&nbsp;<strong>37</strong>, 907&ndash;915 (2019).&nbsp;<a href="https://doi.org/10.1038/s41587-019-0201-4" target="_blank">https://doi.org/10.1038/s41587-019-0201-4</a></p>
</blockquote><p>Address of the bookmark: <a href="http://daehwankimlab.github.io/hisat2/download/#h-sapiens" rel="nofollow">http://daehwankimlab.github.io/hisat2/download/#h-sapiens</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45283/the-neighbourhood-of-a-resistance-gene</guid>
	<pubDate>Sun, 06 Sep 2026 12:27:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45283/the-neighbourhood-of-a-resistance-gene</link>
	<title><![CDATA[The Neighbourhood of a Resistance Gene]]></title>
	<description><![CDATA[<p>Think about spotting someone suspicious in a busy city. You might recognize them, but to really understand their story, you need to know where they live, who their neighbors are, and how they are connected to the rest of the city.</p><p>Scientists who study antimicrobial resistance (AMR) face a similar challenge.</p><p>When scientists find an AMR gene, it shows that resistance exists. However, it does not always reveal where the gene is or what is around it. This genetic context can give important clues about how resistance genes work, change over time, and possibly move between bacteria.</p><p>A recent study in NAR Genomics and Bioinformatics introduces <strong>Sarand (https://github.com/beiko-lab/sarand)</strong>, a computer-based method created to explore these genetic neighborhoods. Today, metagenomic sequencing lets scientists study DNA from whole groups of microbes, like those in wastewater. But these samples have DNA from thousands of organisms, creating millions of pieces. Putting the original genomes back together is a bit like trying to rebuild several books from a pile of shredded pages.esSarand uses a different method. It works with something called a metagenomic assembly graph, which is like a map showing how DNA fragments might connect. Once it finds an AMR gene, Sarand traces the connected DNA sequences before and after the gene to find its surrounding genetic neighborhood.od.</p><p>The method also uses sequencing coverage to help avoid false connections and mixed-up sequences.</p><p>The researchers tested Sarand with both simulated data and real samples from city sewage. Their results showed that Sarand could find AMR gene neighborhoods that other methods might miss. The authors reported that Sarand was on average 47% more sensitive than assembled contigs and 134% more sensitive than MetaCherchant in their tests.</p><p>This study marks an important change in AMR research.</p><p>Instead of just asking, &ldquo;Which resistance genes are present?&rdquo;, scientists can now start to ask:</p><p>&ldquo;Where are these genes, what are they connected to, and what can their neighborhood tell us?&rdquo;</p><p>When it comes to antimicrobial resistance, the gene might be the clue, but its neighborhood tells the whole story.</p><p>Read more about it @&nbsp;https://academic.oup.com/nargab/article/8/3/lqag066/8733748</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</guid>
	<pubDate>Thu, 23 Nov 2017 09:55:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</link>
	<title><![CDATA[poRe: an R package for the visualization and analysis of nanopore sequencing data]]></title>
	<description><![CDATA[<p><strong>Motivation:</strong>&nbsp;The Oxford Nanopore MinION device represents a unique sequencing technology. As a mobile sequencing device powered by the USB port of a laptop, the MinION has huge potential applications. To enable these applications, the bioinformatics community will need to design and build a suite of tools specifically for MinION data.</p>
<p><strong>Results:</strong>&nbsp;Here we present poRe, a package for R that enables users to manipulate, organize, summarize and visualize MinION nanopore sequencing data. As a package for R, poRe has been tested on Windows, Linux and MacOSX. Crucially, the Windows version allows users to analyse MinION data on the Windows laptop attached to the device.</p>
<p><strong>Availability and implementation:</strong>&nbsp;poRe is released as a package for R at&nbsp;<a href="http://sourceforge.net/projects/rpore/" target="">http://sourceforge.net/projects/rpore/</a>&nbsp;. A tutorial and further information are available at&nbsp;<a href="https://sourceforge.net/p/rpore/wiki/Home/" target="">https://sourceforge.net/p/rpore/wiki/Home/</a></p>
<p><strong>Contact:</strong><a href="mailto:mick.watson@roslin.ed.ac.uk" target="">mick.watson@roslin.ed.ac.uk</a></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/1/114/2365693" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/1/114/2365693</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>