<?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/43439?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/43439?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</guid>
	<pubDate>Fri, 08 Mar 2024 23:36:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</link>
	<title><![CDATA[UniAligner: a parameter-free framework for fast sequence alignment]]></title>
	<description><![CDATA[<p>UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.</p>
<p>More at https://www.nature.com/articles/s41592-023-01970-4</p><p>Address of the bookmark: <a href="https://github.com/seryrzu/unialigner" rel="nofollow">https://github.com/seryrzu/unialigner</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/news/view/44370/ncbiblast-2141-now-available</guid>
	<pubDate>Wed, 30 Aug 2023 02:36:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44370/ncbiblast-2141-now-available</link>
	<title><![CDATA[NCBIBLAST+ 2.14.1 now available]]></title>
	<description><![CDATA[<p><a href="https://www.linkedin.com/feed/hashtag/?keywords=ncbiblast&amp;highlightedUpdateUrns=urn%3Ali%3Aactivity%3A7101231946264924160">#NCBIBLAST</a><span>+ 2.14.1 now available with improved documentation, faster and more reliable database downloads, and some bug fixes.&nbsp;</span></p><p>Check out the changes they made.</p><p>They added the&nbsp;<code><span>cleanup-blastdb-volumes.py</span></code>&nbsp;script to remove unused BLAST database volumes. Read the documentation&nbsp;<a href="https://www.ncbi.nlm.nih.gov/books/NBK592857/">here</a>.</p><p>They also switched the protocol from&nbsp;<code><span>ftp</span></code>&nbsp;to&nbsp;<code><span>https</span></code>&nbsp;to access BLAST databases for increased performance and reliability when downloading data from the NCBI with the&nbsp;<code><span>update_blastdb.pl</span></code>&nbsp;script.</p><p>And fixed a few bugs related to downloading data from the NCBI, and&nbsp;<code><span>mt_mode</span></code>&nbsp;crashing&nbsp;<code><span>blastn</span></code>&nbsp;and&nbsp;<code><span>blastx</span></code>.</p><p>Check out the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/books/NBK131777/">release notes</a>.</p><p>Download&nbsp;<a href="https://ftp.ncbi.nlm.nih.gov/blast/executables/blast+/2.14.1/">BLAST+ 2.14.1</a></p><p>Questions or comments? Please write the&nbsp;<a href="https://support.nlm.nih.gov/support/create-case/">BLAST help desk</a>.</p><p><span><span>More info and download:</span>&nbsp;https://blast.ncbi.nlm.nih.gov/doc/blast-news/2023-BLAST-News.html</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43810/seqfu-a-suite-of-utilities-for-the-robust-and-reproducible-manipulation-of-sequence-files</guid>
	<pubDate>Tue, 01 Mar 2022 03:13:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43810/seqfu-a-suite-of-utilities-for-the-robust-and-reproducible-manipulation-of-sequence-files</link>
	<title><![CDATA[SeqFu: A Suite of Utilities for the Robust and Reproducible Manipulation of Sequence Files]]></title>
	<description><![CDATA[<p>A general-purpose program to manipulate and parse information from FASTA/FASTQ files, supporting gzipped input files. Includes functions to&nbsp;<em>interleave</em>&nbsp;and&nbsp;<em>de-interleave</em>&nbsp;FASTQ files, to&nbsp;<em>rename</em>&nbsp;sequences and to&nbsp;<em>count</em>&nbsp;and print&nbsp;<em>statistics</em>&nbsp;on sequence lengths. SeqFu is available for Linux and MacOS.</p>
<ul>
<li>A compiled program delivering high performance analyses</li>
<li>Supports FASTA/FASTQ files, also Gzip compressed</li>
<li>A growing collection of handy utilities, also for quick inspection of the datasets</li>
</ul>
<p>Can be easily&nbsp;<a href="https://telatin.github.io/seqfu2/installation">installed</a>&nbsp;via conda:</p>
<div>
<div>
<pre><code>conda <span>install</span> <span>-c</span> bioconda seqfu</code></pre>
</div>
</div><p>Address of the bookmark: <a href="https://telatin.github.io/seqfu2/" rel="nofollow">https://telatin.github.io/seqfu2/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/1178/r-package-for-visualising-go-enrichment</guid>
	<pubDate>Mon, 22 Jul 2013 12:25:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/1178/r-package-for-visualising-go-enrichment</link>
	<title><![CDATA[R package for visualising GO enrichment]]></title>
	<description><![CDATA[<p>An R package that visualizes the GO enrichment results as word clouds and arranges them together with figures of experimental data. This allows us to draw informative summary plots for analyses such as differential expression or clustering, where for each gene list we display its behaviour in the experiment alongside with its GO annotations.</p><p>Links @ http://raivokolde.github.io/GOsummaries/</p><p>Lab @ http://biit.cs.ut.ee/about/main</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38452/silix-implements-an-ultra-efficient-algorithm-for-the-clustering-of-homologous-sequences</guid>
	<pubDate>Wed, 12 Dec 2018 09:22:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38452/silix-implements-an-ultra-efficient-algorithm-for-the-clustering-of-homologous-sequences</link>
	<title><![CDATA[SiLiX: implements an ultra-efficient algorithm for the clustering of homologous sequences]]></title>
	<description><![CDATA[<p>The software package SiLiX implements<strong>&nbsp;an ultra-efficient algorithm for the clustering of homologous sequences</strong>, based on single transitive links (<em>single linkage</em>) with alignment coverage constraints.</p>
<p>SiLiX adopts a graph-theoretical framework to interpret similarity pairs as edges of a network. A very efficient algorithm, based on the&nbsp;<em>Disjoint Sets Data Structure</em>, allows the computation of sequence families with&nbsp;<strong>low time and space requirements</strong>.</p>
<p><strong>A parallel version</strong>&nbsp;of SiLiX, based on MPI, is also available in this package and has been proved to be scalable, so that its allows the study of&nbsp;<strong>very large datasets</strong>.</p>
<p>SiLiX is already included in the analysis pipeline for&nbsp;<a href="http://pbil.univ-lyon1.fr/databases/hogenom/acceuil.php">HOGENOM</a>.</p><p>Address of the bookmark: <a href="http://lbbe.univ-lyon1.fr/SiLiX?lang=fr" rel="nofollow">http://lbbe.univ-lyon1.fr/SiLiX?lang=fr</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/37302/fastani-fast-alignment-free-computation-of-whole-genome-average-nucleotide-identity-ani</guid>
	<pubDate>Fri, 13 Jul 2018 17:27:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37302/fastani-fast-alignment-free-computation-of-whole-genome-average-nucleotide-identity-ani</link>
	<title><![CDATA[FastANI:  fast alignment-free computation of whole-genome Average Nucleotide Identity (ANI)]]></title>
	<description><![CDATA[<p><span>FastANI is developed for fast alignment-free computation of whole-genome Average Nucleotide Identity (ANI). ANI is defined as mean nucleotide identity of orthologous gene pairs shared between two microbial genomes. FastANI supports pairwise comparison of both complete and draft genome assemblies. Its underlying procedure follows a similar workflow as described by&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/17220447">Goris et al. 2007</a><span>. However, it avoids expensive sequence alignments and uses&nbsp;</span><a href="https://github.com/marbl/MashMap">Mashmap</a><span>&nbsp;as its MinHash based sequence mapping engine to compute the orthologous mappings and alignment identity estimates. Based on our experiments with complete and draft genomes, its accuracy is on par with&nbsp;</span><a href="http://enve-omics.ce.gatech.edu/ani/">BLAST-based ANI solver</a><span>&nbsp;and it achieves two to three orders of magnitude speedup. Therefore, it is useful for pairwise ANI computation of large number of genome pairs. More details about its speed, accuracy and potential applications are described here: "</span><a href="https://doi.org/10.1101/225342">High-throughput ANI Analysis of 90K Prokaryotic Genomes Reveals Clear Species Boundaries</a><span>".</span></p><p>Address of the bookmark: <a href="https://github.com/ParBLiSS/FastANI" rel="nofollow">https://github.com/ParBLiSS/FastANI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37606/stellar-fast-and-exact-local-alignments</guid>
	<pubDate>Wed, 29 Aug 2018 16:00:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37606/stellar-fast-and-exact-local-alignments</link>
	<title><![CDATA[STELLAR: fast and exact local alignments]]></title>
	<description><![CDATA[<p><span>STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X at&nbsp;</span><span><a href="http://www.seqan.de/projects/stellar"><span>http://www.seqan.de/projects/stellar</span></a></span><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.seqan.de/apps/stellar/" rel="nofollow">http://www.seqan.de/apps/stellar/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>