<?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/42139?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/42139?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</guid>
	<pubDate>Sun, 31 Mar 2024 02:43:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</link>
	<title><![CDATA[Minda: a tool for evaluating structural variant (SV) callers]]></title>
	<description><![CDATA[<p dir="auto">Minda is a tool for evaluating structural variant (SV) callers that</p>
<ul dir="auto">
<li>standardizes VCF records for compatibility with both germline and somatic SV callers,</li>
<li>benchmarks against a single VCF input file, or</li>
<li>benchmarks against an ensemble call set created from multiple VCF input files.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/KolmogorovLab/minda" rel="nofollow">https://github.com/KolmogorovLab/minda</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44661/lovis4u-locus-visualisation-tool-for-comparative-genomics</guid>
	<pubDate>Tue, 17 Sep 2024 02:30:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44661/lovis4u-locus-visualisation-tool-for-comparative-genomics</link>
	<title><![CDATA[LoVis4u: Locus Visualisation tool for comparative genomics]]></title>
	<description><![CDATA[<p dir="auto"><a href="https://github.com/art-egorov/lovis4u/blob/main/docs/img/lovis4u_logo.png" target="_blank"><img src="https://github.com/art-egorov/lovis4u/raw/main/docs/img/lovis4u_logo.png" alt="image" width="300" style="border: 0px; border: 0px;"></a></p>
<div dir="auto">
<h2 dir="auto">Description</h2>
<a href="https://github.com/art-egorov/lovis4u#description"></a></div>
<p dir="auto"><span>LoVis4u</span>&nbsp;is a bioinformatics tool for&nbsp;<span>Lo</span>ci&nbsp;<span>Vis</span>ualisation.</p>
<p dir="auto"><span>LoVis4u, a command-line tool and Python API designed for highly customizable and fast visualisation of multiple genomic loci. LoVis4u generates vector images in PDF format based on annotation data from GenBank or GFF files. It is capable of visualising entire genomes of bacteriophages as well as plasmids and user-defined regions of longer prokaryotic genomes. Additionally, LoVis4u offers optional data processing steps to identify and highlight accessory and core genes in input sequences.</span></p>
<p dir="auto">https://art-egorov.github.io/lovis4u/</p>
<p dir="auto">&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/art-egorov/lovis4u" rel="nofollow">https://github.com/art-egorov/lovis4u</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</guid>
	<pubDate>Fri, 10 Nov 2017 03:58:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</link>
	<title><![CDATA[Unicycler: Hybrid assembly pipeline for bacterial genomes]]></title>
	<description><![CDATA[<p><span>Unicycler is an assembly pipeline for bacterial genomes. It can assemble&nbsp;</span><a href="http://www.illumina.com/">Illumina</a><span>-only read sets where it functions as a&nbsp;</span><a href="http://cab.spbu.ru/software/spades/">SPAdes</a><span>-optimiser. It can also assembly long-read-only sets (</span><a href="http://www.pacb.com/">PacBio</a><span>&nbsp;or&nbsp;</span><a href="https://nanoporetech.com/">Nanopore</a><span>) where it runs a&nbsp;</span><a href="https://github.com/lh3/miniasm">miniasm</a><span>+</span><a href="https://github.com/isovic/racon">Racon</a><span>&nbsp;pipeline. For the best possible assemblies, give it both Illumina reads&nbsp;</span><em>and</em><span>&nbsp;long reads, and it will conduct a hybrid assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/rrwick/Unicycler" rel="nofollow">https://github.com/rrwick/Unicycler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</guid>
	<pubDate>Wed, 13 Aug 2025 02:31:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</link>
	<title><![CDATA[BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data]]></title>
	<description><![CDATA[<p>2,438,386 bacterial genomes at your fingertips consistently processed &amp; characterized, enriched with metadata, accessible via a flexible search engine.</p>
<p>BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data. It integrates enriched genomic information with metadata accessible via a flexible search-engine.</p>
<h1>Key features</h1>
<ul>
<li>Assembly statistics: ensure data quality with genome-based key metrics</li>
<li>Taxonomic classification: robust, purely genome-based classifications (<a href="https://gtdb.ecogenomic.org/" target="_blank">GTDB</a>)</li>
<li><a href="https://pubmlst.org/">MLST</a>: subtyping for deeper insights into genetic variation</li>
<li>Annotation: comprehensive &amp; taxonomy-independent (<a href="https://bakta.computational.bio/" target="_blank">Bakta</a>)</li>
<li>Metadata: full original submission records</li>
</ul>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://bakrep.computational.bio/" rel="nofollow">https://bakrep.computational.bio/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44900/pegas-a-comprehensive-bioinformatic-solution-for-pathogenic-bacterial-genomic-analysis</guid>
	<pubDate>Mon, 01 Sep 2025 01:18:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44900/pegas-a-comprehensive-bioinformatic-solution-for-pathogenic-bacterial-genomic-analysis</link>
	<title><![CDATA[PeGAS: A Comprehensive Bioinformatic Solution for Pathogenic Bacterial Genomic Analysis]]></title>
	<description><![CDATA[<p><span>This is PeGAS, a powerful bioinformatic tool designed for the seamless quality control, assembly, and annotation of Illumina paired-end reads specific to pathogenic bacteria. This tool integrates state-of-the-art open-source software to provide a streamlined and efficient workflow, ensuring accurate insights into the genomic makeup of pathogenic microbial strains.</span></p>
<p><span><img src="https://github.com/liviurotiul/PeGAS/raw/main/Features.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/liviurotiul/PeGAS" rel="nofollow">https://github.com/liviurotiul/PeGAS</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</guid>
	<pubDate>Sun, 14 Apr 2019 20:35:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</link>
	<title><![CDATA[GMASS: a novel measure for genomeassembly structural similarity]]></title>
	<description><![CDATA[<div id="Abstract">
<div id="ASec3">
<p id="Par3">The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo assemblers.</p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z</a></p>
</div>
</div><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php" rel="nofollow">http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 11 May 2018 05:07:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads]]></title>
	<description><![CDATA[<p>MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>. MECAT performance were compared with&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>,&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>&nbsp;and&nbsp;<a href="http://canu.readthedocs.io/en/latest/">Canu(v1.3)</a>&nbsp;in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>&nbsp;and&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>.&nbsp;</p>
<p>https://www.nature.com/articles/nmeth.4432</p><p>Address of the bookmark: <a href="https://github.com/xiaochuanle/MECAT" rel="nofollow">https://github.com/xiaochuanle/MECAT</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36880/jvarkit-java-utilities-for-bioinformatics</guid>
	<pubDate>Fri, 08 Jun 2018 09:31:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36880/jvarkit-java-utilities-for-bioinformatics</link>
	<title><![CDATA[Jvarkit : Java utilities for Bioinformatics]]></title>
	<description><![CDATA[Collection of Java tool kits for bioinformatics works:

Jvarkit : Java utilities for Bioinformatics<p>Address of the bookmark: <a href="http://lindenb.github.io/jvarkit/" rel="nofollow">http://lindenb.github.io/jvarkit/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</guid>
	<pubDate>Fri, 25 May 2018 09:29:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</link>
	<title><![CDATA[GenomeMapper: Simultaneous alignment of short reads against multiple genomes]]></title>
	<description><![CDATA[GenomeMapper is a short read mapping tool designed for accurate read alignments. It quickly aligns millions of reads either with ungapped or gapped alignments. It can be used to align against multiple genomes simulanteously or against a single reference. If you are unsure which one is the appropriate GenomeMapper, you might want to use the latter

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768987/<p>Address of the bookmark: <a href="http://1001genomes.org/software/genomemapper.html" rel="nofollow">http://1001genomes.org/software/genomemapper.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>