<?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/37672?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/37672?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</guid>
	<pubDate>Tue, 20 Aug 2019 09:47:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</link>
	<title><![CDATA[TRITEX sequence assembly pipeline for Triticeae genomes]]></title>
	<description><![CDATA[<div>
<p>The pipeline is open-source and hosted in a public Bitbucket&nbsp;<a href="https://bitbucket.org/tritexassembly/tritexassembly.bitbucket.io/src/master/">repository</a>.</p>
</div>
<div>
<p>TRITEX has been run on highly inbred genotypes of barley (<em>Hordeum vulgare</em>), tetraploid wheat (<em>Triticum turgidum</em>) and hexaploid wheat (<em>T. aestivum</em>) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.</p>
</div>
<div>
<p>A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in&nbsp;<a href="https://bio-protocol.org/e2955">Himmelbach et al. 2018</a>. Refer to the&nbsp;<a href="https://www.10xgenomics.com/resources/technical-notes/">technical notes</a>&nbsp;of 10X Genomics on how to generate Chromium data.</p>
</div><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>Jit</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/40814/accesssyri-finding-genomic-rearrangements-and-local-sequence-differences-from-whole-genome-assemblies</guid>
	<pubDate>Sat, 01 Feb 2020 13:38:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40814/accesssyri-finding-genomic-rearrangements-and-local-sequence-differences-from-whole-genome-assemblies</link>
	<title><![CDATA[AccessSyRI: finding genomic rearrangements and local sequence differences from whole-genome assemblies]]></title>
	<description><![CDATA[<p><span>Access</span><span>SyRI: finding genomic rearrangements and</span><span>local sequence differences from whole-</span><span>genome assemblies</span><span><br></span></p>
<p><span><span>SyRI, a pairwise whole-genome comparison tool for chromosome-level assemblies. SyRI starts by finding rearranged regions and then searches for differences in the sequences, which are distinguished for residing in syntenic or rearranged regions. This distinction is important as rearranged regions are inherited differently compared to syntenic regions.</span></span></p>
<p><span><a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-019-1911-0">https://genomebiology.biomedcentral.com/articles/10.1186/s13059-019-1911-0</a></span></p><p>Address of the bookmark: <a href="https://github.com/schneebergerlab/syri" rel="nofollow">https://github.com/schneebergerlab/syri</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/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Wed, 06 Oct 2021 07:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide 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.</span></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>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</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/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</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/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</guid>
	<pubDate>Wed, 15 Jun 2016 17:18:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</link>
	<title><![CDATA[LoRMA: a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines]]></title>
	<description><![CDATA[<p>LoRMA is a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines.</p>
<p>Publication:</p>
<ul>
<li>L. Salmela, R. Walve, E. Rivals, and E. Ukkonen: Accurate selfcorrection of errors in long reads using de Bruijn graphs. Accepted to RECOMB-Seq 2016.</li>
</ul>
<p>Download:</p>
<ul>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/LoRMA-0.3.tar.gz">LoRMA 0.3 source files</a></li>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/README.txt">README</a></li>
</ul><p>Address of the bookmark: <a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/" rel="nofollow">https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>