<?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/32868?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/32868?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</guid>
	<pubDate>Fri, 02 Nov 2018 08:16:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</link>
	<title><![CDATA[Ancestral Genomes: a resource for reconstructed ancestral genes and genomes across the tree of life]]></title>
	<description><![CDATA[<p><span>&nbsp;Ancestral Genomes (</span><a href="http://ancestralgenomes.org/" target="">http://ancestralgenomes.org</a><span>) is a resource for comprehensive reconstructions of these &lsquo;fossil genomes&rsquo;. Comprehensive sets of protein-coding genes have been reconstructed for 78 genomes of now-extinct species that were the common ancestors of extant species from across the tree of life.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ancestralgenomes.org/" rel="nofollow">http://ancestralgenomes.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</guid>
	<pubDate>Fri, 05 Jan 2018 04:02:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</link>
	<title><![CDATA[ECTOOLS: Long Read Correction and other Correction tools]]></title>
	<description><![CDATA[<p>Long Read Correction and other Correction tools</p>
<p>This package is a loose collection of scripts. To run the correction<br>routine see the section below. Descriptions of the other scripts<br>are at the bottom of this file.</p>
<p>Contact: gurtowsk@cshl.edu</p>
<p>In short, the correction algorithm takes as input the unitigs from a short read assembly and uses them to correct long read data. More background information for the algorithm can be found:<br>http://schatzlab.cshl.edu/presentations/2013-06-18.PBUserMeeting.pdf</p><p>Address of the bookmark: <a href="https://github.com/jgurtowski/ectools" rel="nofollow">https://github.com/jgurtowski/ectools</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37524/fmlrc-a-long-read-error-correction-tool-using-the-multi-string-burrows-wheeler-transform</guid>
	<pubDate>Fri, 10 Aug 2018 13:29:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37524/fmlrc-a-long-read-error-correction-tool-using-the-multi-string-burrows-wheeler-transform</link>
	<title><![CDATA[FMLRC: a long-read error correction tool using the multi-string Burrows Wheeler Transform]]></title>
	<description><![CDATA[<p><span>FMLRC, or FM-index Long Read Corrector, is a tool for performing hybrid correction of long read sequencing using the BWT and FM-index of short-read sequencing data. Given a BWT of the short-read sequencing data, FMLRC will build an FM-index and use that as an implicit de Bruijn graph. Each long read is then corrected independently by identifying low frequency k-mers in the long read and replacing them with the closest matching high frequency k-mers in the implicit de Bruijn graph. In contrast to other de Bruijn graph based implementations, FMLRC is not restricted to a particular k-mer size and instead uses a two pass method with both a short "k-mer" and a longer "K-mer". This allows FMLRC to correct through low complexity regions that are computational difficult for short k-mers.</span></p><p>Address of the bookmark: <a href="https://github.com/holtjma/fmlrc" rel="nofollow">https://github.com/holtjma/fmlrc</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</guid>
	<pubDate>Thu, 24 Jan 2019 10:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</link>
	<title><![CDATA[NxRepair: error correction in de novo assemblies using Nextera Mate Pair Reads]]></title>
	<description><![CDATA[<p>NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file containing both the corrected contigs and the correct, unaffected contigs.</p>
<p>https://nxrepair.readthedocs.io/en/latest/tutorial.html</p>
<div>
<div>
<div id="js-repo-pjax-container">
<div>
<div>
<div id="readme">
<div>
<div>
<pre>nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta</pre>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://github.com/rebeccaroisin/nxrepair" rel="nofollow">https://github.com/rebeccaroisin/nxrepair</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</guid>
	<pubDate>Fri, 05 Jan 2018 04:04:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</link>
	<title><![CDATA[LRCstats: Long Read Correction Statistics]]></title>
	<description><![CDATA[<p>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</p>
<p>Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.</p>
<p>https://www.healthcare.uiowa.edu/labs/au/LSC/</p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</guid>
	<pubDate>Fri, 05 Jan 2018 04:12:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</link>
	<title><![CDATA[proovread : large-scale high-accuracy PacBio correction through iterative short read consensus]]></title>
	<description><![CDATA[<p>proovread : large-scale high-accuracy PacBio correction through iterative short read consensus</p>
<ul>
<li>outperforms PacBioToCA/LSC in terms of accuracy and contiguity/sensitivity (<a href="http://dx.doi.org/10.1093/bioinformatics/btu392">http://dx.doi.org/10.1093/bioinformatics/btu392</a>)</li>
<li>is easy to install/run/configure</li>
<li>supports various types of dat
<ul>
<li><strong>HiSeq/MiSeq&nbsp;</strong>(100-500bp)</li>
<li><strong>Unitigs</strong></li>
<li>454, ...</li>
</ul>
</li>
</ul>
<p>proovread maps high coverage data to pacbio reads (bwa mem, blasr, daligner) in multiple iterations.</p><p>Address of the bookmark: <a href="https://github.com/BioInf-Wuerzburg/proovread" rel="nofollow">https://github.com/BioInf-Wuerzburg/proovread</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Fri, 29 Jun 2018 03:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37205/afterqc-automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[AfterQC: Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data
AfterQC can simply go through all fastq files in a folder and then output three folders: good, bad and QC folders, which contains good reads, bad reads and the QC results of each fastq file/pair.
Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other Illumina 1.8 or newer formats

The author has reimplemented this tool in C++ with multithreading support to make it much faster. The new tool is called fastp and can be found at: https://github.com/OpenGene/fastp . If you prefer a C++ based tool, please use fastp instead.

https://github.com/OpenGene/AfterQC<p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/13522/yannick-wurm-lab</guid>
  <pubDate>Thu, 07 Aug 2014 18:02:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yannick Wurm Lab]]></title>
  <description><![CDATA[
<p>Evolutionary genomics of social insects. Extensive theoretical work has explained how and why complex societies evolve. However, only little is known about the genes and molecular mechanisms responsible for social phenotypes. We have been identifying genes and mechanisms involved in the evolution of insect societies using modern genomics tools (Illumina, RNAseq, RADseq...). For example we recently:</p>

<p>1. sequenced and analyzed the genome of the invasive red fire ant Solenopsis invicta (PNAS 2011)</p>

<p>2. discovered that a fundamental social trait in this species (how many queens are accepted in the colony) is determined by variants of a social chromosome (Nature 2013).</p>

<p>3. described the gene expression changes that occur in a virgin queen when she is given the opportunity of replacing her mother (Mol Ecol 2010).</p>

<p>Homepage: http://yannick.poulet.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</guid>
	<pubDate>Wed, 26 Jul 2017 07:49:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</link>
	<title><![CDATA[GOLD:Genomes Online Database]]></title>
	<description><![CDATA[<p><span>GOLD</span><span>:Genomes Online Database, is a World Wide Web resource for comprehensive access to information regarding genome and metagenome sequencing projects, and their associated metadata, around the world.</span></p>
<p>https://gold.jgi.doe.gov/</p><p>Address of the bookmark: <a href="https://gold.jgi.doe.gov/" rel="nofollow">https://gold.jgi.doe.gov/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>