<?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/40994?offset=360</link>
	<atom:link href="https://bioinformaticsonline.com/related/40994?offset=360" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/33720/deschrambler</guid>
	<pubDate>Thu, 29 Jun 2017 11:54:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33720/deschrambler</link>
	<title><![CDATA[DESCHRAMBLER]]></title>
	<description><![CDATA[<p>DESCHRAMBLER is shown to produce highly accurate reconstructions using data simulation and by benchmarking it against other reconstruction tools</p>
<p>You can find the detail of reconstructed data at http://bioinfo.konkuk.ac.kr/DESCHRAMBLER/</p><p>Address of the bookmark: <a href="https://github.com/jkimlab/DESCHRAMBLER" rel="nofollow">https://github.com/jkimlab/DESCHRAMBLER</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/file/view/37581/comparativegenomics-exercise2</guid>
	<pubDate>Wed, 22 Aug 2018 22:10:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/37581/comparativegenomics-exercise2</link>
	<title><![CDATA[ComparativeGenomics Exercise2]]></title>
	<description><![CDATA[<p>COMPARATIVE MICROBIAL GENOMICS ANALYSIS WORKSHOP&nbsp; @&nbsp;cbs.dtu.dk</p><p>Free Bioinformatics workbench https://www.mn.uio.no/ifi/english/research/networks/clsi/earlier_seminars/2012/tammivesth_osloseminarfinal.pdf</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/37581" length="139956" type="application/pdf" />
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/38418/charles-swanton-lab</guid>
  <pubDate>Tue, 11 Dec 2018 08:09:22 -0600</pubDate>
  <link></link>
  <title><![CDATA[CHARLES SWANTON LAB]]></title>
  <description><![CDATA[
<p>They are using the latest DNA sequencing technology to read the genetic makeup of cancer cells within tumours in ever greater detail, teasing out patterns of evolution (evolutionary rule books), cancer heterogeneity and working out what changes have happened as a tumour evolves. We’re also investigating the processes that cause mutations and accelerate tumour evolution and working out how they might be stopped. And we are running evolutionary clinical trials with immune and targeted therapies to bring the benefits of our work to patients as quickly as possible.</p>

<p>https://www.crick.ac.uk/research/labs/charles-swanton</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38758/roary-the-pan-genome-pipeline</guid>
	<pubDate>Tue, 22 Jan 2019 05:52:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38758/roary-the-pan-genome-pipeline</link>
	<title><![CDATA[Roary: the Pan Genome Pipeline]]></title>
	<description><![CDATA[<p><span>Roary is a high speed stand alone pan genome pipeline, which takes annotated assemblies in GFF3 format (produced by Prokka (Seemann, 2014)) and calculates the pan genome. Using a standard desktop PC, it can analyse datasets with thousands of samples, something which is computationally infeasible with existing methods, without compromising the quality of the results. 128 samples can be analysed in under 1 hour using 1 GB of RAM and a single processor. To perform this analysis using existing methods would take weeks and hundreds of GB of RAM. Roary is not intended for meta-genomics or for comparing extremely diverse sets of genomes.</span></p><p>Address of the bookmark: <a href="https://sanger-pathogens.github.io/Roary/" rel="nofollow">https://sanger-pathogens.github.io/Roary/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39821/gvolante-completeness-assessment-of-genometranscriptome-sequences</guid>
	<pubDate>Tue, 06 Aug 2019 21:37:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39821/gvolante-completeness-assessment-of-genometranscriptome-sequences</link>
	<title><![CDATA[gVolante: Completeness Assessment of Genome/Transcriptome Sequences]]></title>
	<description><![CDATA[<p><strong>gVolante</strong><span>&nbsp;provides an online interface for completeness assessment of user&rsquo;s original or publicly available sequence datasets as well as for browsing results of completeness assessment performed on publicly available genome and transcriptome assemblies.</span></p>
<p><img src="https://gvolante.riken.jp/images/assessment.png" width="937" height="545" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://gvolante.riken.jp/" rel="nofollow">https://gvolante.riken.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41330/u-plot-genome-u-plot-sample-implementation</guid>
	<pubDate>Tue, 03 Mar 2020 01:39:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41330/u-plot-genome-u-plot-sample-implementation</link>
	<title><![CDATA[U-Plot: Genome U-Plot sample implementation]]></title>
	<description><![CDATA[<p>The Genome U-Plot is a JavaScript tool to visualize Chromosomal abnormalities in the Human Genome using a U-shape layout.</p>
<p><img src="https://raw.githubusercontent.com/gaitat/GenomeUPlot/master/public/data/LNCAP.png" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/gaitat/GenomeUPlot" rel="nofollow">https://github.com/gaitat/GenomeUPlot</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>