<?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/35635?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/35635?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44387/creating-genetic-maps-from-gbs-data</guid>
	<pubDate>Fri, 08 Sep 2023 06:31:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44387/creating-genetic-maps-from-gbs-data</link>
	<title><![CDATA[Creating Genetic Maps from GBS data]]></title>
	<description><![CDATA[<p><span>Genetic map, as the name suggest is simply knowing the relative positions of specific sequences across the genome. There are various methods to generate them, but most popular method is to use a cross between the known parents and examining their progenies. These kinds of crosses to create specific group of individuals of known ancestry is called as mapping population. Many types of mapping population exist. Here we will use the data collected from a Recombinant Inbred Line (RIL) (through selfing) to create a genetic map.</span></p><p>Address of the bookmark: <a href="https://bioinformaticsworkbook.org/dataAnalysis/GenomeAssembly/GeneticMaps/creating-genetic-maps.html" rel="nofollow">https://bioinformaticsworkbook.org/dataAnalysis/GenomeAssembly/GeneticMaps/creating-genetic-maps.html</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</guid>
	<pubDate>Wed, 13 Aug 2025 02:31:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</link>
	<title><![CDATA[BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data]]></title>
	<description><![CDATA[<p>2,438,386 bacterial genomes at your fingertips consistently processed &amp; characterized, enriched with metadata, accessible via a flexible search engine.</p>
<p>BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data. It integrates enriched genomic information with metadata accessible via a flexible search-engine.</p>
<h1>Key features</h1>
<ul>
<li>Assembly statistics: ensure data quality with genome-based key metrics</li>
<li>Taxonomic classification: robust, purely genome-based classifications (<a href="https://gtdb.ecogenomic.org/" target="_blank">GTDB</a>)</li>
<li><a href="https://pubmlst.org/">MLST</a>: subtyping for deeper insights into genetic variation</li>
<li>Annotation: comprehensive &amp; taxonomy-independent (<a href="https://bakta.computational.bio/" target="_blank">Bakta</a>)</li>
<li>Metadata: full original submission records</li>
</ul>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://bakrep.computational.bio/" rel="nofollow">https://bakrep.computational.bio/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26729/ga4gh-data-working-group</guid>
	<pubDate>Sun, 20 Mar 2016 23:13:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26729/ga4gh-data-working-group</link>
	<title><![CDATA[GA4GH Data Working Group]]></title>
	<description><![CDATA[<p>GA4GH Data Working Group</p>
<p>Led by David Haussler (UCSC) and Richard Durbin (Sanger Institute), the Data Working Group (DWG) of the Global Alliance brings together the leading Genome Institutes and Centers with IT industry leaders to create global standards and tools for the secure, privacy respecting and interoperable sharing of Genomic data.</p>
<p>More at&nbsp;http://ga4gh.org/#/</p><p>Address of the bookmark: <a href="http://ga4gh.org/#/" rel="nofollow">http://ga4gh.org/#/</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/38226/ncbi-to-assist-in-virus-hunting-data-science-hackathon</guid>
	<pubDate>Thu, 15 Nov 2018 12:55:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/38226/ncbi-to-assist-in-virus-hunting-data-science-hackathon</link>
	<title><![CDATA[NCBI to assist in Virus Hunting Data Science Hackathon]]></title>
	<description><![CDATA[<p>NCBI Hackathon are pleased to announce the second installment of the&nbsp;<a href="https://ncbiinsights.ncbi.nlm.nih.gov/2017/11/30/ncbi-southern-california-genomics-hackathon-january/" target="_blank">SoCal Bioinformatics Hackathon</a>. From January 9-11, 2019, the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/" target="_blank">NCBI</a>&nbsp;will help run a bioinformatics hackathon in Southern California hosted by the&nbsp;<a href="http://www.csrc.sdsu.edu/" target="_blank">Computational Sciences Research Center</a>&nbsp;at&nbsp;<a href="http://www.sdsu.edu/" target="_blank">San Diego State University</a>!</p><p><span>NCBI Hackathon</span>&nbsp;specifically looking for folks who have experience in computational virus hunting or adjacent fields to identify known, taxonomically-definable and novel viruses from a few hundred thousand metagenomic datasets that we&rsquo;ll put on cloud infrastructure. This event is for researchers, including students and postdocs, who are already engaged in the use of bioinformatics data or in the development of pipelines for virological analyses from high-throughput experiments. If this describes you, please&nbsp;<a href="https://goo.gl/forms/kDnSG0IAZD62XQRe2" target="_blank">apply</a>! The event is open to anyone selected for the hackathon and willing to travel to SDSU (see below).</p><p>https://ncbiinsights.ncbi.nlm.nih.gov/2018/11/09/ncbi-sdsu-virus-hunting-data-science-hackathon-january-2019/</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41328/deephic-a-generative-adversarial-network-for-enhancing-hi-c-data-resolution</guid>
	<pubDate>Tue, 03 Mar 2020 01:12:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41328/deephic-a-generative-adversarial-network-for-enhancing-hi-c-data-resolution</link>
	<title><![CDATA[DeepHiC: A Generative Adversarial Network for Enhancing Hi-C Data Resolution]]></title>
	<description><![CDATA[<p><strong>DeepHiC</strong> is a GAN-based model for enhancing Hi-C data resolution. We developed this server for helping researchers to enhance their own low-resolution data by a few steps of clicks. <em>Ab initio</em> training could be performed according to our published <a href="https://github.com/omegahh/DeepHiC">code</a>. We provided trained models for various depth of low-coverage sequencing Hi-C data. The depth of input data is estimated by its distribution comparing with those of the downsampled Hi-C data we used in training</p><p>Address of the bookmark: <a href="http://sysomics.com/deephic" rel="nofollow">http://sysomics.com/deephic</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44545/amr-database</guid>
	<pubDate>Tue, 04 Jun 2024 13:37:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44545/amr-database</link>
	<title><![CDATA[AMR Database !]]></title>
	<description><![CDATA[<ul>
<li><a href="http://en.mediterranee-infection.com/article.php?laref=283%26titre=arg-annot">ARG-ANNOT</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24145532">24145532</a></li>
<li><a href="https://card.mcmaster.ca/">CARD</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/23650175">23650175</a></li>
<li><a href="https://megares.meglab.org/">MEGARes</a>&nbsp;PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/27899569">27899569</a></li>
<li><a href="https://www.ncbi.nlm.nih.gov/pathogens/isolates#/refgene/">NCBI</a>&nbsp;BioProject:&nbsp;<a href="https://www.ncbi.nlm.nih.gov/bioproject/?term=PRJNA313047">PRJNA313047</a></li>
<li><a href="https://cge.cbs.dtu.dk/services/PlasmidFinder/">plasmidfinder</a>&nbsp;PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24777092">24777092</a></li>
<li><a href="https://cge.cbs.dtu.dk//services/ResFinder/">resfinder</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/22782487">22782487</a></li>
<li><a href="http://www.mgc.ac.cn/VFs/">VFDB</a>. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26578559">26578559</a></li>
<li><a href="https://github.com/katholt/srst2">SRST2</a>'s version of ARG-ANNOT. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/25422674">25422674</a>.</li>
<li><a href="https://cge.cbs.dtu.dk/services/VirulenceFinder/">VirulenceFinder</a>&nbsp;PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24574290">24574290</a>.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/sanger-pathogens/ariba/wiki/Task%3A-getref" rel="nofollow">https://github.com/sanger-pathogens/ariba/wiki/Task%3A-getref</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</guid>
	<pubDate>Fri, 14 Apr 2017 06:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</link>
	<title><![CDATA[DeCoSTAR - Detection of Co-evolution]]></title>
	<description><![CDATA[<p><span>DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.</span><br><span>Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the&nbsp;</span><a href="http://mbb.univ-montp2.fr/MBB/download_sources/16__TERA">ecceTERA package</a><span>, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.&nbsp;</span><br><span>DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.</span></p><p>Address of the bookmark: <a href="http://pbil.univ-lyon1.fr/software/DeCoSTAR/" rel="nofollow">http://pbil.univ-lyon1.fr/software/DeCoSTAR/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35823/regen-ancestral-genome-reconstruction-for-bacteria</guid>
	<pubDate>Tue, 06 Mar 2018 05:02:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35823/regen-ancestral-genome-reconstruction-for-bacteria</link>
	<title><![CDATA[REGEN: Ancestral Genome Reconstruction for Bacteria]]></title>
	<description><![CDATA[<p><span>REGEN infers evolutionary events, including gene creation and deletion and replicon fission and fusion. The reconstruction can be performed by either a maximum parsimony or a maximum likelihood method. Gene content reconstruction is based on the concept of neighboring gene pairs. REGEN was designed to be used with any set of genomes that are sufficiently related, which will usually be the case for bacteria within the same taxonomic order.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.mdpi.com/2073-4425/3/3/423" rel="nofollow">http://www.mdpi.com/2073-4425/3/3/423</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/8481/des-higgins-visualizing-multiple-sequence-alignments</guid>
	<pubDate>Wed, 26 Feb 2014 00:50:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/8481/des-higgins-visualizing-multiple-sequence-alignments</link>
	<title><![CDATA[Des Higgins: Visualizing Multiple Sequence Alignments]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/IQkOK3dsWs4" frameborder="0" allowfullscreen></iframe>Copyright Broad Institute, 2013. All rights reserved.
Des Higgins (http://www.bioinf.ucd.ie) gives a very entertaining introduction to the visualization of multiple sequence alignment, and to his widely-used Clustal tool. He highlights the emerging challenge of managing alignments with a very large number of sequences, and presents several approaches to this challenge, including faster algorithms and abstract views of clusters of alignments. This talk was presented at VIZBI 2011, an international conference series on visualizing biological data (http://www.vizbi.org) funded by NIH & EMBO.

For information about data visualization efforts at the Broad Institute, please visit:
http://www.broadinstitute.org/node/1363/]]></description>
	
</item>

</channel>
</rss>