<?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/38501?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/38501?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/44414/reconplot-an-r-package-for-the-visualization-and-interpretation-of-genomic-rearrangements</guid>
	<pubDate>Thu, 14 Dec 2023 12:33:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44414/reconplot-an-r-package-for-the-visualization-and-interpretation-of-genomic-rearrangements</link>
	<title><![CDATA[ReConPlot: an R package for the visualization and interpretation of genomic rearrangements]]></title>
	<description><![CDATA[<p>ReConPlot (REarrangement and COpy Number PLOT), an R package that provides functionalities for the joint visualization of SCNAs and SVs across one or multiple chromosomes. ReConPlot is based on the popular ggplot2 package, thus allowing customization of plots and the generation of publication-quality figures with minimal effort.</p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/39/12/btad719/7460198?login=false" rel="nofollow">https://academic.oup.com/bioinformatics/article/39/12/btad719/7460198?login=false</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44876/dna2bit-an-ultra-fast-and-accurate-genomic-distance-estimation-software</guid>
	<pubDate>Wed, 13 Aug 2025 19:56:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44876/dna2bit-an-ultra-fast-and-accurate-genomic-distance-estimation-software</link>
	<title><![CDATA[dna2bit: an ultra-fast and accurate genomic distance estimation software]]></title>
	<description><![CDATA[<p dir="auto">dna2bit: an ultra-fast and accurate genomic distance estimation software</p>
<div dir="auto"><a href="https://github.com/lijuzeng/dna2bit#compilation"></a></div>
<p dir="auto">dna2bit is a software tool developed in C++11, leveraging the capabilities of OpenMP for parallel computing and the popcount technique for efficient bit manipulation.&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/lijuzeng/dna2bit" rel="nofollow">https://github.com/lijuzeng/dna2bit</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34404/sima-c-implementation-simultaneous-multiple-alignment-of-lcms-peak-lists</guid>
	<pubDate>Thu, 23 Nov 2017 17:15:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34404/sima-c-implementation-simultaneous-multiple-alignment-of-lcms-peak-lists</link>
	<title><![CDATA[SIMA C++ Implementation: Simultaneous Multiple Alignment of LC/MS Peak Lists]]></title>
	<description><![CDATA[<p style="text-align: justify;">This is the c++ implementation for SIMA - Simultaneous Multiple Alignment of LC/MS Peak Lists. The package contains C++ source code as well as two binary files. The latter were tested under various operating systems, including Windows XP SP3 32bit, Windows Vista 32bit, Windows 2008 Server, Windows 7 32bit and 64bit, Ubuntu 10.04 64bit, Ubuntu 10.10 64bit, and gentoo AMD64.</p>
<p style="text-align: justify;">The corresponding publication can be found here:</p>
<p style="text-align: justify;">B. Voss*, M. Hanselmann*, B.Y. Renard, M.S. Lindner, U. K&ouml;the, M. Kirchner, F.A. Hamprecht (2011). SIMA: Simultaneous Muliple Alignment of LC/MS Peak Lists, Bioinformatics 27(7):987-993.&nbsp;<a href="http://dx.doi.org/10.1093/bioinformatics/btr051">[doi]</a>&nbsp;<a href="https://hciweb.iwr.uni-heidelberg.de/sites/default/files/node/files/517307327/hanselmann_11_sima.pdf">[techreport]</a></p><p>Address of the bookmark: <a href="https://hciweb.iwr.uni-heidelberg.de/hci/softwares/sima" rel="nofollow">https://hciweb.iwr.uni-heidelberg.de/hci/softwares/sima</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35885/multi-car-a-tool-of-contig-scaffolding-using-multiple-references</guid>
	<pubDate>Tue, 06 Mar 2018 16:39:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35885/multi-car-a-tool-of-contig-scaffolding-using-multiple-references</link>
	<title><![CDATA[Multi-CAR: a tool of contig scaffolding using multiple references]]></title>
	<description><![CDATA[<p><span>we design a simple heuristic method to further revise our single reference-based scaffolding tool CAR into a new one called Multi-CAR such that it can utilize multiple complete genomes of related organisms as references to more accurately order and orient the contigs of a draft genome. In practical usage, our Multi-CAR does not require prior knowledge concerning phylogenetic relationships among the draft and reference genomes and libraries of paired-end reads. To validate Multi-CAR, we have tested it on a real dataset composed of several prokaryotic genomes and also compared its accuracy performance with other multiple reference-based scaffolding tools Ragout and MeDuSa.&nbsp;</span></p><p>Address of the bookmark: <a href="http://genome.cs.nthu.edu.tw/Multi-CAR/" rel="nofollow">http://genome.cs.nthu.edu.tw/Multi-CAR/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38208/anitools-web-a-web-tool-for-fast-genome-comparison-within-multiple-bacterial-strains</guid>
	<pubDate>Wed, 14 Nov 2018 04:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38208/anitools-web-a-web-tool-for-fast-genome-comparison-within-multiple-bacterial-strains</link>
	<title><![CDATA[ANItools web: a web tool for fast genome comparison within multiple bacterial strains]]></title>
	<description><![CDATA[<p><span>ANItools is a software package written by PERL scripts that can be run in a Linux/Unix system. If you want to compare bacterial genomes and calculate their average nucleotide identity (ANI), you could download and run this program directly. Or you could send us the genome sequence by email. Then we will do the analysis work for you.</span></p>
<p><span>https://academic.oup.com/database/article/doi/10.1093/database/baw084/2630454</span></p><p>Address of the bookmark: <a href="http://ani.mypathogen.cn/" rel="nofollow">http://ani.mypathogen.cn/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41863/ppai-a-web-server-for-predicting-protein-aptamer-interactions</guid>
	<pubDate>Fri, 12 Jun 2020 07:26:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41863/ppai-a-web-server-for-predicting-protein-aptamer-interactions</link>
	<title><![CDATA[PPAI: a web server for predicting protein-aptamer interactions]]></title>
	<description><![CDATA[<p><span>PPAI can query aptamers and proteins, predict aptamers and predict protein-aptamer interactions in batch mode precisely and efficiently, which would be a novel bioinformatics tool for the research of protein-aptamer interactions. PPAI web-server is freely available at&nbsp;</span><a href="http://39.96.85.9/PPAI">http://39.96.85.9/PPAI</a></p><p>Address of the bookmark: <a href="http://39.96.85.9/PPAI/" rel="nofollow">http://39.96.85.9/PPAI/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</guid>
	<pubDate>Tue, 09 Jul 2019 13:35:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</link>
	<title><![CDATA[GffCompare: Program for processing GTF/GFF files]]></title>
	<description><![CDATA[<p>The program gffcompare can be used to compare, merge, annotate and estimate accuracy of one or more GFF files (the &ldquo;query&rdquo; files), when compared with a reference annotation (also provided as GFF).</p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/gffcompare.shtml" rel="nofollow">https://ccb.jhu.edu/software/stringtie/gffcompare.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>