<?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/43254?offset=360</link>
	<atom:link href="https://bioinformaticsonline.com/related/43254?offset=360" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39104/hipstr-haplotype-inference-and-phasing-for-short-tandem-repeats</guid>
	<pubDate>Thu, 07 Mar 2019 21:13:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39104/hipstr-haplotype-inference-and-phasing-for-short-tandem-repeats</link>
	<title><![CDATA[HipSTR: Haplotype inference and phasing for Short Tandem Repeats]]></title>
	<description><![CDATA[<p><span>HipSTR</span>&nbsp;was specifically developed to deal with these errors in the hopes of obtaining more robust STR genotypes. In particular, it accomplishes this by:</p>
<ol>
<li>Learning locus-specific PCR stutter models using an&nbsp;<a href="http://en.wikipedia.org/wiki/Expectation-maximization_algorithm">EM algorithm</a></li>
<li>Mining candidate STR alleles from population-scale sequencing data</li>
<li>Employing a specialized hidden Markov model to align reads to candidate alleles while accounting for STR artifacts</li>
<li>Utilizing phased SNP haplotypes to genotype and phase STRs</li>
</ol><p>Address of the bookmark: <a href="https://github.com/tfwillems/HipSTR" rel="nofollow">https://github.com/tfwillems/HipSTR</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27311/release-notes-for-genome-workbench-2105</guid>
	<pubDate>Thu, 12 May 2016 13:49:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27311/release-notes-for-genome-workbench-2105</link>
	<title><![CDATA[Release Notes for Genome Workbench 2.10.5]]></title>
	<description><![CDATA[<p>New Features in latest release</p><ul>
<li>New ProSplign tool integrated with Genome Workbench (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial13">Tutorial</a>,&nbsp;<a href="https://www.youtube.com/watch?v=V9UqKJprzAg&amp;feature=youtu.be" target="_blank">Video</a>)</li>
<li>New export function for BAM/cSRA coverage graphs (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial14">Tutorial</a>)</li>
<li>New export function for alignments GFF3 format ((<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial15">Tutorial</a>))</li>
<li>Tree View: implemented new export mode based on selections (tutorial coming)</li>
<li>Tree View: added support for&nbsp;<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial3/#distance_based_circular_trees">distance based circular trees</a></li>
<li>Tree View: new rooting mode (Midpoint Root) results in more balanced trees (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial3#reroot_tree">Tutorial</a>)</li>
<li>Tree View: added possibility to right-click on an edge between two nodes and "Place Root at Middle of Branch" &ndash; to re-root at mid-branch (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial3#reroot_tree">Tutorial</a>)</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27432/gkno</guid>
	<pubDate>Fri, 20 May 2016 18:56:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27432/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>http://gkno.me/how-to/install.html</span></p>
<p><span>http://gkno.me/software.html</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30375/mauve-a-system-for-constructing-multiple-genome-alignments-in-the-presence-of-large-scale-evolutionary-events-such-as-rearrangement-and-inversion</guid>
	<pubDate>Sat, 24 Dec 2016 09:20:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30375/mauve-a-system-for-constructing-multiple-genome-alignments-in-the-presence-of-large-scale-evolutionary-events-such-as-rearrangement-and-inversion</link>
	<title><![CDATA[Mauve: a system for constructing multiple genome alignments in the presence of large-scale evolutionary events such as rearrangement and inversion]]></title>
	<description><![CDATA[<p>Mauve is a system for constructing multiple genome alignments in the presence of large-scale evolutionary events such as rearrangement and inversion. Multiple genome alignments provide a basis for research into comparative genomics and the study of genome-wide evolutionary dynamics.</p>
<p>Mauve has been developed with the idea that a multiple genome aligner should require only modest computational resources. It employs algorithmic techniques that scale well in the lengths of sequences being aligned. For example, a pair of&nbsp;<em>Y. pestis</em>&nbsp;genomes can be aligned in under a minute, while a group of 9 divergent Enterobacterial genomes can be aligned in a few hours. However, the current algorithm&rsquo;s compute time (progressiveMauve) scales cubically in the number of genomes to align, making it unsuitable for datasets containing more than 50-100 bacterial genomes.</p><p>Address of the bookmark: <a href="http://darlinglab.org/mauve/mauve.html" rel="nofollow">http://darlinglab.org/mauve/mauve.html</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/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</guid>
	<pubDate>Tue, 27 Nov 2018 04:43:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</link>
	<title><![CDATA[lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data]]></title>
	<description><![CDATA[<p><span>lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.</span></p>
<p>lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/lordfast" rel="nofollow">https://github.com/vpc-ccg/lordfast</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42204/g-nest-the-gene-neighborhood-scoring-tool</guid>
	<pubDate>Fri, 25 Sep 2020 20:09:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42204/g-nest-the-gene-neighborhood-scoring-tool</link>
	<title><![CDATA[G-NEST: The Gene NEighborhood Scoring Tool]]></title>
	<description><![CDATA[<p><span>The Gene NEighborhood Scoring Tool (G-NEST) combines genomic location, gene expression, and evolutionary sequence conservation data to score putative gene neighborhoods across all window sizes. Primary author of final code = William F. Martin. Example data files are in the separate repository.</span></p><p>Address of the bookmark: <a href="https://github.com/dglemay/G-NEST" rel="nofollow">https://github.com/dglemay/G-NEST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44659/figeno-tool-for-plotting-sequencing-data-along-genomic-coordinates</guid>
	<pubDate>Tue, 17 Sep 2024 02:28:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44659/figeno-tool-for-plotting-sequencing-data-along-genomic-coordinates</link>
	<title><![CDATA[Figeno: Tool for plotting sequencing data along genomic coordinates.]]></title>
	<description><![CDATA[<p><span>Tool for plotting sequencing data along genomic coordinates.</span></p>
<div>
<pre><code>FIGENO is a
  FIGure
    GENerator
for GENOmics</code></pre>
</div>
<p dir="auto">With figeno, you can plot various types of sequencing data along genomic coordinates. Video overview:&nbsp;<a href="https://www.youtube.com/watch?v=h1cBeXoSYTA">https://www.youtube.com/watch?v=h1cBeXoSYTA</a>.</p>
<p dir="auto"><a href="https://github.com/CompEpigen/figeno/blob/main/docs/content/images/figeno.png" target="_blank"><img src="https://github.com/CompEpigen/figeno/raw/main/docs/content/images/figeno.png" alt="figeno" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/CompEpigen/figeno" rel="nofollow">https://github.com/CompEpigen/figeno</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>