<?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/36514?offset=190</link>
	<atom:link href="https://bioinformaticsonline.com/related/36514?offset=190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35386/list-of-visualization-tools-for-network-biology</guid>
	<pubDate>Mon, 29 Jan 2018 05:12:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35386/list-of-visualization-tools-for-network-biology</link>
	<title><![CDATA[List of visualization tools for network biology]]></title>
	<description><![CDATA[<p>Network analysis&nbsp;is any structured technique used to mathematically analyze a circuit (a &ldquo;network&rdquo; of interconnected components). The&nbsp;<span>Network analysis provides the ability to quantify associations between individuals, which makes it possible to infer details about the network as a whole at the species and/or population level.&nbsp;</span>Few tools published in BMC are listed here https://bmcbioinformatics.biomedcentral.com/articles/sections/networks-analysis.</p><p><img src="https://www.dropbox.com/pri/get/Public/Link%20to%20network.gif?_subject_uid=85115969&amp;raw=1&amp;revision_id=BBqs9eYx7G_faj5J33ExdjmtF8nXK2xrN5dUBsKyTLZQ9RB_hGM-YFmWZMBzbQZfRvjYzfs65HbQYrHRyoikxsQscSFTn1Nud2QeJ8KGfVI5wv4Kzp6froKOmPZu8ZygfKo&amp;size=1280x960&amp;size_mode=3&amp;w=AABQaErsFIz5ZjVZSxXvKaSVUkY5ob1Yjk0x7dghy0X7zw" alt="image" style="border: 0px; border: 0px;"></p><p>Following are the list of standalone applications for network analysis:</p><p>Arena 3D</p><p>3D visualization of multi-layer networks</p><p>http://www.arena3d.org</p><p>Biana</p><p>Data integration and network management</p><p>http://sbi.imim.es/web/BIANA.php</p><p>BioLayout Express 3D&nbsp;</p><p>2D/3D network visualization</p><p>http://www.biolayout.org/</p><p>BiologicalNetworks&nbsp;</p><p>Efficient integrated multi-level analysis of microarray, sequence, regulatory and other data</p><p>http://www.biologicalnetworks.org</p><p>BioMiner</p><p>Modeling, analyzing and visualizing biochemical pathways and networks</p><p>http://www.zbi.uni-saarland.de/chair/projects/BioMiner</p><p>Cell Illustrator&nbsp;</p><p>Petri nets for modeling and simulating biological networks</p><p>http://www.cellillustrator.com</p><p>COPASI</p><p>Analysis of biochemical networks and their dynamics</p><p>http://www.copasi.org/</p><p>Cytoscape&nbsp;</p><p>Network visualization and analysis. Over 200 plugins [60]</p><p>http://www.cytoscape.org/</p><p>Dizzy</p><p>Chemical kinetics stochastic simulation software</p><p>http://magnet.systemsbiology.net/software/Dizzy/</p><p>DyCoNet</p><p>Gephi plugin that can be used to identify dynamic communities in networks</p><p>https://github.com/juliemkauffman/DyCoNet</p><p>GENeVis&nbsp;</p><p>Network and pathway visualization</p><p>http://tinyurl.com/genevis/</p><p>GEPHI&nbsp;</p><p>Interactive visualization and exploration for any network and complex system, dynamic and hierarchical graph.</p><p>https://gephi.org</p><p>Igraph</p><p>Collection of network analysis tools with the emphasis on efficiency, portability and ease of use</p><p>http://igraph.sourceforge.net</p><p>Medusa</p><p>Semantic and multi-edged simple networks</p><p>https://sites.google.com/site/medusa3visualization/</p><p>NAViGaTOR</p><p>Visualizing and analyzing protein-protein interaction networks</p><p>http://tinyurl.com/navigator1/</p><p>N-Browse</p><p>Interactive graphical browser for biological networks</p><p>http://www.gnetbrowse.org/</p><p>NeAT</p><p>Topological and clustering analysis of networks</p><p>http://rsat.ulb.ac.be/neat/</p><p>Ondex&nbsp;</p><p>Data integration and visualization of large networks</p><p>http://www.ondex.org/</p><p>Osprey</p><p>Visualization and annotation of biological networks</p><p>http://biodata.mshri.on.ca/osprey/servlet/Index</p><p>Pajek&nbsp;</p><p>Analysis and visualization of large networks and social network analysis</p><p>http://vlado.fmf.uni-lj.si/pub/networks/pajek/</p><p>PathwayAssist&nbsp;</p><p>Navigation and analysis of biological pathways, gene regulation networks and protein interaction maps.</p><p>http://www.ariadnegenomics.com/downloads/</p><p>PIVOT&nbsp;</p><p>Layout algorithms for visualizing protein interactions and families</p><p>http://acgt.cs.tau.ac.il/pivot/</p><p>ProCope&nbsp;</p><p>Prediction and evaluation of protein complexes from purification data experiments</p><p>http://www.bio.ifi.lmu.de/Complexes/ProCope/</p><p>ProViz&nbsp;</p><p>Visualization and exploration of interaction networks. Gene Ontology and PSI-MI formats supported</p><p>http://cbi.labri.fr/eng/proviz.htm</p><p>SpectralNET&nbsp;</p><p>Network analysis and visualizations. Scatter plots and dimensionality reduction algorithms</p><p>https://www.broadinstitute.org/software/spectralnet</p><p>Tulip&nbsp;</p><p>Enables the development of algorithms, visual encodings, interaction techniques, data models and domain-specific visualizations</p><p>http://tulip.labri.fr/TulipDrupal/</p><p>VANESA&nbsp;</p><p>Automatic reconstruction and analysis of biological networks and Petri nets based on life-science database information</p><p>http://agbi.techfak.uni-bielefeld.de/vanesa/</p><p>VANTED&nbsp;</p><p>Network reconstruction, data visualization, integration of various data types, network simulation</p><p>http://tinyurl.com/vanted/</p><p>yEd</p><p>Creation of diagrams manually and import external data</p><p>http://tinyurl.com/yEdGraph/</p><p>Web tools for network analysis</p><p>APID&nbsp;</p><p>Unified protein-protein interactions from BIND, BioGRID, DIP, HPRD, IntAct and MINT</p><p>http://bioinfow.dep.usal.es/apid/</p><p>Arcadia&nbsp;</p><p>Translates text-based descriptions of biological networks (SBML files) into standardized diagrams (Systems Biology Graphical Notation Process Description maps)</p><p>http://arcadiapathways.sourceforge.net/</p><p>AVIS&nbsp;</p><p>Viewer for signaling networks</p><p>http://actin.pharm.mssm.edu/AVIS2</p><p>bioPIXIE&nbsp;</p><p>Discovery of biological networks from diverse functional genomic data</p><p>http://pixie.princeton.edu/pixie</p><p>CellPublisher</p><p>Interactive representations of biochemical processes</p><p>http://cellpublisher.gobics.de/</p><p>Graphle</p><p>Distributed network exploration and visualization of interactive large, dense graphs</p><p>http://tinyurl.com/graphle/</p><p>GraphWeb&nbsp;</p><p>Web server for graph-based analysis of biological networks</p><p>http://biit.cs.ut.ee/graphweb/</p><p>Hubba</p><p>Web-based service to explore the essential nodes in a network</p><p>http://hub.iis.sinica.edu.tw/Hubba</p><p>NetworkBLAST&nbsp;</p><p>Analysis of protein interaction networks across species to infer protein complexes that are conserved in evolution</p><p>http://www.cs.tau.ac.il/~bnet/networkblast.htm</p><p>Pathview&nbsp;</p><p>Tool set for pathway-based data integration and visualization</p><p>http://Pathview.r-forge.r-project.org/</p><p>PINA&nbsp;</p><p>Integrated platform for protein interaction network construction, filtering, analysis, visualization and management</p><p>http://cbg.garvan.unsw.edu.au/pina/home.do</p><p>ReMatch&nbsp;</p><p>Web-based tool for integration of user-given stoichiometric metabolic models into a database collected from public data sources</p><p>http://www.cs.helsinki.fi/group/sysfys/software/rematch/</p><p>SNOW&nbsp;</p><p>Gene mapping on a reference or human protein-protein interaction network that SNOW hosts</p><p>http://snow.bioinfo.cipf.es</p><p>STITCH&nbsp;</p><p>Resource to explore known and predicted interactions of chemicals and proteins</p><p>http://stitch.embl.de/</p><p>STRING</p><p>Protein interaction networks and integration of data such as genomic context, high-throughput experiments, conserved coexpression and previous knowledge derived from the literature</p><p>http://string-db.org</p><p>TVNViewer&nbsp;</p><p>An interactive visualization tool for exploring networks that change over time or space</p><p>http://www.sailing.cs.cmu.edu/main/?page_id=545</p><p>tYNA&nbsp;</p><p>System for managing, comparing and mining multiple networks</p><p>http://tyna.gersteinlab.org/tyna/</p><p>VisANT&nbsp;</p><p>Visualization, mining, analysis and modeling of biological networks, metabolic networks and ecosystems</p><p>http://visant.bu.edu/</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36583/eugi-a-novel-resource-for-studying-genomic-islands-to-facilitate-horizontal-gene-transfer-detection-in-eukaryotes</guid>
	<pubDate>Sat, 12 May 2018 07:26:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36583/eugi-a-novel-resource-for-studying-genomic-islands-to-facilitate-horizontal-gene-transfer-detection-in-eukaryotes</link>
	<title><![CDATA[EuGI: a novel resource for studying genomic islands to facilitate horizontal gene transfer detection in eukaryotes]]></title>
	<description><![CDATA[<p><span>SWGIS v2.0 along with the EuGI database, which houses GIs identified in 66 different eukaryotic species, and the EuGI web-resource, provide the first comprehensive resource for studying HGT in eukaryotes.</span></p>
<p>https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8</p><p>Address of the bookmark: <a href="https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8" rel="nofollow">https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42023/encode3-a-collection-of-research-articles-and-related-content-describing-the-encyclopedia-of-dna-elements-its-datasets-and-tools</guid>
	<pubDate>Sat, 08 Aug 2020 08:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42023/encode3-a-collection-of-research-articles-and-related-content-describing-the-encyclopedia-of-dna-elements-its-datasets-and-tools</link>
	<title><![CDATA[ENCODE3: A collection of research articles and related content describing the Encyclopedia of DNA Elements, its datasets and tools.]]></title>
	<description><![CDATA[<p>How cells, tissues and organisms interpret the information encoded in the genome has vital implications for our understanding of development, health and disease. Launched in 2003, the ENCyclopedia Of DNA Elements (ENCODE) project has the aim of mapping the functional elements in the human genome (later expanded to include model organisms).</p><p>During the first phase of ENCODE, published in 2007, microarray-based technologies were used to detect regions associated with transcription factors, certain histone modifications and open chromatin within a pre-specified 1% of the human genome.</p><p>ENCODE&rsquo;s second phase saw a switch to sequencing-based technologies, the addition of new assay types and the analysis of functional elements genome-wide, described in a collection of research articles in 2012.</p><p><span>The&nbsp;</span><a href="https://www.nature.com/articles/s41586-020-2493-4">Encyclopedia paper of ENCODE 3</a><span>, published in&nbsp;</span><em>Nature</em><span>, gives an overview of the various assays that were performed in human and mouse cell lines and tissues and describes a Registry of human and mouse candidate&nbsp;</span><em>cis</em><span>-regulatory elements (cCREs).</span></p><p>More at&nbsp;<a href="https://www.nature.com/immersive/d42859-020-00027-2/index.html">https://www.nature.com/immersive/d42859-020-00027-2/index.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44551/bioinformatic-tools-for-pathogens-informatics-at-cvr</guid>
	<pubDate>Sat, 08 Jun 2024 15:59:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44551/bioinformatic-tools-for-pathogens-informatics-at-cvr</link>
	<title><![CDATA[Bioinformatic tools for pathogens informatics at CVR]]></title>
	<description><![CDATA[<div><div><div><div><div><p>Novel sequencing and analytical approaches focused on studying viruses and virus-host interactions. Below you will find summaries and links to a number of bioinformatic tools that have been developed @ CVR.</p></div><div><h3><a href="http://giffordlabcvr.github.io/DIGS-tool/" target="_blank" title="DIGS">DIGS</a></h3></div><div><p>The database-integrated genome-screening (DIGS) tool provides a framework for implementing automated in silico screening of sequence databases using BLAST in combination with a relational database (MySQL).</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/software/discvr/" target="" title="DisCVR">DisCVR</a></h3></div><div><p>DisCVR is a Diagnostic tool for detecting known human viruses in clinical samples from Next-Generation Sequencing (NGS) data. The tool uses a simple and straightforward Graphical User Interface and is optimized on Windows OS without compromising speed and accuracy.</p></div><div><h3><a href="http://josephhughes.github.io/DiversiTools/" target="_blank" title="DiversiTools">DiversiTools</a></h3></div><div><p>DiversiTools is a computational tool that is specifically tailored towards viral HTS data sets and the analysis of the underlying viral populations that they represent. It was initially developed in collaboration with a number of virologists interested in characterising the intra-host diversity of viral populations and studying their evolution across transmission chains at the micro-evolutionary scale.</p></div><div><h3><a href="http://glue-tools.cvr.gla.ac.uk/" target="_blank" title="GLUE">GLUE</a></h3></div><div><p>GLUE is a flexible data-centric bioinformatics environment for virus sequence data, with a focus on virus evolution and genomic variation. GLUE has been applied to a range of viruses. A GLUE-based resource focused on Hepatitis C virus is HCV-GLUE.</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/tanoti/" target="_blank" title="Tanoti">Tanoti</a></h3></div><div><p>Tanoti is a BLAST guided reference based short read aligner. It is developed for maximising alignment in highly variable next generation sequence data sets (Illumina).</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/victree/" target="_blank" title="VicTREE">ViCTree</a></h3></div><div><p>ViCTree is a bioinformatic framework that automatically selects new candidate virus sequences from GenBank, generates multiple sequence alignments, calculates a maximum likelihood phylogeny and integrates the sequences into the existing phylogenetic trees.&nbsp;<span>For more information click&nbsp;</span><a href="https://bioinformatics.cvr.ac.uk/victree_web/" target="_blank">here</a>.</p></div></div></div></div></div><div><div><div><div><div><h3><a href="https://bioinformatics.cvr.ac.uk/software/viral-host-predictor/" target="" title="Viral Host Predictor">Viral Host Predictor</a></h3></div><div><p>Viral Host Predictor provides a fast and simple way to predict the hosts and vectors of RNA viruses from viral sequences.</p></div><div><h3><a href="https://github.com/salvocamiolo/GRACy/releases/tag/v0.4.4" target="_blank" title="GRACy">GRACy</a></h3></div><div><p>GRACy is a bioinformatic tool designed for the analysis of Illumina data originated from Human cytomegalovirus samples. GRACy can be used to perform read quality filtering, genotyping, de novo assembly, variant detection, annotation and data submission to public database.</p></div><div><h3><a href="https://github.com/salvocamiolo/LoReTTA/releases/tag/v0.1" target="_blank" title="LoReTTA">LoReTTA</a></h3></div><div><p>LoReTTA (Long Read Template Targeted Assembler) is a reference assisted de novo assembler specifically designed to deal with PacBio reads generated from viral genomes.&nbsp;</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/software/bingleseq/" target="" title="BingleSeq">BingleSeq</a></h3></div><div><p>BingleSeq is a R-package enables the user-friendly analysis of count tables obtained by both Bulk RNA-Seq and single-cell RNA-Seq protocols. The development of BingleSeq focused on providing a flexible and intuitive user experience.</p></div></div></div></div></div>]]></description>
	<dc:creator>Abhi</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/pages/view/34418/spades-hybrid-genome-assembly</guid>
	<pubDate>Mon, 27 Nov 2017 08:05:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</link>
	<title><![CDATA[SPAdes hybrid genome assembly]]></title>
	<description><![CDATA[<p>When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the&nbsp;<a href="https://gigascience.biomedcentral.com/articles/10.1186/s13742-015-0101-6">B fragilis assembly</a>&nbsp;by Mick Watson&rsquo;s group.</p><p>Again, running spades.py will show you the options:</p><div><pre><code>spades.py
</code></pre></div><p>This produces:</p><div><pre><code>SPAdes genome assembler v3.10.1

Usage: /usr/local/SPAdes-3.10.1-Linux/bin/spades.py [options] -o &lt;output_dir&gt;

Basic options:
-o      &lt;output_dir&gt;    directory to store all the resulting files (required)
--sc                    this flag is required for MDA (single-cell) data
--meta                  this flag is required for metagenomic sample data
--rna                   this flag is required for RNA-Seq data
--plasmid               runs plasmidSPAdes pipeline for plasmid detection
--iontorrent            this flag is required for IonTorrent data
--test                  runs SPAdes on toy dataset
-h/--help               prints this usage message
-v/--version            prints version

Input data:
--12    &lt;filename&gt;      file with interlaced forward and reverse paired-end reads
-1      &lt;filename&gt;      file with forward paired-end reads
-2      &lt;filename&gt;      file with reverse paired-end reads
-s      &lt;filename&gt;      file with unpaired reads
--pe&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-&lt;or&gt;    orientation of reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--s&lt;#&gt;          &lt;filename&gt;      file with unpaired reads for single reads library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-&lt;or&gt;    orientation of reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--hqmp&lt;#&gt;-12    &lt;filename&gt;      file with interlaced reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-1     &lt;filename&gt;      file with forward reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-2     &lt;filename&gt;      file with reverse reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-s     &lt;filename&gt;      file with unpaired reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-&lt;or&gt;  orientation of reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--nxmate&lt;#&gt;-1   &lt;filename&gt;      file with forward reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--nxmate&lt;#&gt;-2   &lt;filename&gt;      file with reverse reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--sanger        &lt;filename&gt;      file with Sanger reads
--pacbio        &lt;filename&gt;      file with PacBio reads
--nanopore      &lt;filename&gt;      file with Nanopore reads
--tslr  &lt;filename&gt;      file with TSLR-contigs
--trusted-contigs       &lt;filename&gt;      file with trusted contigs
--untrusted-contigs     &lt;filename&gt;      file with untrusted contigs

Pipeline options:
--only-error-correction runs only read error correction (without assembling)
--only-assembler        runs only assembling (without read error correction)
--careful               tries to reduce number of mismatches and short indels
--continue              continue run from the last available check-point
--restart-from  &lt;cp&gt;    restart run with updated options and from the specified check-point ('ec', 'as', 'k&lt;int&gt;', 'mc')
--disable-gzip-output   forces error correction not to compress the corrected reads
--disable-rr            disables repeat resolution stage of assembling

Advanced options:
--dataset       &lt;filename&gt;      file with dataset description in YAML format
-t/--threads    &lt;int&gt;           number of threads
                                [default: 16]
-m/--memory     &lt;int&gt;           RAM limit for SPAdes in Gb (terminates if exceeded)
                                [default: 250]
--tmp-dir       &lt;dirname&gt;       directory for temporary files
                                [default: &lt;output_dir&gt;/tmp]
-k              &lt;int,int,...&gt;   comma-separated list of k-mer sizes (must be odd and
                                less than 128) [default: 'auto']
--cov-cutoff    &lt;float&gt;         coverage cutoff value (a positive float number, or 'auto', or 'off') [default: 'off']
--phred-offset  &lt;33 or 64&gt;      PHRED quality offset in the input reads (33 or 64)
                                [default: auto-detect]
</code></pre></div><p>As you can see this is also a &ldquo;pipeline&rdquo; of tools that can be switched on or off. SPAdes takes quite a long time, so for the purposes of this practical, something like this may suffice:</p><div><pre><code>spades.py -t 4 <span>\</span>
          -m 32 <span>\</span>
          -k 31,51,71 <span>\</span>
          --only-assembler <span>\</span>
          -1 miseq.1.fastq -2 miseq.2.fastq <span>\</span>
          --nanopore minion.fastq <span>\</span>
          -o hybrid_assembly
</code></pre></div><p>In turn, these parameters mean</p><ul>
<li>use 4 threads</li>
<li>max memory is 32Gb</li>
<li>use 3 kmer values to build the de bruijn graph(s) - 31, 51 and 71</li>
<li>only run the assembler, not the correction algorithm (for speed)</li>
<li>read 1 and read 2 of the MiSeq data</li>
<li>the nanopore data</li>
<li>put the output in folder &ldquo;hybrid_assembly&rdquo;</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>