<?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/38752?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/38752?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</guid>
	<pubDate>Sat, 03 Jun 2023 19:19:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</link>
	<title><![CDATA[homologizer: Phylogenetic phasing of gene copies into polyploid subgenomes]]></title>
	<description><![CDATA[<p dir="auto">This tutorial describes the usage of&nbsp;<code>homologizer</code>&nbsp;to phase gene copies into polyploid subgenomes. The tutorial is an abbreviated version of a soon-to-be published paper in Methods in Molecular Biology. Please see that paper for many more details and practical considerations for running&nbsp;<code>homologizer</code>&nbsp;analyses. If you use&nbsp;<code>homologizer</code>, please cite the paper in which we first describe the method:</p>
<ul dir="auto">
<li>Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes.&nbsp;<em>bioRxiv</em>&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.10.22.351486v4">2020.10.22.351486v4</a></li>
</ul>
<p dir="auto"><code>homologizer</code>&nbsp;is implemented in&nbsp;<code>RevBayes</code>. Please see&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>&nbsp;to download and install&nbsp;<code>RevBayes</code>. For users without previous&nbsp;<code>RevBayes</code>&nbsp;experience, we recommend the tutorials at&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>.</p><p>Address of the bookmark: <a href="https://github.com/wf8/homologizer" rel="nofollow">https://github.com/wf8/homologizer</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</guid>
	<pubDate>Mon, 21 Jan 2019 17:58:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</link>
	<title><![CDATA[SvABA: Genome-wide detection of structural variants and indels by local assembly]]></title>
	<description><![CDATA[<p><span>SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of&nbsp;</span><a href="https://github.com/jts/sga">SGA</a><span>&nbsp;(String Graph Assembler) by Jared Simpson, and&nbsp;</span><a href="https://github.com/lh3/bwa">BWA-MEM</a><span>&nbsp;by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using&nbsp;</span><a href="https://github.com/walaj/VariantBam">VariantBam</a><span>&nbsp;rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.</span></p><p>Address of the bookmark: <a href="https://github.com/walaj/svaba" rel="nofollow">https://github.com/walaj/svaba</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</guid>
	<pubDate>Thu, 15 Feb 2018 10:21:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</link>
	<title><![CDATA[Tallymer: method to compute K-mer frequencies and its application to annotate large repetitive plant genomes]]></title>
	<description><![CDATA[<p>Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the&nbsp;<span>k</span>-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set whole genome shotgun sequences from maize (B73) (total size 10<sup>9</sup>&nbsp;bp).&nbsp;<br>Tallymer was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available.</p>
<p>A manual can be found&nbsp;<a href="https://www.zbh.uni-hamburg.de/fileadmin/gi/tallymer/tallymer.pdf" target="_blank" title="tallymer.pdf (111 KB)">here</a>.</p><p>Address of the bookmark: <a href="https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html" rel="nofollow">https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</guid>
	<pubDate>Wed, 09 Nov 2016 16:29:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</link>
	<title><![CDATA[Method in Comparative genomics !!]]></title>
	<description><![CDATA[<p>We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.</p>
<p>We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.</p>
<p>Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.</p><p>Address of the bookmark: <a href="http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf" rel="nofollow">http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Sat, 06 Jul 2024 04:29:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p dir="auto">SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol dir="auto">
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</guid>
	<pubDate>Wed, 19 Apr 2017 04:06:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32187/chromhmm-chromatin-state-discovery-and-characterization</link>
	<title><![CDATA[ChromHMM: Chromatin state discovery and characterization]]></title>
	<description><![CDATA[<p><span>ChromHMM is software for learning and characterizing chromatin states. ChromHMM can integrate multiple chromatin datasets such as ChIP-seq data of various histone modifications to discover de novo the major re-occuring combinatorial and spatial patterns of marks. ChromHMM is based on a multivariate Hidden Markov Model that explicitly models the presence or absence of each chromatin mark. The resulting model can then be used to systematically annotate a genome in one or more cell types. By automatically computing state enrichments for large-scale functional and annotation datasets ChromHMM facilitates the biological characterization of each state. ChromHMM also produces files with genome-wide maps of chromatin state annotations that can be directly visualized in a genome browser.&nbsp;</span><br><br></p>
<ul>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM.zip">ChromHMM software v1.12</a>&nbsp;(<a href="http://compbio.mit.edu/ChromHMM/versionlog.txt">version log</a>)</li>
<li><a href="http://compbio.mit.edu/ChromHMM/ChromHMM_manual.pdf">ChromHMM manual</a></li>
</ul><p>Address of the bookmark: <a href="http://compbio.mit.edu/ChromHMM/" rel="nofollow">http://compbio.mit.edu/ChromHMM/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/859/boku-chair-of-bioinformatics</guid>
  <pubDate>Sun, 14 Jul 2013 12:37:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[Boku Chair of Bioinformatics]]></title>
  <description><![CDATA[
<p>The Bioinformatics group at Boku University has two main areas of interest, underpinning a common goal, the study of complex systems in living organisms. To overcome the engineered redundancies and combinatorial effects prevalent in higher eukaryotes, novel views augmenting the classical gene by gene approaches are required. We combine<br />Work to establish improved quantitative experimental assays (such as microarrays or differential in-gel electrophoresis) and<br />Development of modern computational methods (such as hierarchical probabilistic models or integration of heterogeneous data sources)</p>

<p>Link @ http://bioinf.boku.ac.at/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/8798/list-of-gene-ontology-software-and-tools</guid>
	<pubDate>Sun, 09 Mar 2014 14:48:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/8798/list-of-gene-ontology-software-and-tools</link>
	<title><![CDATA[List of gene ontology software and tools]]></title>
	<description><![CDATA[<p>The Gene Ontology (GO) is a set of associations from biological phrases to specific genes that are either chosen by trained curators or generated automatically. GO is designed to rigorously encapsulate the known relationships between biological terms and and all genes that are instances of these terms. These Gene Ontology has become an extremely useful tool for the analysis of genomic data and structuring of biological knowledge. Several excellent software tools for navigating the gene ontology have been developed.</p><p><img src="http://ohnosequences.com/images/GoSlimBlog.svg" alt="image" width="500" height="380" style="border: 0px; border: 0px;"></p><p>The GO provides core biological knowledge representation for modern biologists, whether computationally or experimentally based. GO resources include biomedical ontologies that cover molecular domains of all life forms as well as extensive compilations of gene product annotations to these ontologies that provide largely species-neutral, comprehensive statements about what gene products do. Although extensively used in data analysis workflows, and widely incorporated into numerous data analysis platforms and applications, the general user of GO resources often misses fundamental distinctions about GO structures, GO annotations, and what can and can not be extrapolated from GO resources. Here are ten quick tips for using the Gene Ontology.</p><p>Read "Ten Quick Tips for Using the Gene Ontology" at http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1003343</p><p>Following are the most commonly used old and new GO term enrichment determination tools. These tools are recommended to people working in a wet-lab.</p><p><strong>CLASSIFI (Department of Pathology, UT Southwestern Medical Center)</strong></p><p>CLASSIFI (Cluster Assignment for Biological Inference) is a data-mining tool that can be used to identify significant co-clustering of genes with similar functional properties (e.g. cellular response to DNA damage). Briefly, CLASSIFI uses the Gene OntologyTM (GO) gene annotation scheme to define the functional properties of all genes/probes in a microarray data set, and then applies a cumulative hypergeometric distribution analysis to determine if any statistically significant gene ontology co-clustering has occurred.</p><p><a href="http://pathcuric1.swmed.edu/pathdb/classifi.html">http://pathcuric1.swmed.edu/pathdb/classifi.html</a></p><p><strong>EasyGO (China Agricultural University)</strong></p><p>EasyGO is designed to automate enrichment job for experimental biologists to identify enriched Gene Ontology (GO) terms in a list of microarray probe sets or gene identifiers (with expression information for PAGE analysis). Also EasyGO is also a GO annotation database, especially focus on agronomical species, supporting 30 species. It is user friendly, with advanced result browsing format and in-time update.</p><p><a href="http://bioinformatics.cau.edu.cn/neweasygo/">http://bioinformatics.cau.edu.cn/neweasygo/</a></p><p><a href="http://bioinformatics.cau.edu.cn/easygo/">http://bioinformatics.cau.edu.cn/easygo/</a></p><p><strong>g:GOSt (Institute of Computer Science, University of Tartu)</strong></p><p>g:GOSt retrieves most significant Gene Ontology (GO) terms, KEGG and REACTOME pathways, and TRANSFAC motifs to a user-specified group of genes, proteins or microarray probes. g:GOSt also allows analysis of ranked or ordered lists of genes, visual browsing of GO graph structure, interactive visualisation of retrieved results, and many other features. Multiple testing corrections are applied to extract only statistically important results.</p><p><a href="http://biit.cs.ut.ee/gprofiler/">http://biit.cs.ut.ee/gprofiler/</a></p><p><strong>DAVID</strong> : Gene Functional Classification (Laboratory of Immunopathogenesis and Bioinformatics, NIAID)</p><p>The Functional Classification Tool provides a rapid means to organize large lists of genes into functionally related groups to help unravel the biological content captured by high throughput technologies.</p><p><a href="http://david.abcc.ncifcrf.gov/gene2gene.jsp">http://david.abcc.ncifcrf.gov/gene2gene.jsp</a></p><p><a href="http://david.abcc.ncifcrf.gov/">http://david.abcc.ncifcrf.gov/</a></p><p>API <a href="https://github.com/chrisamiller/davidapi">https://github.com/chrisamiller/davidapi</a></p><p><strong>GOEAST</strong> (Institute of Genetics and Developmental Biology, Chinese Academy of Sciences)</p><p>GOEAST is web based software toolkit providing easy to use, visualizable, comprehensive and unbiased Gene Ontology (GO) analysis for high-throughput experimental results, especially for results from microarray hybridization experiments. The main function of GOEAST is to identify significantly enriched GO terms among give lists of genes using accurate statistical methods.</p><p><a href="http://omicslab.genetics.ac.cn/GOEAST/">http://omicslab.genetics.ac.cn/GOEAST/</a></p><p><strong>GOstat</strong> (Walter and Eliza Hall Institute of Medical Research)</p><p>Find statistically overrepresented GO terms within a group of genes</p><p><a href="http://gostat.wehi.edu.au/">http://gostat.wehi.edu.au/</a></p><p><strong>GOrilla</strong> (Technion - Laboratory of Computational Biology , Israel Institute of Technology)</p><p>GOrilla is a tool for identifying and visualizing enriched GO terms in ranked lists of genes.<br /> It uses two approaches, first by searching for enriched GO terms that appear densely at the top of a ranked list of genes&nbsp; or by searching for enriched GO terms in a target list of genes compared to a background list of genes.</p><p><a href="http://cbl-gorilla.cs.technion.ac.il/">GOrilla</a> makes nice pictures !!!!</p><p><a href="http://cbl-gorilla.cs.technion.ac.il/">http://cbl-gorilla.cs.technion.ac.il/</a></p><p><strong>Gene Ontology for Functional Analysis (GOFFA)</strong></p><p>GOFFA is a tool developed for ArrayTrack&trade; that takes a list of genes and identifies terms in Gene Ontology (GO) disclaimer icon associated with those genes.</p><p>It provides several tools to view/access the GO term hierarchy, full listing of GO terms annotated with the genes associated with a given term with statically useful report.</p><p><a href="http://www.fda.gov/ScienceResearch/BioinformaticsTools/ucm233315.htm">http://www.fda.gov/ScienceResearch/BioinformaticsTools/ucm233315.htm</a></p><p><strong>GOAT</strong> (The University of Manchester)</p><p>The aim of the GOAT project is to create an application that will guide users, especially biomedical researchers, in the annotation of gene products with terms from the <a href="http://www.geneontology.org">Gene Ontology</a>.</p><p><a href="http://goat.man.ac.uk/">http://goat.man.ac.uk/</a></p><p>Script <a href="https://github.com/tanghaibao/goatools/">https://github.com/tanghaibao/goatools/</a></p><p><strong>REVIGO</strong> ( Rudjer Boskovic Institute, Croatia)</p><p>REViGO is a web server that can take long lists of Gene Ontology terms and summarize them by removing redundant GO terms. The remaining terms can be visualized in semantic similarity-based scatterplots, interactive graphs, or tag clouds.</p><p><a href="http://revigo.irb.hr/">http://revigo.irb.hr/</a></p><p><strong>QuickGo</strong> (EMBL-EBI Institute)</p><p>It uses extensive computational filters to allow the generation of specific subsets of GO annotations, mapped to sequence identifiers of your choice. Then GO slims are used which is collective list of GO full set of terms available from the Gene Ontology project.</p><p><a href="http://www.ebi.ac.uk/QuickGO/">http://www.ebi.ac.uk/QuickGO/</a></p><p><strong>GOLEM</strong></p><p>An interactive graph-based gene-ontology navigation and analysis tool. GOLEM is a userful tool which allows the viewer to navigate and explore a local portion of the <a href="http://www.geneontology.org/">Gene Ontology</a> (GO) hierarchy.</p><p><a href="http://reducio.princeton.edu/GOLEM/">http://reducio.princeton.edu/GOLEM/</a></p><p><strong>BGI Web Gene Ontology (WEGO)</strong> Annotation Plot (Beijing Genomics Institute)</p><p>WEGO () is a useful tool for plotting GO annotation results. It has been widely used in many important biological research projects, such as the rice genome project [<a href="http://wego.genomics.org.cn/pubs/rice_indica.pdf">Yu, J. et al. Science 296, 79-92 (2002);</a> <a href="http://wego.genomics.org.cn/pubs/rice_finish.pdf">Yu, J. et al. PLoS Biol 3, e38 (2005)</a>] and the silkworm genome project [<a href="http://wego.genomics.org.cn/pubs/combine_silkworm.pdf">Xia, Q. et al. Science 306, 1937-40 (2004)</a>]. It has become one of the daily tools for downstream gene annotation analysis, especially when performing comparative genomics tasks. WEGO along with two other tools, namely <a href="http://wego.genomics.org.cn/cgi-bin/wego/External2GO.pl">External to GO Query</a> and <a href="http://wego.genomics.org.cn/cgi-bin/wego/GOArchive.pl">GO Archive Query</a>, are freely available for all users. Any suggestions are welcome at <a href="mailto:%20wego@genomics.org.cn">wego@genomics.org.cn</a>. Here is a sample output generated by WEGO</p><p><a href="http://wego.genomics.org.cn/cgi-bin/wego/index.pl">http://wego.genomics.org.cn/cgi-bin/wego/index.pl</a></p><p><strong>GeneGO MetaCore</strong> (MIT)</p><p>GeneGo is a leading provider of data mining &amp; analysis solutions in systems biology. MetaCore, GeneGo's flapship product, is an integrated software suite for functional analysis of experimental data. MetaCore is based on a curated database of human protein-protein, protein-DNA interactions, transcription factors, signaling and metabolic pathways, disease and toxicity, and the effects of bioactive molecules.</p><p><a href="https://portal.genego.com/">https://portal.genego.com/</a></p><p><strong>GOEx</strong> (Stony Brook University)</p><p>GOEx facilitates organism-specific studies by leveraging GO and providing a rich graphical user interface. It is a simple to use tool, specialized for biologists who wish to analyze spectral counting data from shotgun proteomics.</p><p><a href="http://pcarvalho.com/patternlab">http://pcarvalho.com/patternlab</a></p><p><strong>GOssTo</strong></p><p>GOssTo and GOssToWeb are tools to calculate the <a href="https://en.wikipedia.org/wiki/Semantic_similarity#Biomedical_Informatics">semantic similarity</a> between genes or terms in the <a href="http://www.geneontology.org/">Gene Ontology</a>.</p><p><a href="http://www.paccanarolab.org/gosstoweb/">http://www.paccanarolab.org/gosstoweb/</a></p><p><strong>GO Workbench</strong></p><p>The Gene Ontology Analysis Viewer allows direct browsing of the Gene Ontology, and also the visualization of GO Term analysis results.</p><p><a href="http://wiki.c2b2.columbia.edu/workbench/index.php/Gene_Ontology_Viewer">http://wiki.c2b2.columbia.edu/workbench/index.php/Gene_Ontology_Viewer</a></p><p>Some other useful list of GO software and tools is available at <a href="http://www.geneontology.org/GO.tools.shtml#browser">http://www.geneontology.org/GO.tools.shtml#browser</a></p><p>Yet another useful webpage with list of GO tools at <a href="http://neurolex.org/wiki/Category:Resource:Gene_Ontology_Tools">http://neurolex.org/wiki/Category:Resource:Gene_Ontology_Tools</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>