<?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/44213?offset=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/44213?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</guid>
	<pubDate>Wed, 25 Apr 2018 04:53:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</link>
	<title><![CDATA[Protein-Protein Interaction Sites Predictions !]]></title>
	<description><![CDATA[<p><span>The study of Protein&ndash;Protein Interactions (PPIs) has a crucial role in biology, medicine and the pharmaceutical industry. PPIs can be investigated from two aspects: The interaction partners of a specific protein and the amino acid residues participating in a given PPI. Information about a protein&rsquo;s interaction partners allows scientists to construct protein interaction networks, such as signaling pathways, which in turn facilitate the understanding of many biological and clinical observations.&nbsp;</span></p><p><span>Following are the list of tools commonly used to PPIs predictions:</span></p><p>Protein-Protein Interaction Sites</p><p><a href="http://pipe.scs.fsu.edu/ppisp.html" target="_blank">PPISP</a></p><p>A consensus neural network method for predicting protein-protein interaction sites</p><p><a href="http://biunit.naist.jp/homcos/" target="_blank">HOMCOS</a></p><p>A server to predict interacting protein pairs and interacting sites by homology modeling of complex structures</p><p><a href="http://prism.ccbb.ku.edu.tr/hotpoint/" target="_blank">HotPOINT</a></p><p>Prediction of protein interfaces using an empirical model</p><p><a href="http://cubic.bioc.columbia.edu/services/isis/" target="_blank">ISIS</a></p><p>Prediction of interaction hotspots from sequence</p><p><a href="http://kfc.mitchell-lab.org/" target="_blank">KFC server</a></p><p>Automated decision-tree approach to predicting protein-protein interaction hot spots</p><p><a href="http://pipe.scs.fsu.edu/meta-ppisp.html" target="_blank">meta-PPISP</a></p><p>A meta server for predicting protein-protein interaction sites. meta-PPISP is built on three individual web servers:&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#cons">cons-PPISP</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pin">PINUP</a>, and&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pro">Promate</a></p><p><a href="http://www.molsoft.com/oda.html" target="_blank">ODA</a></p><p>Identification of optimal surface patches with the lowest docking desolvation energy values</p><p><a href="http://sparks.informatics.iupui.edu/PINUP/" target="_blank">PINUP</a></p><p>Protein binding site prediction with an empirical scoring function</p><p>Other Sites (DNA, RNA, Metals)</p><p><a href="http://ligin.weizmann.ac.il/~lpgerzon/mbs4/mbs.cgi" target="_blank">CHED</a>&nbsp;</p><p>Web server for predicting soft metal binding sites in proteins</p><p><a href="http://cssb.biology.gatech.edu/skolnick/webservice/DBD-Hunter/" target="_blank">DBD-Hunter</a></p><p>A knowledge-based method for the prediction of DNA-protein interactions</p><p><a href="http://pipe.scs.fsu.edu/displar.html" target="_blank">DISPLAR</a></p><p>Given the structure of a protein known to bind DNA, the method predicts residues that contact DNA using neural network method</p><p><a href="http://idbps.tau.ac.il/" target="_blank">iDBPs</a></p><p>Predicts DNA binding proteins for proteins with known 3D structure.</p><p><a href="http://pfp.technion.ac.il/" target="_blank">PFplus</a></p><div style="text-align: left;">A tool for extracting and displaying positive electrostatic patches on protein surfaces which can be indicative of nucleic acid binding interfaces.</div>]]></description>
	<dc:creator>Poonam Mahapatra</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/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 11 May 2018 05:07:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads]]></title>
	<description><![CDATA[<p>MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>. MECAT performance were compared with&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>,&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>&nbsp;and&nbsp;<a href="http://canu.readthedocs.io/en/latest/">Canu(v1.3)</a>&nbsp;in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>&nbsp;and&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>.&nbsp;</p>
<p>https://www.nature.com/articles/nmeth.4432</p><p>Address of the bookmark: <a href="https://github.com/xiaochuanle/MECAT" rel="nofollow">https://github.com/xiaochuanle/MECAT</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/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/pages/view/44618/important-bioinformatics-tools</guid>
	<pubDate>Tue, 30 Jul 2024 05:03:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44618/important-bioinformatics-tools</link>
	<title><![CDATA[Important Bioinformatics Tools !]]></title>
	<description><![CDATA[<p><span>1. Ktrim: An extra-fast, accurate adapter trimmer for sequencing data. It processes FASTQ files from multiple lanes with minimal mismatching and over-trimming of adapters.</span><span><br /></span><span><br /></span><span>2. BWA MEM: A reliable alignment tool (particularly for mapping ALT contigs and HLA genes, which are not fully addressed in BWA-MEM2).</span><span><br /></span><span><br /></span><span>3. Sambamba markdup: Quickly marks or removes duplicate reads using Picard's criteria.</span><span><br /></span><span><br /></span><span>4. ichorCNA: Estimates the tumor DNA fraction in cell-free DNA from ultra-low-pass whole genome sequencing (0.1x coverage) based on copy number alterations (CNA).</span><span><br /></span><span><br /></span><span>5. Fragle: A deep learning method for quantifying ctDNA levels from cell-free DNA fragmentomic profiles. It detects TF as low as ~1% ctDNA and works with targeted genomic panel sequencing data.</span><span><br /></span><span><br /></span><span>6. AlfredQC: A quality control tool for high-throughput sequencing data. It assesses metrics like read quality scores, GC content, and duplication rates, visualized through detailed plots and summary statistics.</span><span><br /></span><span><br /></span><span>7. Mosdepth: A fast tool for calculating sequencing coverage depth, offering a quicker alternative to samtools/sambamba depth by processing BAM and CRAM files.</span><span><br /></span><span><br /></span><span>8. Bedtools: A versatile toolkit for genomics, enabling operations like intersect, merge, count, and shuffle on genomic intervals across formats such as BAM, BED, GFF/GTF, and VCF.</span><span><br /></span><span><br /></span><span>9. Datamash: A command-line tool for basic numeric, textual, and statistical operations on input data streams. It supports operations such as grouping, sorting, transposing, and performing arithmetic calculations on tabular data.</span><span><br /></span><span><br /></span><span>10.</span><span> </span><a href="http://gwf.app/" target="_self">gwf.app</a><span>: A pragmatic alternative to Snakemake. Developed at</span><span> </span><a href="https://www.linkedin.com/company/aarhus-university-denmark-/" target="_self"><span>Aarhus University</span></a><span>, this flexible, generic workflow tool builds and runs large scientific workflows.</span></p>]]></description>
	<dc:creator>BioStar</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/35395/comprehensive-list-of-visualization-tools-for-biological-pathways</guid>
	<pubDate>Tue, 30 Jan 2018 06:01:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35395/comprehensive-list-of-visualization-tools-for-biological-pathways</link>
	<title><![CDATA[Comprehensive list of visualization tools for biological pathways]]></title>
	<description><![CDATA[<p>The study of biological pathways is a key to understand the different processes inside a cell: proteins exert their function not in isolation but in a tightly controlled network of interactions and reactions. Activation of a pathway typically leads to a change of state in the cell. Pathways come in different flavors, depending on their functions in the cell &ndash; the three main types are metabolic pathways, gene regulatory pathways, and signaling pathways. These biological pathways and networks are not only an appropriate approach to visualize molecular reactions. They have also become one leading method in -omics data analysis and visualization.</p><p><img src="https://photos-1.dropbox.com/t/2/AABemz29qAuSTqSzr5mEsQE7JIMxZlU1CBy0E5n0yUVYbA/12/85115969/png/32x32/1/_/1/2/pathway.png/EOfXoUIYrJ8CIAcoBw/01qsT2eykyPvSH-rNpy3cqioDzZPc4i-xULG3BEZvCk?preserve_transparency=1&amp;size=1280x960&amp;size_mode=3" width="800" height="533" alt="image" style="border: 0px;"></p><p>Following are the comprehensive list of visualization tools for biological pathways:</p><p>BiNA</p><p>Drawings of metabolic networks supporting hiding of cofactors and drawing of chemical structures</p><p>http://bina.unipax.info/</p><p>BioTapestry</p><p>Interactive tool for building, visualizing and sharing gene regulatory network models over the web</p><p>http://www.biotapestry.org/</p><p>Caleydo</p><p>Visual analysis framework targeted at biomolecular data. Visualization of interdependencies between multiple datasets</p><p>http://www.caleydo.org/</p><p>CellDesigner</p><p>A modeling tool for biochemical networks</p><p>http://www.celldesigner.org/</p><p>Edinburgh Pathway Editor</p><p>Edit and draw pathway diagrams</p><p>http://epe.sourceforge.net/SourceForge/EPE.html</p><p>GenMAPP</p><p>Visualization of gene expression and other genomic data on maps representing biological pathways and groupings of genes</p><p>http://www.genmapp.org/</p><p>Ingenuity IPA</p><p>Data integration platform and manually annotated pathways</p><p>http://tinyurl.com/IngenuityPath</p><p>JDesigner</p><p>Graphical modeling environment for biochemical reaction networks</p><p>http://jdesigner.sourceforge.net/Site/JDesigner.html</p><p>KaPPA View</p><p>Plant pathways</p><p>http://kpv.kazusa.or.jp/</p><p>KEGG Atlas</p><p>Interactive Kyoto Encyclopedia of Genes and Genomes pathways</p><p>http://www.genome.jp/kegg/</p><p>Omix&nbsp;</p><p>Visualizing multi-omics data in metabolic networks</p><p>https://www.omix-visualization.com</p><p>PathVisio&nbsp;</p><p>Biological pathway analysis software that allows drawing, editing and analysis of biological pathways</p><p>http://www.pathvisio.org/</p><p>VitaPad&nbsp;</p><p>Application to visualize biological pathways and map experimental data to them</p><p>http://tinyurl.com/vitapad/</p><p>Web tools for pathways</p><p>ArrayXPath&nbsp;</p><p>Mapping and visualizing microarray gene-expression data and integrated biological pathway resources using SVG</p><p>http://tinyurl.com/ArrayXPath/</p><p>GEPAT&nbsp;</p><p>Integrated analysis of transcriptome data in genomic, proteomic and metabolic contexts</p><p>http://gepat.sourceforge.net/</p><p>iPath&nbsp;</p><p>Web-based tool for the visualization, analysis and customization of pathway maps</p><p>http://pathways.embl.de/</p><p>Kegg-Based Viewer&nbsp;</p><p>KEGG-based pathway visualization tool for complex high-throughput data</p><p>http://www.g-language.org/data/marray/</p><p>MapMan&nbsp;</p><p>User-driven tool that displays large datasets onto diagrams of metabolic pathways or other processes</p><p>http://mapman.gabipd.org/web/guest/mapman</p><p>MetPA&nbsp;</p><p>Analysis and visualization of metabolomic data within the biological context of metabolic pathways</p><p>http://metpa.metabolomics.ca</p><p>Omics Viewer&nbsp;</p><p>Data mapping on BioCyc pathways (collection of 5500 pathway/genome databases)</p><p>http://www.biocyc.org/</p><p>Pathway Explorer</p><p>Interactive Java drawing tool for the construction of biological pathway diagrams in a visual way and the annotation of the components and interactions between them</p><p>http://genome.tugraz.at/pathwayexplorer/pathwayexplorer_description.shtml</p><p>Pathway projector&nbsp;</p><p>Zoomable pathway browser using KEGG atlas and Google Maps API</p><p>http://www.g-language.org/PathwayProjector/</p><p>PATIKA&nbsp;</p><p>Integrated environment composed of a central database and a visual editor, built around an extensive ontology and an integration framework</p><p>http://www.cs.bilkent.edu.tr/~patikaweb/</p><p>Reactome SkyPainter&nbsp;</p><p>Visualization of over-represented pathways and reactions from gene lists</p><p>http://www.reactome.org/skypainter-2</p><p>WikiPathways</p><p>Wiki-based, open, public platform dedicated to the curation of biological pathways by and for the scientific community</p><p>http://www.wikipathways.org/</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</guid>
	<pubDate>Fri, 05 Jan 2018 04:02:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</link>
	<title><![CDATA[ECTOOLS: Long Read Correction and other Correction tools]]></title>
	<description><![CDATA[<p>Long Read Correction and other Correction tools</p>
<p>This package is a loose collection of scripts. To run the correction<br>routine see the section below. Descriptions of the other scripts<br>are at the bottom of this file.</p>
<p>Contact: gurtowsk@cshl.edu</p>
<p>In short, the correction algorithm takes as input the unitigs from a short read assembly and uses them to correct long read data. More background information for the algorithm can be found:<br>http://schatzlab.cshl.edu/presentations/2013-06-18.PBUserMeeting.pdf</p><p>Address of the bookmark: <a href="https://github.com/jgurtowski/ectools" rel="nofollow">https://github.com/jgurtowski/ectools</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36516/metassembler-merging-and-optimizing-de-novo-genome-assemblies</guid>
	<pubDate>Tue, 08 May 2018 04:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36516/metassembler-merging-and-optimizing-de-novo-genome-assemblies</link>
	<title><![CDATA[Metassembler: merging and optimizing de novo genome assemblies]]></title>
	<description><![CDATA[<p><span>Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies.</span></p>
<p><span><span>Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence.&nbsp;</span></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/metassembler/?source=directory" rel="nofollow">https://sourceforge.net/projects/metassembler/?source=directory</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>