<?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/43364?offset=200</link>
	<atom:link href="https://bioinformaticsonline.com/related/43364?offset=200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28141/csbb-v10</guid>
	<pubDate>Wed, 29 Jun 2016 07:33:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28141/csbb-v10</link>
	<title><![CDATA[CSBB-v1.0]]></title>
	<description><![CDATA[<p>CSBB is a command line based bioinformatics suite to analyze biological data acquired through varied avenues of biological experiments. CSBB is implemented in Perl, while it also leverages the use of R and python in background for specific modules. Major focus of CSBB is to allow users from biology and bioinformatics community, to get benefited by performing down-stream analysis tasks while eliminating the need to write programming code. CSBB is currently available on Linux, UNIX, MAC OS and Windows platforms.</p>
<p>Currently CSBB provides 13 modules focused on analytical tasks like performing upper-quantile normalization on expression data or convert genome wide gene expression to z-scores when comparing expression data from different platforms.</p>
<p>More at&nbsp;https://github.com/skygenomics/CSBB-v1.0</p><p>Address of the bookmark: <a href="https://github.com/skygenomics/CSBB-v1.0" rel="nofollow">https://github.com/skygenomics/CSBB-v1.0</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</guid>
	<pubDate>Sun, 02 Apr 2017 15:53:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</link>
	<title><![CDATA[TMAP - torrent mapping alignment program General Notes]]></title>
	<description><![CDATA[<p>TMAP - torrent mapping alignment program <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP#general-notes"></a>General Notes</p>
<p>TMAP is a fast and accurate alignment software for short and long nucleotide sequences produced by next-generation sequencing technologies.</p>
<ul>
<li>
<p>The latest TMAP is unsupported. To use a supported version, please see the TMAP version associated with a Torrent Suite release below.</p>
</li>
<li>
<p>Get the latest source code:</p>
<div>
<pre>git clone git://github.com/iontorrent/TMAP.git
 <span>cd</span> TMAP
 git submodule init
 git submodule update</pre>
</div>
</li>
</ul>
<p>https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</p><p>Address of the bookmark: <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP" rel="nofollow">https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36373/tools-to-predict-the-impact-of-missense-variants</guid>
	<pubDate>Mon, 23 Apr 2018 12:57:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36373/tools-to-predict-the-impact-of-missense-variants</link>
	<title><![CDATA[Tools to Predict the Impact of Missense Variants !]]></title>
	<description><![CDATA[<p><span>Prioritizing missense variants for further experimental investigation is a key challenge in current sequencing studies for exploring complex and Mendelian diseases. A large number of&nbsp;</span><em>in silico</em><span>&nbsp;tools have been employed for the task of pathogenicity prediction, including PolyPhen‐2, SIFT, FatHMM, MutationTaster‐2, MutationAssessor, Combined Annotation Dependent Depletion, LRT, phyloP, and GERP++, as well as optimized methods of combining tool scores, such as Condel and Logit. Due to the wealth of these methods, an important practical question to answer is which of these tools generalize best, that is, correctly predict the pathogenic character of new variants. </span></p><p><span>Study of 10 tools on five datasets that such a comparative evaluation of these tools is hindered by two types of circularity: they arise due to (1) the same variants or (2) different variants from the same protein occurring both in the datasets used for training and for evaluation of these tools, which may lead to overly optimistic results. Comparative evaluations of predictors that do not address these types of circularity may erroneously conclude that circularity confounded tools are most accurate among all tools, and may even outperform optimized combinations of tools.</span></p><p><span>Following tools are useful for mis sense muation detection ...&nbsp;</span></p><p>PolyPhen‐2 (PP2)<br />&ldquo;Predicts possible impact of an amino acid substitution on the structure and function of a human protein using straightforward physical and comparative considerations&rdquo;</p><p>MutationTaster‐2 (MT2)<br />&ldquo;Evaluation of the disease‐causing potential of DNA sequence alterations&rdquo;</p><p>MutationAssessor (MASS)<br />&ldquo;Predicts the functional impact of amino acid substitutions in proteins, such as mutations discovered in cancer or missense polymorphisms&rdquo;</p><p>LRT<br />&ldquo;Identify a subset of deleterious mutations that disrupt highly conserved amino acids within protein‐coding sequences, which are likely to be unconditionally deleterious&rdquo;</p><p>SIFT<br />&ldquo;Predicts whether an amino acid substitution affects protein function&rdquo;</p><p>GERP++<br />&ldquo;Identifies constrained elements in multiple alignments by quantifying substitution deficits. These deficits represent substitutions that would have occurred if the element were neutral DNA, but did not occur because the element has been under functional constraint. We refer to these deficits as &ldquo;rejected substitutions.&rdquo; Rejected substitutions are a natural measure of constraint that reflects the strength of past purifying selection on the element&rdquo;</p><p>phyloP<br />&ldquo;Compute conservation or acceleration P values based on an alignment and a model of neutral evolution&rdquo;</p><p>FatHMM unweighted (FatHMM‐U)<br />Predicts &ldquo;functional consequences of both coding variants, that is, nonsynonymous single‐nucleotide variants, and noncoding variants&rdquo;</p><p>FatHMM weighted (FatHMM‐W)<br />Predicts &ldquo;functional consequences of both coding variants, that is, nonsynonymous single‐nucleotide variants, and noncoding variants&rdquo; and its weighting scheme attributes higher tolerance scores to SNVs in proteins, related proteins, or domains that already include a high fraction of pathogenic variantsh</p><p>Combined Annotation Dependent Depletion (CADD)<br />&ldquo;CADD is a tool for scoring the deleteriousness of single‐nucleotide variants as well as insertion/deletions variants in the human genome&rdquo;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36508/mitobim-mitochondrial-baiting-and-iterative-mapping</guid>
	<pubDate>Tue, 08 May 2018 04:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36508/mitobim-mitochondrial-baiting-and-iterative-mapping</link>
	<title><![CDATA[MITObim - mitochondrial baiting and iterative mapping]]></title>
	<description><![CDATA[<p>This document contains instructions on how to use the MITObim pipeline described in Hahn et al. 2013. The full article can be found&nbsp;<a href="http://nar.oxfordjournals.org/content/41/13/e129" title="MITObim full article at NAR">here</a>. Kindly cite the article if you are using MITObim in your work. The pipeline was originally developed for&nbsp;<span>Illumina</span>&nbsp;data, but thanks to the versatility of the MIRA assembler, MITObim supports in principle also data from the&nbsp;<span>Iontorrent</span>,&nbsp;<span>454</span>&nbsp;and&nbsp;<span>PacBio</span>&nbsp;sequencing platforms.</p>
<p>Below you can find a few basic tutorials for how to run MITObim and I encorage you to give them a try with the testdata that comes with this Repo, just to make sure everything is running smoothly on your system. It'll only take a few minutes and will potentially safe you a lot of time down the line.</p>
<p>I provide further examples&nbsp;<a href="https://github.com/chrishah/MITObim/tree/master/examples">here</a>&nbsp;as Jupyter notebooks. Get in touch if you feel like sharing your particular MITObim solution and I'd be happy to put it up here, too!</p><p>Address of the bookmark: <a href="https://github.com/chrishah/MITObim" rel="nofollow">https://github.com/chrishah/MITObim</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Fri, 24 Jan 2020 06:04:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p><span>gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser. </span></p>
<p><span>gapFinisher can fill gaps in draft genomes quickly and reliably.</span></p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</guid>
	<pubDate>Tue, 08 Nov 2022 03:40:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</link>
	<title><![CDATA[Tools for Differential expression analysis]]></title>
	<description><![CDATA[<p><span>apeglm</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/apeglm.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/apeglm.html</a></p><p><span>ashr</span>&nbsp;-&nbsp;<a href="https://github.com/stephens999/ashr" target="_blank">https://github.com/stephens999/ashr</a>,&nbsp;<a href="https://cran.r-project.org/web/packages/ashr/index.html" target="_blank">https://cran.r-project.org/web/packages/ashr/index.html</a></p><p><span>consensusDE</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/consensusDE.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/consensusDE.html</a></p><p><span>DESeq2</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/DESeq2.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/DESeq2.html</a></p><p><span>edgeR</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/edgeR.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/edgeR.html</a></p><p><span>limma</span>&nbsp;-&nbsp;<a href="https://kasperdanielhansen.github.io/genbioconductor/html/limma.html" target="_blank">https://kasperdanielhansen.github.io/genbioconductor/html/limma.html</a>&nbsp;&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/limma.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/limma.html</a></p><p><span>MetaCycle</span>&nbsp;-&nbsp;<a href="https://cran.r-project.org/web/packages/MetaCycle/index.html" target="_blank">https://cran.r-project.org/web/packages/MetaCycle/index.html</a>,&nbsp;<a href="https://github.com/gangwug/MetaCycle" target="_blank">https://github.com/gangwug/MetaCycle</a></p><p><span>RUVSeq</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/RUVSeq.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/RUVSeq.html</a></p><p><span>SARTools</span>&nbsp;-&nbsp;<a href="https://github.com/PF2-pasteur-fr/SARTools" target="_blank">https://github.com/PF2-pasteur-fr/SARTools</a></p><p><span>tximport</span>&nbsp;-&nbsp;<a href="https://github.com/mikelove/tximport" target="_blank">https://github.com/mikelove/tximport</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44518/virus-bioinformatics-tools</guid>
	<pubDate>Wed, 24 Apr 2024 06:19:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44518/virus-bioinformatics-tools</link>
	<title><![CDATA[Virus Bioinformatics Tools]]></title>
	<description><![CDATA[<p><span>Bioinformatics tools play a crucial role in studying viruses, enabling researchers to analyze their genetic makeup, structure, function, and evolution. Here are some commonly used bioinformatics tools for virus research</span></p>
<p>https://evirusbioinfc.notion.site/18e21bc49827484b8a2f84463cb40b8d?v=92e7eb6703be4720abf17a901bc9a947</p><p>Address of the bookmark: <a href="https://evirusbioinfc.notion.site/18e21bc49827484b8a2f84463cb40b8d?v=92e7eb6703be4720abf17a901bc9a947" rel="nofollow">https://evirusbioinfc.notion.site/18e21bc49827484b8a2f84463cb40b8d?v=92e7eb6703be4720abf17a901bc9a947</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44914/predicting-pathogen-virulence-using-bioinformatics-tools</guid>
	<pubDate>Tue, 04 Nov 2025 07:55:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44914/predicting-pathogen-virulence-using-bioinformatics-tools</link>
	<title><![CDATA[Predicting Pathogen Virulence Using Bioinformatics Tools]]></title>
	<description><![CDATA[<p>In the genomic era, the ability to predict the virulence potential of pathogens has become an indispensable part of infectious disease research. With the exponential growth of microbial genome data, bioinformatics tools now enable scientists to identify virulence factors, model pathogen behavior, and even forecast outbreak risks &mdash; all from sequence data.</p><p>In an age where pathogens continue to evolve and cross boundaries, understanding <strong>what makes them virulent</strong>&mdash;that is, capable of causing disease&mdash;has become a critical focus in modern microbiology and genomics. <strong>Virulence prediction</strong> bridges computational biology, genomics, and machine learning to forecast the pathogenic potential of microbes before they strike.</p><h3>What Is Virulence?</h3><p><em>Virulence</em> refers to the degree of damage a pathogen can inflict on its host. It is determined by a combination of genetic factors&mdash;called <strong>virulence factors (VFs)</strong>&mdash;that allow the organism to attach, invade, evade, and harm the host. These include genes coding for toxins, secretion systems, adhesins, and enzymes that disrupt host defenses.</p><p>Understanding virulence factors not only helps in deciphering the mechanisms of infection but also provides early warning signs for emerging threats.</p><h3>Why Predict Virulence?</h3><p>Traditional virulence studies relied heavily on experimental infection models, which, although accurate, are <strong>time-consuming, expensive, and ethically constrained</strong>.<br /> Today, the availability of whole-genome sequences and large-scale pathogen databases has paved the way for <strong>in silico virulence prediction</strong>&mdash;a computational approach that can screen thousands of genomes within hours.</p><p>This approach enables researchers to:</p><ul>
<li>
<p>Rapidly identify potential <strong>high-risk strains</strong>.</p>
</li>
<li>
<p>Prioritize pathogens for <strong>containment, surveillance, or further study</strong>.</p>
</li>
<li>
<p>Guide <strong>vaccine development</strong> and <strong>drug target discovery</strong>.</p>
</li>
<li>
<p>Support <strong>One Health frameworks</strong>, linking animal, human, and environmental health data.</p>
</li>
</ul><h3>How Is Virulence Predicted?</h3><p>Virulence prediction combines <strong>bioinformatics pipelines</strong> with <strong>machine learning</strong> and <strong>comparative genomics</strong>. The process generally involves:</p><ol>
<li>
<p><strong>Genome Annotation:</strong> Identifying genes and coding sequences in microbial genomes.</p>
</li>
<li>
<p><strong>Feature Extraction:</strong> Comparing sequences with curated databases like <strong>VFDB (Virulence Factor Database)</strong>, <strong>PATRIC</strong>, or <strong>Victors</strong>.</p>
</li>
<li>
<p><strong>Pattern Recognition:</strong> Using algorithms (e.g., Random Forest, SVM, or deep learning models) to classify genes or strains as virulent or non-virulent based on sequence patterns, motifs, and protein domains.</p>
</li>
<li>
<p><strong>Scoring and Visualization:</strong> Assigning a virulence score or confidence level and visualizing it through heatmaps or genome maps.</p>
</li>
</ol><h3>Tools and Resources for Virulence Prediction</h3><p>A number of tools and databases make virulence prediction accessible to the scientific community:</p><ul>
<li>
<p><strong>VFanalyzer</strong> &ndash; For identifying virulence genes based on VFDB.</p>
</li>
<li>
<p><strong>PathoFact</strong> &ndash; Predicts virulence, antimicrobial resistance (AMR), and toxin genes from metagenomic data.</p>
</li>
<li>
<p><strong>Pangenome-based models</strong> &ndash; Identify virulence-associated gene clusters across strains.</p>
</li>
<li>
<p><strong>Machine learning models</strong> &ndash; Use features like GC content, codon usage bias, or protein domains to predict pathogenicity.</p>
</li>
</ul><p>Emerging tools now integrate <strong>multi-omic data</strong>&mdash;including transcriptomics, proteomics, and metabolomics&mdash;to understand virulence in a systems biology framework.</p><h3>Applications in the Real World</h3><p>Virulence prediction has major implications across public health and research sectors:</p><ul>
<li>
<p><strong>Epidemic preparedness:</strong> Early identification of virulent strains in outbreak samples.</p>
</li>
<li>
<p><strong>AMR surveillance:</strong> Linking virulence profiles with antibiotic resistance determinants.</p>
</li>
<li>
<p><strong>Environmental monitoring:</strong> Predicting pathogenic potential of soil or waterborne microbes.</p>
</li>
<li>
<p><strong>Clinical diagnostics:</strong> Supporting personalized treatment through pathogen profiling.</p>
</li>
</ul><p>For instance, integrating virulence prediction pipelines into <strong>national surveillance networks</strong> could enable faster risk assessment and response to infectious outbreaks.</p><h3>The Road Ahead</h3><p>As machine learning and genomics advance, virulence prediction will evolve from simple gene-based detection to <strong>dynamic, context-aware models</strong> that account for host&ndash;pathogen interactions, environmental signals, and evolutionary adaptation.</p><p>Future tools may predict <strong>not just if a strain is virulent</strong>, but <strong>under what conditions</strong> it expresses that virulence&mdash;bridging the gap between genotype and phenotype.</p><h3>In Summary</h3><p>Virulence prediction is redefining how we understand and anticipate infectious diseases. By coupling <strong>genomic insights</strong> with <strong>computational intelligence</strong>, researchers can identify potential threats earlier, design smarter interventions, and ultimately, strengthen our preparedness against emerging pathogens.</p>]]></description>
	<dc:creator>BioStar</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>

</channel>
</rss>