<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=640</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=640" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37602/indexcov-fast-coverage-quality-control-for-whole-genome-sequencing</guid>
	<pubDate>Wed, 29 Aug 2018 09:20:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37602/indexcov-fast-coverage-quality-control-for-whole-genome-sequencing</link>
	<title><![CDATA[Indexcov: fast coverage quality control for whole-genome sequencing]]></title>
	<description><![CDATA[<p><em>indexcov</em><span>, an efficient estimator of whole-genome sequencing coverage to rapidly identify samples with aberrant coverage profiles, reveal large-scale chromosomal anomalies, recognize potential batch effects, and infer the sex of a sample.&nbsp;</span><em>Indexcov</em><span>&nbsp;is available at&nbsp;</span><a href="https://github.com/brentp/goleft" target="_blank">https://github.com/brentp/goleft</a><span>&nbsp;under the MIT license.</span></p><p>Address of the bookmark: <a href="https://github.com/brentp/goleft" rel="nofollow">https://github.com/brentp/goleft</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</guid>
	<pubDate>Fri, 24 Aug 2018 09:50:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</link>
	<title><![CDATA[Mulan: Multiple-sequence local alignment and visualization for studying function and evolution]]></title>
	<description><![CDATA[<p>Mulan: Multiple-sequence local alignment and visualization for studying function and evolution</p>
<p><span>Mulan (</span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/#ref44">http://mulan.dcode.org/</a><span>), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37579/cbs-comparative-microbial-genomics-group-biotools-download-page</guid>
	<pubDate>Wed, 22 Aug 2018 21:59:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37579/cbs-comparative-microbial-genomics-group-biotools-download-page</link>
	<title><![CDATA[CBS Comparative Microbial Genomics group - BioTools download page]]></title>
	<description><![CDATA[<div id="section2">
<p>he CMG-biotools system presents a stand-alone interface for comparative microbial genomics. The package is a customized operating system, based on Xubuntu 10.10, available through the open source Ubuntu project. The system can be installed on a virtual computer, allowing the user to run the system alongside any other operating system. Source codes for all programs are provided under GNU license, which makes it possible to transfer the programs to other systems if so desired. We here demonstrate the package by comparing and analyzing the diversity within the class&nbsp;<em>Negativicutes</em>, represented by 31 genomes including 10 genera. The analyses include 16S rRNA phylogeny, basic DNA and codon statistics, proteome comparisons using BLAST and graphical analyses of DNA structures.</p>
<p>&nbsp;Paper:&nbsp;http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0060120</p>
</div>
<div id="section3"><a name="" title="Conclusion"></a><span></span></div><p>Address of the bookmark: <a href="http://www.cbs.dtu.dk/biotools/CMGtools/" rel="nofollow">http://www.cbs.dtu.dk/biotools/CMGtools/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</guid>
	<pubDate>Wed, 22 Aug 2018 11:05:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</link>
	<title><![CDATA[LRCstats: a tool for evaluating long reads correction methods]]></title>
	<description><![CDATA[<p><span>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.</span></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>Aaryan Lokwani</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/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/37563/colormap-correcting-long-reads-by-mapping-short-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:17:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37563/colormap-correcting-long-reads-by-mapping-short-reads</link>
	<title><![CDATA[CoLoRMap: Correcting Long Reads by Mapping short reads]]></title>
	<description><![CDATA[<p><span>Second generation sequencing technologies paved the way to an exceptional increase in the number of sequenced genomes, both prokaryotic and eukaryotic. However, short reads are difficult to assemble and often lead to highly fragmented assemblies. The recent developments in long reads sequencing methods offer a promising way to address this issue. However, so far long reads are characterized by a high error rate, and assembling from long reads require a high depth of coverage. This motivates the development of hybrid approaches that leverage the high quality of short reads to correct errors in long reads.We introduce CoLoRMap, a hybrid method for correcting noisy long reads, such as the ones produced by PacBio sequencing technology, using high-quality Illumina paired-end reads mapped onto the long reads. Our algorithm is based on two novel ideas: using a classical shortest path algorithm to find a sequence of overlapping short reads that minimizes the edit score to a long read and extending corrected regions by local assembly of unmapped mates of mapped short reads. Our results on bacterial, fungal and insect data sets show that CoLoRMap compares well with existing hybrid correction methods.The source code of CoLoRMap is freely available for non-commercial use at https://github.com/sfu-compbio/colormap</span></p>
<p><span>ehaghshe@sfu.ca or cedric.chauve@sfu.ca</span></p><p>Address of the bookmark: <a href="https://github.com/sfu-compbio/colormap" rel="nofollow">https://github.com/sfu-compbio/colormap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37550/mirem-an-expectation-maximization-approach-for-prioritizing-mirnas-associated-with-gene-set</guid>
	<pubDate>Thu, 16 Aug 2018 04:48:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37550/mirem-an-expectation-maximization-approach-for-prioritizing-mirnas-associated-with-gene-set</link>
	<title><![CDATA[miREM: an expectation-maximization approach for prioritizing miRNAs associated with gene-set]]></title>
	<description><![CDATA[<p>From list of genes... ... to microRNAs</p>
<p>Using established miRNA-interaction databases, miREM combines hypergeometric and expectation-maximization algorithms to sieve through your genetic data for microRNA signatures</p>
<p>https://bioinfo-csi.nus.edu.sg/mirem2/</p><p>Address of the bookmark: <a href="https://bioinfo-csi.nus.edu.sg/mirem2/" rel="nofollow">https://bioinfo-csi.nus.edu.sg/mirem2/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>