<?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/35252?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/35252?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43806/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Mon, 28 Feb 2022 23:27:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43806/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><br><strong>Summary statistics of Genomicus version 105.01:</strong><span>&nbsp;(view species tree in&nbsp;</span><a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/data/SpeciesTree.pdf">pdf</a><span>&nbsp;or&nbsp;</span><a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/data/SpeciesTree.nwk">newick</a><span>)</span><br><br></p>
<table id="introstats">
<tbody>
<tr><th>Number of extant species</th>
<td>200</td>
</tr>
<tr><th>Number of extant genes</th>
<td>4303993</td>
</tr>
<tr><th>&nbsp;</th></tr>
<tr><th>Number of ancestral species</th>
<td>196</td>
</tr>
<tr><th>Number of ancestral genes</th>
<td>4624213</td>
</tr>
<tr><th>Number of ancestral synteny blocks</th>
<td>83342<br><br></td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl" rel="nofollow">https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44561/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</guid>
	<pubDate>Sat, 08 Jun 2024 16:25:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44561/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</link>
	<title><![CDATA[Bactopia: a flexible pipeline for complete analysis of bacterial genomes]]></title>
	<description><![CDATA[<p>Bactopia is a flexible pipeline for complete analysis of bacterial genomes. The goal of Bactopia is process your data with a broad set of tools, so that you can get to the fun part of analyses quicker!</p>
<p>Bactopia was inspired by&nbsp;<a href="https://staphopia.github.io/">Staphopia</a>, a workflow we (Tim Read and myself) released that is targeted towards&nbsp;<em>Staphylococcus aureus</em>&nbsp;genomes. Using what we learned from Staphopia and user feedback, Bactopia was developed from scratch with usability, portability, and speed in mind from the start.</p>
<p>Bactopia uses&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>&nbsp;to manage the workflow, allowing for support of many types of environments (e.g. cluster or cloud). Bactopia allows for the usage of many public datasets as well as your own datasets to further enhance the analysis of your sequencing. Bactopia only uses software packages available from&nbsp;<a href="https://bioconda.github.io/">Bioconda</a>&nbsp;and&nbsp;<a href="https://conda-forge.org/">Conda-Forge</a>&nbsp;to make installation as simple as possible for&nbsp;<em>all</em>&nbsp;users.</p>
<p>To highlight the use of&nbsp;<a href="https://bactopia.github.io/latest/full-guide/">Bactopia</a>&nbsp;and&nbsp;<a href="https://bactopia.github.io/latest/bactopia-tools/">Bactopia Tools</a>, we performed an analysis of 1,664 public&nbsp;<em>Lactobacillus</em>&nbsp;genomes, focusing on&nbsp;<em>Lactobacillus crispatus</em>, a species that is a common part of the human vaginal microbiome. The results from this analysis are published in mSystems under the title:&nbsp;<em><a href="https://doi.org/10.1128/mSystems.00190-20">Bactopia: a flexible pipeline for complete analysis of bacterial genomes</a></em></p>
<p><a href="https://bactopia.github.io/latest/assets/bactopia-workflow.png"><img src="https://bactopia.github.io/latest/assets/bactopia-workflow.png" alt="Bactopia Workflow" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://bactopia.github.io/latest/" rel="nofollow">https://bactopia.github.io/latest/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27113/picard</guid>
	<pubDate>Fri, 29 Apr 2016 08:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27113/picard</link>
	<title><![CDATA[Picard]]></title>
	<description><![CDATA[<p>Picard is a set of command line tools for manipulating high-throughput sequencing (HTS) data and formats such as SAM/BAM/CRAM and VCF. These file formats are defined in the <a href="http://samtools.github.io/hts-specs/">Hts-specs</a> repository. See especially the <a href="http://samtools.github.io/hts-specs/SAMv1.pdf">SAM specification</a> and the <a href="http://samtools.github.io/hts-specs/VCFv4.3.pdf">VCF specification</a>.</p>
<p>Note that the information on this page is targeted at end-users. For developers, the source code, building instructions and implementation/development resources are available on <a href="https://github.com/broadinstitute/picard">GitHub</a>.</p>
<p>The Picard toolkit is open-source under the <a href="https://tldrlegal.com/license/mit-license">MIT license</a> and free for all uses.</p>
<p>Enjoy!</p><p>Address of the bookmark: <a href="http://broadinstitute.github.io/picard/" rel="nofollow">http://broadinstitute.github.io/picard/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</guid>
	<pubDate>Sun, 26 Mar 2017 15:41:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</link>
	<title><![CDATA[gbtools: Interactive Visualization of Metagenome Bins in R]]></title>
	<description><![CDATA[<p><span>We have developed gbtools, a software package that allows users to visualize metagenomic assemblies by plotting coverage (sequencing depth) and GC values of contigs, and also to annotate the plots with taxonomic information. Different sets of annotations, including taxonomic assignments from conserved marker genes or SSU rRNA genes, can be imported simultaneously; users can choose which annotations to plot. Bins can be manually defined from plots, or be imported from third-party binning tools and overlaid onto plots, such that results from different methods can be compared side-by-side. gbtools reports summary statistics of bins including marker gene completeness, and allows the user to add or subtract bins with each other.&nbsp;</span></p>
<p><span>Tool at&nbsp;https://github.com/kbseah/genome-bin-tools</span></p><p>Address of the bookmark: <a href="http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full" rel="nofollow">http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38581/cvit-chromosome-viewing-tool</guid>
	<pubDate>Wed, 02 Jan 2019 04:10:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38581/cvit-chromosome-viewing-tool</link>
	<title><![CDATA[CViT: Chromosome Viewing Tool]]></title>
	<description><![CDATA[<p><span>CViT - Chromosome Viewing Tool. A collection of Perl scripts that enable quick visualizations of features on linkage groups, psuedochromosomes or cytogenetic maps. Intended for whole-genome views of data but can be used to create images of single chromosomes/linkage groups, contigs, or BACs, or even proteins -- any feature that has a location on a backbone. Handles most standard genetic/genomic coordinate systems. Reads GFF3 data and produces a PNG or SVG image.</span></p>
<p><span>https://www.hindawi.com/journals/ijpg/2011/373875/</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/cvit/" rel="nofollow">https://sourceforge.net/projects/cvit/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>