<?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/34718?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/34718?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</guid>
	<pubDate>Fri, 03 Jan 2020 13:28:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</link>
	<title><![CDATA[DeCoSTAR: Reconstructing the Ancestral Organization of Genes or Genomes Using Reconciled Phylogenies]]></title>
	<description><![CDATA[<p>DeCoSTAR computes adjacency evolutionary scenarios using a scoring scheme based on a weighted sum of adjacency gains and breakages. Solutions, both optimal and near-optimal, are sampled according to the Boltzmann&ndash;Gibbs distribution centered around parsimonious solutions, and statistical supports on ancestral and extant adjacencies are provided. DeCoSTAR supports the features of previously contributed tools that reconstruct ancestral adjacencies, namely DeCo, DeCoLT, ART-DeCo, and DeClone. In a few minutes, DeCoSTAR can reconstruct the evolutionary history of domains inside genes, of gene fusion and fission events, or of gene order along chromosomes, for large data sets including dozens of whole genomes from all kingdoms of life.</p><p>Address of the bookmark: <a href="https://github.com/YoannAnselmetti/DeCoSTAR_pipeline" rel="nofollow">https://github.com/YoannAnselmetti/DeCoSTAR_pipeline</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</guid>
	<pubDate>Sat, 02 Jan 2021 07:05:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</link>
	<title><![CDATA[shovill: Assemble bacterial isolate genomes from Illumina paired-end reads]]></title>
	<description><![CDATA[<p><span>Shovill is a pipeline which uses SPAdes at its core, but alters the steps before and after the primary assembly step to get similar results in less time. Shovill also supports other assemblers like SKESA, Velvet and Megahit, so you can take advantage of the pre- and post-processing the Shovill provides with those too.</span></p><p>Address of the bookmark: <a href="https://github.com/tseemann/shovill" rel="nofollow">https://github.com/tseemann/shovill</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</guid>
	<pubDate>Wed, 27 Dec 2017 00:04:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</link>
	<title><![CDATA[Recovery of complete genomes from metagenomes]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p><strong>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</strong></p>
<p><a href="http://personprofil.aau.dk/120257">Mads Albertsen</a>,&nbsp;<a href="http://ecogenomic.org/users/phil-hugenholtz">Philip Hugenholtz</a>,&nbsp;<a href="http://ecogenomic.org/users/adam-skarshewski">Adam Skarshewski</a>,&nbsp;<a href="http://www.ecogenomic.org/users/gene-tyson">Gene W. Tyson</a>,&nbsp;<a href="http://personprofil.aau.dk/103057">K&aring;re L. Nielsen</a>&nbsp;and&nbsp;<a href="http://personprofil.aau.dk/105842">Per .H. Nielsen</a></p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="http://madsalbertsen.github.io/multi-metagenome/" rel="nofollow">http://madsalbertsen.github.io/multi-metagenome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</guid>
	<pubDate>Mon, 14 May 2018 04:02:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</link>
	<title><![CDATA[Digest: In silico restriction digest of complete genomes]]></title>
	<description><![CDATA[<p><span>This tool allows to retrieve number of cleavages yielded by commercially available endonucleases in up-to-date sequenced prokaryotic genomes. When the number of fragments is bellow 50, Pulse Field gel Electrophoresis (PFGE) is simulated.</span></p>
<p>A tool for restriction digest of&nbsp;<a href="http://insilico.ehu.eus/restriction/long_seq/">long</a>user's sequences is available.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://insilico.ehu.es/digest/" rel="nofollow">http://insilico.ehu.es/digest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37572/gtdb-tk-a-toolkit-for-assigning-objective-taxonomic-classifications-to-bacterial-and-archaeal-genomes</guid>
	<pubDate>Wed, 22 Aug 2018 03:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37572/gtdb-tk-a-toolkit-for-assigning-objective-taxonomic-classifications-to-bacterial-and-archaeal-genomes</link>
	<title><![CDATA[GTDB-Tk: A toolkit for assigning objective taxonomic classifications to bacterial and archaeal genomes.]]></title>
	<description><![CDATA[<p>GTDB-Tk is a software toolkit for assigning objective taxonomic classifications to bacterial and archaeal genomes. It is computationally efficient and designed to work with recent advances that allow hundreds or thousands of metagenome-assembled genomes (MAGs) to be obtained directly from environmental samples. It can also be applied to isolate and single-cell genomes. The GTDB-Tk is open source and released under the GNU General Public License (Version 3).</p>
<p>GTDB-Tk is&nbsp;<span>under active development and validation</span>. Please independently confirm the GTDB-Tk predictions by manually inspecting the tree and bringing any discrepencies to our attention. Notifications about GTDB-Tk releases will be available through the ACE Twitter account (<a href="https://twitter.com/ace_uq">https://twitter.com/ace_uq</a>).</p><p>Address of the bookmark: <a href="https://github.com/Ecogenomics/GTDBTk" rel="nofollow">https://github.com/Ecogenomics/GTDBTk</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39867/gepard-allows-the-calculation-of-dotplots-even-for-large-sequences-like-chromosomes-or-bacterial-genomes</guid>
	<pubDate>Mon, 26 Aug 2019 11:38:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39867/gepard-allows-the-calculation-of-dotplots-even-for-large-sequences-like-chromosomes-or-bacterial-genomes</link>
	<title><![CDATA[Gepard: allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes]]></title>
	<description><![CDATA[<p>Gepard (German: "cheetah", Backronym for "GEnome PAir - Rapid Dotter") allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes. Reference: Krumsiek J, Arnold R, Rattei T. Gepard: A rapid and sensitive tool for creating dotplots on genome scale. Bioinformatics 2007; 23(8): 1026-8. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/17309896" target="_blank">17309896</a></p>
<p><a href="http://cube.univie.ac.at/gepard">http://cube.univie.ac.at/gepard</a></p><p>Address of the bookmark: <a href="https://github.com/univieCUBE/gepard" rel="nofollow">https://github.com/univieCUBE/gepard</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 04:06:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</link>
	<title><![CDATA[mutatrix: a population genome simulator which generates simulated genomes.]]></title>
	<description><![CDATA[<p><span>genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms</span></p>
<p><span>More at&nbsp;<a href="https://github.com/ekg/mutatrix">https://github.com/ekg/mutatrix</a></span></p>
<pre>./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta</pre><p>Address of the bookmark: <a href="https://github.com/ekg/mutatrix" rel="nofollow">https://github.com/ekg/mutatrix</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</guid>
	<pubDate>Wed, 10 Mar 2021 06:13:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</link>
	<title><![CDATA[CSA: A high-throughput chromosome-scale assembly pipeline for vertebrate genomes]]></title>
	<description><![CDATA[<p>The pipeline can use information from scaffolded assemblies (for example from HiC or 10X Genomics), or even from diverged (~65-100 Mya) reference genomes for ordering the contigs and thus support the assembly process. This typically results in improved contig N50 when compared to current state of the art methods.</p>
<p><img src="https://github.com/HMPNK/CSA2.6/raw/master/Fig1.png" alt="image" style="border: 0px;"></p>
<p>For smaller vertebrate genomes (~1 Gbp) chromosome scale assemblies can be achieved within 12h on high-end Desktop computers (Intel i7, 12 CPU threads, 128 GB RAM). Larger mammalian genomes (~3Gbp) can be processed within 15-18 h on server equipment (Xeon, 96 CPU threads, 1TB RAM).</p><p>Address of the bookmark: <a href="https://github.com/HMPNK/CSA2.6" rel="nofollow">https://github.com/HMPNK/CSA2.6</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</guid>
	<pubDate>Wed, 25 Nov 2020 19:44:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</link>
	<title><![CDATA[IRscope: an online program to visualize the junction sites of chloroplast genomes]]></title>
	<description><![CDATA[<p><span>eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.</span></p><p>Address of the bookmark: <a href="https://sites.google.com/g.hmc.edu/empress/home" rel="nofollow">https://sites.google.com/g.hmc.edu/empress/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>