<?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/41452?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/41452?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36918/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</guid>
	<pubDate>Tue, 12 Jun 2018 08:14:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36918/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</link>
	<title><![CDATA[P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads]]></title>
	<description><![CDATA[P_RNA_scaffolder, a fast and accurate tool using paired-end RNA-sequencing reads to scaffold genomes. This tool aims to improve the completeness of both protein-coding and non-coding genes. After this tool was applied to scaffolding human contigs, the structures of both protein-coding genes and circular RNAs were almost completely recovered and equivalent to those in a complete genome, especially for long proteins and long circular RNAs.<p>Address of the bookmark: <a href="http://www.fishbrowser.org/software/P_RNA_scaffolder/" rel="nofollow">http://www.fishbrowser.org/software/P_RNA_scaffolder/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</guid>
	<pubDate>Sat, 15 Feb 2020 01:49:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</link>
	<title><![CDATA[CLARK: Fast, accurate and versatile sequence classification system]]></title>
	<description><![CDATA[<p><span></span><a href="http://dx.doi.org/10.1186/s12864-015-1419-2"><strong>CLARK</strong></a><span>, a method based on a supervised sequence classification using discriminative&nbsp;</span><em>k</em><span>-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to known bacterial genomes, and (2) the assignment of BAC clones and transcript to chromosome arms/centromeres (in the absence of a finished assembly for the reference genome), CLARK outperforms in classification speed and precision the best state-of-the-art methods.</span></p>
<p><span><a href="http://clark.cs.ucr.edu/Spaced/">http://clark.cs.ucr.edu/Spaced/</a></span></p><p>Address of the bookmark: <a href="http://clark.cs.ucr.edu/Spaced/" rel="nofollow">http://clark.cs.ucr.edu/Spaced/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42413/liftoff-an-accurate-gff3gtf-lift-over-pipeline</guid>
	<pubDate>Sun, 20 Dec 2020 01:36:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42413/liftoff-an-accurate-gff3gtf-lift-over-pipeline</link>
	<title><![CDATA[Liftoff: An accurate GFF3/GTF lift over pipeline]]></title>
	<description><![CDATA[<p><span>Liftoff is a tool that accurately maps annotations in GFF or GTF between assemblies of the same, or closely-related species. Unlike current coordinate lift-over tools which require a pre-generated &ldquo;chain&rdquo; file as input, Liftoff is a standalone tool that takes two genome assemblies and a reference annotation as input and outputs an annotation of the target genome.</span></p><p>Address of the bookmark: <a href="https://github.com/agshumate/Liftoff" rel="nofollow">https://github.com/agshumate/Liftoff</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</guid>
	<pubDate>Tue, 13 Aug 2024 07:16:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</link>
	<title><![CDATA[HELIANO: A fast and accurate tool for detection of Helitron-like elements]]></title>
	<description><![CDATA[<p><span>Helitron-like elements (HLE1 and HLE2) are DNA transposons. They have been found in diverse species and seem to play significant roles in the evolution of host genomes. Although known for over twenty years, Helitron sequences are still challenging to identify. Here, we propose HELIANO (Helitron-like elements annotator) as an efficient solution for detecting Helitron-like elements.</span></p>
<p>https://academic.oup.com/nar/advance-article/doi/10.1093/nar/gkae679/7730539?login=true</p><p>Address of the bookmark: <a href="https://github.com/Zhenlisme/heliano/" rel="nofollow">https://github.com/Zhenlisme/heliano/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</guid>
	<pubDate>Tue, 14 Nov 2017 09:30:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</link>
	<title><![CDATA[OrthoGNC: A Software for Accurate Identification of Orthologs Based on Gene Neighborhood Conservation]]></title>
	<description><![CDATA[<div>
<p id="sp0005">Orthology relations can be used to transfer annotations from one gene (or protein) to another. Hence, detecting orthology relations has become an important task in the post-genomic era. Various genomic events, such as duplication and horizontal gene transfer, can cause erroneous assignment of orthology relations. In closely-related species, gene neighborhood information can be used to resolve many ambiguities in orthology inference. Here we present OrthoGNC, a software for accurately predicting pairwise orthology relations based on gene neighborhood conservation. Analyses on simulated and real data reveal the high accuracy of OrthoGNC. In addition to orthology detection, OrthoGNC can be employed to investigate the conservation of genomic context among potential orthologs detected by other methods. OrthoGNC is freely available online at http://bs.ipm.ir/softwares/orthognc and http://tinyurl.com/orthoGNC.</p>
<p>http://www.comp.nus.edu.sg/~wongls/projects/orthoGNC/</p>
</div><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S1672022917301663" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S1672022917301663</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/44515/cleaner-blast-databases-for-more-accurate-results</guid>
	<pubDate>Tue, 23 Apr 2024 01:23:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44515/cleaner-blast-databases-for-more-accurate-results</link>
	<title><![CDATA[Cleaner BLAST Databases for More Accurate Results]]></title>
	<description><![CDATA[<p>Do you use&nbsp;<a href="https://blast.ncbi.nlm.nih.gov/Blast.cgi?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=blast-cleaner-20240422">BLAST</a><span style="font-size: 12.8px; font-weight: normal;">&nbsp;to identify a sequence or the evolutionary scope of a gene? That can be challenging if contaminated and misclassified sequences are in the BLAST databases and show up in your search results. To address</span><span style="font-size: 12.8px; font-weight: normal;">&nbsp;this problem</span><span style="font-size: 12.8px; font-weight: normal;">, we now use the NCBI quality assurance tools listed below to systematically remove these misleading sequences from the default nucleotide (nt) and protein (nr) BLAST databases.</span><span style="font-size: 12.8px; font-weight: normal;">&nbsp;</span></p><div><ul>
<li><a href="https://github.com/ncbi/fcs">Foreign Contamination Screen tool for genome cross-species screening (FCS-GX)</a>&nbsp;detects contamination from foreign organisms in genomes and other sequences using the genome cross-species aligner (GX)&nbsp;</li>
<li><a href="https://ncbiinsights.ncbi.nlm.nih.gov/2022/05/27/ani-for-assembly-validation?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=blast-cleaner-20240422">Average Nucleotide Identity (ANI)</a>&nbsp;evaluates the taxonomic classification of prokaryotic genome assemblies. Sequences from genomes marked up as &lsquo;unverified source organism&rsquo; are considered suspect and removed.&nbsp;</li>
</ul><p>Ref&nbsp;https://ncbiinsights.ncbi.nlm.nih.gov/2024/04/22/cleaner-blast-databases-more-accurate-results/</p></div>]]></description>
	<dc:creator>LEGE</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/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</guid>
	<pubDate>Thu, 28 Aug 2025 02:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</link>
	<title><![CDATA[AlfaPang: alignment free algorithm for pangenome graph construction]]></title>
	<description><![CDATA[<p><span>AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input sequences, enabling it to handle significantly larger genome sets compared to other methods.</span></p><p>Address of the bookmark: <a href="https://github.com/AdamCicherski/AlfaPang" rel="nofollow">https://github.com/AdamCicherski/AlfaPang</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>