<?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/40613?offset=500</link>
	<atom:link href="https://bioinformaticsonline.com/related/40613?offset=500" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</guid>
	<pubDate>Fri, 05 Feb 2021 21:22:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</link>
	<title><![CDATA[GraphUnzip: Phases an assembly graph using Hi-C data and/or long reads.]]></title>
	<description><![CDATA[<p>GraphUnzip, a fast, memory-efficient and accurate tool to unzip assembly graphs into their constituent haplotypes using long reads and/or Hi-C data. As GraphUnzip only connects sequences in the assembly graph that already had a potential link based on overlaps, it yields high-quality gap-less supercontigs. To demonstrate the efficiency of GraphUnzip, we tested it on a simulated diploid Escherichia coli genome, and on two real datasets for the genomes of the rotifer Adineta vaga and the potato Solanum tuberosum. In all cases, GraphUnzip yielded highly continuous phased assemblies.</p>
<p>https://www.biorxiv.org/content/biorxiv/early/2021/02/01/2021.01.29.428779.full.pdf</p><p>Address of the bookmark: <a href="https://github.com/nadegeguiglielmoni/GraphUnzip" rel="nofollow">https://github.com/nadegeguiglielmoni/GraphUnzip</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43645/corona-virus-genome-and-data-download</guid>
	<pubDate>Sun, 12 Dec 2021 23:34:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43645/corona-virus-genome-and-data-download</link>
	<title><![CDATA[Corona Virus Genome and Data Download !]]></title>
	<description><![CDATA[<p>Genes and its related metadata could be found on&nbsp;https://www.ncbi.nlm.nih.gov/datasets/coronavirus/genomes/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/datasets/coronavirus/genomes/" rel="nofollow">https://www.ncbi.nlm.nih.gov/datasets/coronavirus/genomes/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44252/orange-data-mining</guid>
	<pubDate>Mon, 13 Mar 2023 12:42:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44252/orange-data-mining</link>
	<title><![CDATA[Orange: Data mining]]></title>
	<description><![CDATA[<div>
<p>Open source machine learning and data visualization.</p>
<p>Build data analysis workflows visually, with a large, diverse toolbox.</p>
<p>&nbsp;</p>
</div><p>Address of the bookmark: <a href="https://orangedatamining.com/" rel="nofollow">https://orangedatamining.com/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<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/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</guid>
	<pubDate>Thu, 05 Sep 2013 07:24:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</link>
	<title><![CDATA[New born babies get ready to know their whole genome soon!!!]]></title>
	<description><![CDATA[<p>USA launch a pilot projects to examine medical information of newborn baby, which are being funded by the Eunice Kennedy Shriver National Institute of Child Health and Human Development (NICHD) and the National Human Genome Research Institute (NHGRI), both parts of the National Institutes of Health.</p><p>Awards of $5 million to four grantees have been made in fiscal year 2013 under the Genomic Sequencing and Newborn Screening Disorders research program. The program will be funded at $25 million over five years, as funds are made available.</p><p>"Hundreds of US babies will be pioneers in genomic medicine through a&nbsp;US$25-million programme to sequence their genomes&nbsp;soon after they are born."</p><p><strong>Source</strong>:</p><p><a href="http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html">http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html</a></p><p><a href="http://www.genome.gov/27554919">http://www.genome.gov/27554919</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>