<?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/36512?offset=370</link>
	<atom:link href="https://bioinformaticsonline.com/related/36512?offset=370" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</guid>
	<pubDate>Sat, 03 Jun 2023 20:15:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</link>
	<title><![CDATA[Metabuli 분리 improves metagenomic read classification]]></title>
	<description><![CDATA[<p><span>Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.</span></p>
<p>&nbsp;</p>
<p><span><span>Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure,&nbsp;</span><em>metamer</em><span>, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.</span> </span></p><p>Address of the bookmark: <a href="https://github.com/steineggerlab/Metabuli" rel="nofollow">https://github.com/steineggerlab/Metabuli</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4099/sequencing-solutions-to-world-health</guid>
	<pubDate>Thu, 29 Aug 2013 15:05:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4099/sequencing-solutions-to-world-health</link>
	<title><![CDATA[Sequencing Solutions to World Health]]></title>
	<description><![CDATA[<p>"<em>New technology that quickly, easily and economically reveals the genomes of viruses and pathogens transforms public health and medicine."</em></p>
<p><strong>Source</strong>: Life technologies</p><p>Address of the bookmark: <a href="http://www.lifetechnologies.com/global/en/home/communities-social/blog/blogs/sequencing-solutions-to-world-health.html?cid=social_blogseries_20130829_11098264" rel="nofollow">http://www.lifetechnologies.com/global/en/home/communities-social/blog/blogs/sequencing-solutions-to-world-health.html?cid=social_blogseries_20130829_11098264</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/2518/genome-browsers</guid>
	<pubDate>Fri, 16 Aug 2013 19:04:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/2518/genome-browsers</link>
	<title><![CDATA[Genome Browsers]]></title>
	<description><![CDATA[<p>Genome Browser is the platform/database used for searching and retreiving sequences and annotation of genomes belong to various eukaryotes, prokaryotes, etc.</p><p>Following are the weblink for different available browsers:</p><p><a href="http://www.ensembl.org/index.html">http://www.ensembl.org/index.html</a></p><p><a href="http://ensemblgenomes.org/">http://ensemblgenomes.org/</a></p><p><a href="http://genome.ucsc.edu/">http://genome.ucsc.edu/</a></p><p><a href="http://www.ncbi.nlm.nih.gov/genome">http://www.ncbi.nlm.nih.gov/genome</a></p><p><a href="http://www.ebi.ac.uk/genomes/">http://www.ebi.ac.uk/genomes/</a></p><p><a href="http://flybase.org/">http://flybase.org/</a></p><p><a href="http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi">http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi</a></p><p><a href="http://www.sanger.ac.uk/resources/databases/">http://www.sanger.ac.uk/resources/databases/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4164/two-major-breakthrough</guid>
	<pubDate>Mon, 02 Sep 2013 10:18:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4164/two-major-breakthrough</link>
	<title><![CDATA[Two major breakthrough!!]]></title>
	<description><![CDATA[<p>"Scientists in Uruguay in colloboration with European partners sequenced the genome of the high-value Tannat grape, from which "the most healthy of red wines" are fermented.</p><p>A quick, $1 syphilis&nbsp;test in development by researchers from UNU-BIOLAC."</p><p><strong>Source</strong>:</p><p><a href="http://www.sciencedaily.com/releases/2013/09/130902101846.htm">http://www.sciencedaily.com/releases/2013/09/130902101846.htm</a></p><p><a href="http://www.eurekalert.org/pub_releases/2013-09/tca-ssg082613.php">http://www.eurekalert.org/pub_releases/2013-09/tca-ssg082613.php</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9032/encode-sequencing-data-freely-available-to-download-and-use-for-academic-means</guid>
	<pubDate>Thu, 13 Mar 2014 18:18:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9032/encode-sequencing-data-freely-available-to-download-and-use-for-academic-means</link>
	<title><![CDATA[Encode sequencing data freely available to download and use for academic means]]></title>
	<description><![CDATA[<p>In <span style="text-decoration: underline;"><strong>Encode</strong></span>,&nbsp;<span>regulatory elements investigated via DNA hypersensitivity assays, assays of DNA methylation, and chromatin immunoprecipitation (ChIP) of proteins that interact with DNA, including modified histones and transcription factors, followed by sequencing (ChIP-Seq).</span></p>
<p><span>More information:</span></p>
<p><span>https://genome.ucsc.edu/ENCODE/pilot.html</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://genome.ucsc.edu/ENCODE/" rel="nofollow">https://genome.ucsc.edu/ENCODE/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10238/tsetse-fly-genome-sequenced</guid>
	<pubDate>Fri, 25 Apr 2014 10:48:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10238/tsetse-fly-genome-sequenced</link>
	<title><![CDATA[Tsetse Fly Genome sequenced]]></title>
	<description><![CDATA[<p><span><span>As it&nbsp;</span><a href="http://www.sciencemag.org/content/344/6182/380" target="_blank">reported online today</a><span>&nbsp;in&nbsp;</span><em>Science</em><span>, the team used several sequencing approaches to tackle the tsetse fly's 366 million base genome.</span></span></p><p><span>The current study, and companion articles slated to appear in&nbsp;</span><em>PLOS One</em><span>,&nbsp;</span><em>PLOS Genetics</em><span>, and&nbsp;</span><em>PLOS Neglected Tropic Diseases</em><span>, are the result of &nbsp;nearly 150 researchers based in 18 countries.</span></p><p><span>Source:</span></p><p><span>http://www.genomeweb.com/sequencing/international-team-sequences-tsetse-fly-genome</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/10739/science-for-life-laboratory-scilifelab-sweden</guid>
  <pubDate>Sat, 10 May 2014 06:22:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Science for Life Laboratory (SciLifeLab)-Sweden]]></title>
  <description><![CDATA[
<p>Science for Life Laboratory (SciLifeLab) is a national center for molecular biosciences with focus on health and environmental research. The center combines frontline technical expertise with advanced knowledge of translational medicine and molecular bioscience. SciLifeLab is a national resource and a collaboration between four universities: Karolinska Institutet, KTH Royal Institute of Technology, Stockholm University and Uppsala University.</p>

<p>Webpage : https://www.scilifelab.se/about-us/<br />Opportunity: https://www.scilifelab.se/about-us/career/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/13267/the-genome-10k-project</guid>
	<pubDate>Tue, 29 Jul 2014 09:11:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/13267/the-genome-10k-project</link>
	<title><![CDATA[The Genome 10K Project]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/B57xDIGtCT0" frameborder="0" allowfullscreen></iframe>https://genome10k.soe.ucsc.edu

The Genome 10K project aims to assemble a genomic zoo—a collection of DNA sequences representing the genomes of 10,000 vertebrate species, approximately one for every vertebrate genus. The trajectory of cost reduction in DNA sequencing suggests that this project will be feasible within a few years. Capturing the genetic diversity of vertebrate species would create an unprecedented resource for the life sciences and for worldwide conservation efforts.

The growing Genome 10K Community of Scientists (G10KCOS), made up of leading scientists representing major zoos, museums, research centers, and universities around the world, is dedicated to coordinating efforts in tissue specimen collection that will lay the groundwork for a large-scale sequencing and analysis project.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23167/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Mon, 06 Jul 2015 08:46:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23167/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</link>
	<title><![CDATA[GraphMap - A highly sensitive and accurate mapper for long, error-prone reads]]></title>
	<description><![CDATA[<p>GraphMap is a novel mapper targeted at aligning long, error-prone third-generation sequencing data.<br>It is&nbsp;<strong>designed to handle Oxford Nanopore MinION 1d and 2d reads</strong>&nbsp;with very high sensitivity and accuracy, and also presents a significant improvement over the state-of-the-art for PacBio read mappers.</p>
<p>GraphMap was also designed for ease-of-use: the&nbsp;<strong>default parameters</strong>&nbsp;can handle a wide range of read lengths and error profiles, including:&nbsp;<em>Illumina</em>,&nbsp;<em>PacBio</em>&nbsp;and&nbsp;<em>Oxford Nanopore</em>.<br>This is an especially important feature for technologies where the error rates and error profiles can vary widely across, or even within, sequencing runs.</p>
<p><a href="http://biorxiv.org/content/early/2015/06/10/020719">http://biorxiv.org/content/early/2015/06/10/020719</a></p><p>Address of the bookmark: <a href="https://github.com/isovic/graphmap" rel="nofollow">https://github.com/isovic/graphmap</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>