<?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/36755?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/36755?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:44:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</link>
	<title><![CDATA[Qualimap2: Evaluating next generation sequencing alignment data]]></title>
	<description><![CDATA[<p><strong>Qualimap 2</strong><span>&nbsp;is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like feature counts.&nbsp;</span><br><br><span>Supported types of experiments include:</span></p>
<ul>
<li>Whole-genome sequencing</li>
<li>Whole-exome sequencing</li>
<li>RNA-seq (speical mode available)</li>
<li>ChIP-seq</li>
</ul><p>Address of the bookmark: <a href="http://qualimap.bioinfo.cipf.es/" rel="nofollow">http://qualimap.bioinfo.cipf.es/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42150/parallellastz-lastz-with-multi-threads-support</guid>
	<pubDate>Sat, 22 Aug 2020 05:58:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42150/parallellastz-lastz-with-multi-threads-support</link>
	<title><![CDATA[parallelLastz: Lastz with multi-threads support.]]></title>
	<description><![CDATA[<p>Running Lastz (<a href="https://github.com/lastz/lastz">https://github.com/lastz/lastz</a>) in parallel mode. This program is for single computer with multiple core processors.</p>
<p>When the query file format is fasta, you can specify many threads to process it. It can reduce run time linearly, and use almost equal memory as the original lastz program. This is useful when you lastz a big query file to a huge reference like human whole genome sequence.</p>
<p>The program is an extension on the original lastz program which was written by Bob Harris (the LASTZ guy).</p><p>Address of the bookmark: <a href="https://github.com/jnarayan81/parallelLastz" rel="nofollow">https://github.com/jnarayan81/parallelLastz</a></p>]]></description>
	<dc:creator>BioStar</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/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</guid>
	<pubDate>Mon, 22 May 2017 05:43:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</link>
	<title><![CDATA[BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly]]></title>
	<description><![CDATA[<p>This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at&nbsp;<a href="mailto:kklam@eecs.berkeley.edu">kklam@eecs.berkeley.edu</a>. My name is Ka-Kit Lam.</p>
<p>https://github.com/kakitone/MetaFinisherSC</p>
<p>https://github.com/kakitone/BIGMAC</p><p>Address of the bookmark: <a href="https://github.com/kakitone/BIGMAC" rel="nofollow">https://github.com/kakitone/BIGMAC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</guid>
	<pubDate>Thu, 23 Nov 2017 10:24:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</link>
	<title><![CDATA[IONiseR:  tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer]]></title>
	<description><![CDATA[<p>This package is intended to provide tools for the quality assessment of data produced by Oxford Nanopore&rsquo;s MinION sequencer. It includes a functions to generate a number plots for examining the statistics that we think will be useful for this task.</p>
<p>However, nanopore sequencing is an emerging and rapidly developing technology. It is not clear what will be most informative. We hope that&nbsp;<code>IONiseR</code>&nbsp;will provide a framework for visualisation of metrics that we haven&rsquo;t thought of, and welcome feedback at&nbsp;<a href="mailto:mike.smith@embl.de" target="_blank">mike.smith@embl.de</a>.</p>
<p>If you&rsquo;re not interested in the quality assement of the raw or event level data, and want to jump straight to the getting FASTQ format files from fast5 files you can go straight to the final section of this document.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9673/now-time-is-come-to-revolutionize-amino-acid-sequencing-by-nanopore-technology</guid>
	<pubDate>Mon, 07 Apr 2014 08:01:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9673/now-time-is-come-to-revolutionize-amino-acid-sequencing-by-nanopore-technology</link>
	<title><![CDATA[Now time is come to revolutionize amino acid sequencing by Nanopore technology]]></title>
	<description><![CDATA[<p>Amino acid sequencing by Nanopore recognition tunneling method</p><p>Address of the bookmark: <a href="http://www.eurekalert.org/multimedia/pub/71198.php" rel="nofollow">http://www.eurekalert.org/multimedia/pub/71198.php</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>