<?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/42310?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/42310?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40208/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Sun, 27 Oct 2019 00:57:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40208/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Misassembly-Correction">Misassembly correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</guid>
	<pubDate>Thu, 22 Mar 2018 10:40:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36026/mmseqs20-ultra-fast-and-sensitive-protein-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2.0: ultra fast and sensitive protein search and clustering suite]]></title>
	<description><![CDATA[<p>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</p>
<p>The MMseqs2 user guide is available as&nbsp;<a href="https://github.com/soedinglab/mmseqs2/wiki">Github Wiki</a>&nbsp;or as&nbsp;<a href="https://mmseqs.com/latest/userguide.pdf">PDF file</a>&nbsp;(Thanks to&nbsp;<a href="https://github.com/jgm/pandoc">pandoc</a>!)</p>
<p>Please cite:&nbsp;<a href="https://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3988.html">Steinegger M and Soeding J. MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets. Nature Biotechnology, doi: 10.1038/nbt.3988 (2017)</a>.</p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</guid>
	<pubDate>Thu, 02 Aug 2018 07:39:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</link>
	<title><![CDATA[LSC :a long read error correction tool]]></title>
	<description><![CDATA[<h2>Getting Started</h2>
<p>These simple steps will help you integrate LSC into your transcriptomics analysis pipeline.</p>
<ul>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_requirements.asp">LSC_requirements</a>&nbsp;for running LSC.</li>
<li><a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_download.asp">Download</a>&nbsp;and set-up the LSC package.</li>
<li>Follow the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_tutorial.asp">tutorial</a>&nbsp;to see how LSC works on some example data.</li>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_manual.asp">manual</a>&nbsp;if anything is unclear.</li>
<li>You're ready, Happy LSCing!</li>
</ul>
<h2>Latest publication</h2>
<p><span>Kin Fai Au, Jason Underwood, Lawrence Lee and Wing Hung Wong&nbsp;</span><br><strong>Improving PacBio Long Read Accuracy by Short Read Alignment&nbsp;</strong><span>[</span><a href="http://journals.plos.org/plosone/article?id=10.1371%2Fjournal.pone.0046679">Manuscript</a><span>]&nbsp;</span><br><em>PLoS ONE</em><span>&nbsp;2012. 7(10): e46679. doi:10.1371/journal.pone.0046679</span></p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37937/frodock-20-fast-protein%E2%80%93protein-docking-server</guid>
	<pubDate>Wed, 17 Oct 2018 04:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37937/frodock-20-fast-protein%E2%80%93protein-docking-server</link>
	<title><![CDATA[FRODOCK 2.0: fast protein–protein docking server]]></title>
	<description><![CDATA[<p><span>frodock: a&nbsp;user-friendly protein&ndash;protein docking server based on an improved version of FRODOCK that includes a complementary knowledge-based potential. The web interface provides a very effective tool to explore and select protein&ndash;protein models and interactively screen them against experimental distance constraints. The competitive success rates and efficiency achieved allow the retrieval of reliable potential protein&ndash;protein binding conformations that can be further refined with more computationally demanding strategies.</span></p><p>Address of the bookmark: <a href="http://frodock.chaconlab.org/" rel="nofollow">http://frodock.chaconlab.org/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41959/rna-bloom-a-fast-and-memory-efficient-de-novo-transcript-sequence-assembler</guid>
	<pubDate>Thu, 09 Jul 2020 03:13:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41959/rna-bloom-a-fast-and-memory-efficient-de-novo-transcript-sequence-assembler</link>
	<title><![CDATA[RNA-Bloom: a fast and memory-efficient de novo transcript sequence assembler]]></title>
	<description><![CDATA[<p><strong>RNA-Bloom</strong><span>&nbsp;</span>is a fast and memory-efficient<span>&nbsp;</span><em>de novo</em><span>&nbsp;</span>transcript sequence assembler. It is designed for the following sequencing data types:</p>
<ul>
<li>single-end/paired-end bulk RNA-seq (strand-specific/agnostic)</li>
<li>paired-end single-cell RNA-seq (strand-specific/agnostic)</li>
<li>nanopore RNA-seq (PCR cDNA/direct cDNA/direct RNA)</li>
</ul>
<p>Written by<span>&nbsp;</span><a>Ka Ming Nip</a><span>&nbsp;</span>✉️</p><p>Address of the bookmark: <a href="https://github.com/bcgsc/RNA-Bloom" rel="nofollow">https://github.com/bcgsc/RNA-Bloom</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43639/fastv-detect-virus</guid>
	<pubDate>Sat, 11 Dec 2021 08:04:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43639/fastv-detect-virus</link>
	<title><![CDATA[fastv - detect virus]]></title>
	<description><![CDATA[<p><span>fastv is an ultra-fast tool for identification of SARS-CoV-2 and other microbes from sequencing data. It detects microbial sequences from FASTQ data, generates JSON reports and visualizes the result in HTML reports. This tool can be used to detect viral infectious diseases, like COVID-19. This tool supports both short reads (Illumina, BGI, etc.) and long reads (ONT, PacBio, etc.)</span></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/fastv" rel="nofollow">https://github.com/OpenGene/fastv</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39019/iq-tree-efficient-software-for-phylogenomic-inference</guid>
	<pubDate>Mon, 18 Feb 2019 04:25:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39019/iq-tree-efficient-software-for-phylogenomic-inference</link>
	<title><![CDATA[IQ-TREE: Efficient software for phylogenomic inference]]></title>
	<description><![CDATA[<p><span>A fast and effective stochastic algorithm to infer phylogenetic trees by maximum likelihood.&nbsp;</span><em>IQ-TREE compares favorably to RAxML and PhyML</em><span>&nbsp;in terms of likelihoods with similar computing time</span></p>
<p><span><span>IQ-TREE found higher likelihoods between 62.2% and 87.1% of the studied alignments, thus efficiently exploring the tree-space. If we use the IQ-TREE stopping rule, RAxML and PhyML are faster in 75.7% and 47.1% of the DNA alignments and 42.2% and 100% of the protein alignments, respectively. However, the range of obtaining higher likelihoods with IQ-TREE improves to 73.3&ndash;97.1%. IQ-TREE is freely available at&nbsp;</span><a href="http://www.cibiv.at/software/iqtree" target="">http://www.cibiv.at/software/iqtree</a></span></p><p>Address of the bookmark: <a href="http://www.iqtree.org/" rel="nofollow">http://www.iqtree.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34925/rectangle-graph-for-repeat-resolution-in-genome-assembly</guid>
	<pubDate>Thu, 28 Dec 2017 09:43:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34925/rectangle-graph-for-repeat-resolution-in-genome-assembly</link>
	<title><![CDATA[Rectangle Graph for Repeat Resolution in Genome Assembly]]></title>
	<description><![CDATA[<p>Ultimate tool for resolving repeats in genome assemblies.</p>
<p>Though the specific implementation of the idea of the rectangle graph approach is already included into the&nbsp;<a href="http://bioinf.spbau.ru/spades">current SPAdes distribution</a>, we're also releasing the Rectangle Graph Module (RGM) as the separate code which can be run independently of SPAdes. Although RGM differs from the current implementation of the rectangle graph approach in SPAdes, in the future we plan to integrate RGM in SPAdes. RGM can be run with other genome assemblers if they use the graph format as SPAdes files.</p>
<p>For more details see: Nikolay Vyahhi, Son K. Pham, Pavel Pevzner.&nbsp;<a href="http://www.springerlink.com/content/e617788h25u36440/">From de Bruijn Graphs to Rectangle Graphs for Genome Assembly</a>,&nbsp;<em>Lecture Notes in Bioinformatics</em>&nbsp;7534 (2012), pp. 249-261.</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/en/rectangles" rel="nofollow">http://bioinf.spbau.ru/en/rectangles</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>