<?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/39689?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/39689?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/bookmarks/view/44569/seqcat-sequence-conversion-and-analysis-toolbox</guid>
	<pubDate>Fri, 14 Jun 2024 14:36:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44569/seqcat-sequence-conversion-and-analysis-toolbox</link>
	<title><![CDATA[SeqCAT: Sequence Conversion and Analysis Toolbox]]></title>
	<description><![CDATA[<div>Your all-in-one solution for smooth conversion of sequence coordinates.</div>
<div>Designed for bioinformatics data analysis and daily laboratory work, SeqCAT simplifies sequence coordinate conversion. Extract gene and transcript information, manipulate sequences, and easily validate complex genetic events such as fusions with SeqCAT.</div>
<div>&nbsp;</div>
<div>More at&nbsp;https://academic.oup.com/nar/advance-article/doi/10.1093/nar/gkae422/7683049?login=false</div><p>Address of the bookmark: <a href="https://mtb.bioinf.med.uni-goettingen.de/SeqCAT/home" rel="nofollow">https://mtb.bioinf.med.uni-goettingen.de/SeqCAT/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35550/circoletto-visualizing-sequence-similarity-with-circos</guid>
	<pubDate>Fri, 09 Feb 2018 10:23:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35550/circoletto-visualizing-sequence-similarity-with-circos</link>
	<title><![CDATA[Circoletto: visualizing sequence similarity with Circos]]></title>
	<description><![CDATA[<p><span>Circoletto, an online visualization tool based on Circos, which provides a fast, aesthetically pleasing and informative overview of sequence similarity search results.</span></p>
<p>Online version and downloadable software package for offline use (source code in PERL) freely available at&nbsp;<a href="http://bat.ina.certh.gr/tools/circoletto/" target="">http://bat.ina.certh.gr/tools/circoletto/</a></p>
<p><strong>Contact:</strong><a href="mailto:ndarz@certh.gr" target="">ndarz@certh.gr</a></p><p>Address of the bookmark: <a href="http://tools.bat.infspire.org/circoletto/" rel="nofollow">http://tools.bat.infspire.org/circoletto/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:39:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</link>
	<title><![CDATA[SeqMonk:A tool to visualise and analyse high throughput mapped sequence data]]></title>
	<description><![CDATA[<p>SeqMonk is a program to enable the visualisation and analysis of mapped sequence data. It was written for use with mapped next generation sequence data but can in theory be used for any dataset which can be expressed as a series of genomic positions. It's main features are:</p>
<ul>
<li>Import of mapped data from mapped data (BAM/SAM/bowtie etc)</li>
<li>Creation of data groups for visualisation and analysis</li>
<li>Visualisation of mapped regions against an annotated genome.</li>
<li>Flexible quantitation of the mapped data to allow comparisons between data sets</li>
<li>Statistical analysis of data to find regions of interest</li>
<li>Creation of reports containing data and genome annotation</li>
</ul><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38441/genome-sequence-based-sub-species-delineation</guid>
	<pubDate>Wed, 12 Dec 2018 08:31:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38441/genome-sequence-based-sub-species-delineation</link>
	<title><![CDATA[Genome sequence-based (sub-)species delineation.]]></title>
	<description><![CDATA[<p>The GGDC web service reports digital DDH for a universal and accurate delineation of prokaryotic (sub-)species without inheriting the pitfalls of classic DDH, and also calculates differences in genomic G+C content.</p>
<p>http://ggdc.dsmz.de/ggdc_background.php#</p>
<p><small>Genome-to-Genome Distance Calculator 2.1</small></p>
<p>http://ggdc.dsmz.de/ggdc.php</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://ggdc.dsmz.de/" rel="nofollow">http://ggdc.dsmz.de/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</guid>
	<pubDate>Mon, 26 Aug 2019 17:55:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39872/miropeats-discovers-regions-of-sequence-similarity-amongst-any-set-of-dna-sequences</link>
	<title><![CDATA[Miropeats: discovers regions of sequence similarity amongst any set of DNA sequences]]></title>
	<description><![CDATA[<p><span>Miropeats discovers regions of sequence similarity amongst any set of DNA sequences and then presents this similarity information graphically. Sequence similarity searching is a very general tool that forms the basis of many different biological sequence analyses but it is limited by the verbosity of traditional alignment presentation styles. Miropeats enhances the utility of conventional DNA sequence comparisons when looking at long lengths of sequence similarity by summarizing extensive large scale sequence similarities on a single page of graphics. The latest version of Miropeats can be used as a general pairwise alignment program or in its traditional role sorting out a big mess of overlapping or similar regions.</span></p><p>Address of the bookmark: <a href="http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/" rel="nofollow">http://www.littlest.co.uk/software/bioinf/old_packages/miropeats/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</guid>
	<pubDate>Fri, 31 Jan 2020 02:36:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</link>
	<title><![CDATA[Complete genome sequence of Wuhan seafood market pneumonia virus is out !]]></title>
	<description><![CDATA[<p>Wuhan-Hu-1 claimed at least 40 lives and infected at least 1300 others in China. Cases are now being reported from Thailand, Singapore, Malaysia, South Korea, Japan, Vietnam, Nepal, France, Australia and even as far as the US.&nbsp;On Jan 10 2020, while news of the first fatality was barely trickling in, the <a href="https://www.ncbi.nlm.nih.gov/nuccore/MN908947">29,903 letters</a> constituting the viral genome from an affected individual in Wuhan had already been elucidated (even though a few corrections were made subsequently). All the viral genome sequences from affected individuals are very very close to each other. Several are identical and none has more than 5 differences (99.983% similarity). This strongly suggests that transmission into humans came from a single pointed source and happened very recently, between Sep-Dec 2019.</p><p>Check out the detail at https://www.ncbi.nlm.nih.gov/nuccore/MN908947</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41562/submit-your-sars-cov-2-sequence-data-to-genbank</guid>
	<pubDate>Thu, 09 Apr 2020 18:28:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41562/submit-your-sars-cov-2-sequence-data-to-genbank</link>
	<title><![CDATA[Submit your SARS-CoV-2 sequence data to GenBank]]></title>
	<description><![CDATA[<div dir="auto">Submit your SARS-CoV-2 sequence data to GenBank and SRA with our new submission landing page. Submission is simple and streamlined *and* there&rsquo;s a rapid turnaround. <span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fsubmit.ncbi.nlm.nih.gov%2Fsarscov2%2F%3Ffbclid%3DIwAR3p-OzZPe2yx4CZMoZxiWMF3kUQjXyVVduNQhBdehWmFTJ3cPBstsOLypI&amp;h=AT2d-umit7ciXRW-nrRYVL3gJSLKY4Hte8W8cXw8Wl94n6PGmoHmVqvvhgQj-mTo6A5lpMP9JDV_lRSq9RRLT5KeVVAAfcuRgJOeA6QhApIB2B9nFxUfDCD3sio4HYidpRwpmng&amp;__tn__=-UK-R&amp;c[0]=AT2zWGa1K5EvV4UcnB0b7HHvkBtX-wAyh7AF8_fZ9uI2y-02nOHQHT_Um3xgnto5KEZ26wRG0xNgUWTA1W-7HF0E25E23XtIL5XGOhloBXaDIcHw30AVjTCkQi7aFk4dN7aBCmVJeSbH37urtbM2kmMfyTCbdTvMU8FGlnX-DNVuCaZr4XfXnf_jvPNdxe9sBH84oXJ-uJz5kbqlHGAHDoqK" target="_blank">https://submit.ncbi.nlm.nih.gov/sarscov2/</a></span></div><div dir="auto">&nbsp;</div><div dir="auto"><span><span>Quickly and easily add your SARS-CoV-2 sequence data to the growing public archive with new, special features and support from NCBI. </span><a href="https://submit.ncbi.nlm.nih.gov/sarscov2/">new SARS-CoV-2 sequence submission landing page</a><span>&nbsp;will help you get started. GenBank submissions are accessioned and released in approximately 1-2 working days, and&nbsp;</span><a href="https://www.ncbi.nlm.nih.gov/sra" target="_blank">Sequence Read Archive</a><span>&nbsp;(SRA) submissions typically processed and released within hours. Submission is simple!</span></span></div><div><div dir="auto">&nbsp;</div><div dir="auto">More information is available on NCBI Insights. <span><a href="https://l.facebook.com/l.php?u=https%3A%2F%2Fncbiinsights.ncbi.nlm.nih.gov%2F2020%2F04%2F09%2Fsars-cov2-data-streamlined-submission-rapid-turnaround%2F%3Ffbclid%3DIwAR1OuLu3oDjz3VX4fDq5Jg316td9foTOUGNqnoN1eI2nFXTf4EBv28JiXD4&amp;h=AT0ah_epxwAc-nM6QiPBYvKSQ-kWmiPgHKO1w7SnxnnRiTI4etJJfNAWyzcR7snIdtxtcErAFRdHPBH2j0EY77gUPDdnBVnAsxnVbSgZnrrOPfnni331A37Xvytgnye0ArnUuWk&amp;__tn__=-UK-R&amp;c[0]=AT2zWGa1K5EvV4UcnB0b7HHvkBtX-wAyh7AF8_fZ9uI2y-02nOHQHT_Um3xgnto5KEZ26wRG0xNgUWTA1W-7HF0E25E23XtIL5XGOhloBXaDIcHw30AVjTCkQi7aFk4dN7aBCmVJeSbH37urtbM2kmMfyTCbdTvMU8FGlnX-DNVuCaZr4XfXnf_jvPNdxe9sBH84oXJ-uJz5kbqlHGAHDoqK" target="_blank">https://ncbiinsights.ncbi.nlm.nih.gov/2020/04/09/sars-cov2-data-streamlined-submission-rapid-turnaround/</a></span></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Mon, 18 Jan 2021 10:47:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42645/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>Manisha Mishra</dc:creator>
</item>

</channel>
</rss>