<?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/37905?offset=490</link>
	<atom:link href="https://bioinformaticsonline.com/related/37905?offset=490" 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/file/view/43732/spades-tutorial-pdf</guid>
	<pubDate>Tue, 01 Feb 2022 04:56:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</link>
	<title><![CDATA[Spades tutorial PDF]]></title>
	<description><![CDATA[<p>SPAdes&mdash;St. Petersburg genome Assembler&mdash;was originally developed for de novo assembly of genome sequencing data produced for cultivated microbial isolates and for single-cell genomic DNA sequencing. With time, the functionality of SPAdes was extended to enable assembly of IonTorrent data, as well as hybrid assembly from short and long reads (PacBio and Oxford Nanopore). In this article we present protocols for five different assembly pipelines that comprise the SPAdes package and that are used for assembly of metagenomes and transcriptomes as well as assembly of putative plasmids and biosynthetic gene clusters from whole-genome sequencing and metagenomic datasets.&nbsp;</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/43732" length="268093" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</guid>
	<pubDate>Wed, 08 May 2024 07:32:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</link>
	<title><![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]></title>
	<description><![CDATA[<p dir="auto">ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.</p>
<p dir="auto">More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/</p>
<p dir="auto"><a href="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" target="_blank"><img src="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" alt="extension process" title="extension process" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/dengzac/contig-extender" rel="nofollow">https://github.com/dengzac/contig-extender</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</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/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:59:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</link>
	<title><![CDATA[Meraculous: Haplotype-sensitive Assembly of Highly Heterozygous genomes.]]></title>
	<description><![CDATA[<p><span>Meraculous is a whole genome assembler for Next Generation Sequencing data geared for large genomes. It is a hybrid k-mer/read-based assembler that capitalizes on the high accuracy of Illumina sequence by eschewing an explicit error correction step which we argue to be redundant with the assembly process. Meraculous achieves high performance with large datasets by utilizing lightweight data structures and multi-threaded parallelization, allowing to assemble human-sized genomes on commodity clusters in under a day. The process pipeline implements a highly transparent and portable model of job control and monitoring where different assembly stages can be executed and re-executed separately or in unison on a wide variety of architectures.</span></p>
<p><span>https://jgi.doe.gov/data-and-tools/meraculous/</span></p>
<p><span>https://arxiv.org/ftp/arxiv/papers/1703/1703.09852.pdf</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/meraculous20/" rel="nofollow">https://sourceforge.net/projects/meraculous20/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/43913/lsugenomics-lab</guid>
  <pubDate>Thu, 07 Jul 2022 05:26:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[lsugenomics Lab]]></title>
  <description><![CDATA[
<p>﻿In our lab, we seek to characterize and to compare genomes in order to better understand genetic and evolutionary processes linking genotypes to phenotypes.  <br /> <br />Sequencing and decoding plant genomes have been integral in our approaches.</p>

<p>The overarching goal of our research is to understand how to interpret complex and fascinating messages embedded in genomes.</p>

<p>https://www.lsugenomics.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</guid>
	<pubDate>Wed, 29 Nov 2017 16:44:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</link>
	<title><![CDATA[Scripts for the analysis of HGT in genome sequence data.]]></title>
	<description><![CDATA[<p><span>Scripts for the analysis of HGT in genome sequence data</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/hgt" rel="nofollow">https://github.com/reubwn/hgt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>