Machine learning in bioinformatics
Machine learning in bioinformatics is the application of machine learning algorithms to bioinformatics, including genomics, proteomics, microarrays, systems biology, evolution, and text mining. Prior to the emergence of machine learning, bioinformatics algorithms had to be programmed by hand; for problems such as protein structure prediction, this proved difficult. Machine learning techniques, such as deep learning can learn features of data sets, instead of requiring the programmer to define them individually. The algorithm can further learn how to combine low-level features into more abstract features, and so on. This multi-layered approach allows such systems to  make sophisticated predictions when appropriately trained. These methods contrast with other computational biology approaches which, while exploiting existing datasets, do not allow the data to be interpreted and analyzed in unanticipated ways. In recent years, the size and number of available biological datasets have skyrocketed. Tasks. Machine learning algorithms in bioinformatics can be used for prediction, classification, and feature selection. Methods to achieve this task are varied and span many disciplines; most well known among them are machine learning and statistics. Classification and prediction tasks aim at building models that describe and distinguish classes or concepts for future prediction. The  differences between them are the following: Due to the exponential growth of information technologies and applicable models, including artificial intelligence and data mining, in addition to the access ever-more comprehensive data sets, new and better information analysis techniques have been created, based on their ability to learn. Such models allow reach beyond description and provide insights in the form of testable models. Machine learning approaches. Artificial neural networks. Artificial neural networks in bioinformatics have been used for: Feature engineering. The way that features, often vectors in a many-dimensional space, are extracted from the domain data is an important  component of learning systems. In genomics, a typical representation of a sequence is a vector of k-mers frequencies, which is a vector of dimension formula_1 whose entries count the appearance of each subsequence of length formula_2 in a given sequence. Since for a value as small as formula_3 the dimensionality of these vectors is huge (e.g. in this case the dimension is formula_4), techniques such as principal component analysis are used to project the data to a lower dimensional space, thus selecting a smaller set of features from the sequences. Classification. In this type of machine learning task, the  output is a discrete variable. One example of this type of task in bioinformatics is labeling new genomic data (such as genomes of unculturable bacteria) based on a model of already labeled data. Hidden Markov models. Hidden Markov models (HMMs) are a class of statistical models for sequential data (often related to systems evolving over time). An HMM is composed of two mathematical objects: an observed state‐dependent process formula_5, and an unobserved (hidden) state process formula_6. In an HMM, the state process is not directly observed – it is a ‘hidden’ (or ‘latent’) variable – but observations are made of a state‐dependent  process (or observation process) that is driven by the underlying state process (and which can thus be regarded as a noisy measurement of the system states of interest). HMMs can be formulated in continuous time. HMMs can be used to profile and convert a multiple sequence alignment into a position-specific scoring system suitable for searching databases for homologous sequences remotely. Additionally, ecological phenomena can be described by HMMs. Convolutional neural networks. Convolutional neural networks (CNN) are a class of deep neural network whose architecture is based on shared weights of convolution kernels or filters that slide along input features , providing translation-equivariant responses known as feature maps. CNNs take advantage of the hierarchical pattern in data and assemble patterns of increasing complexity using smaller and simpler patterns discovered via their filters. Therefore, they are lower on a scale of connectivity and complexity. Convolutional networks were inspired by biological processes in that the connectivity pattern between neurons resembles the organization of the animal visual cortex. Individual cortical neurons respond to stimuli only in a restricted region of the visual field known as the receptive field. The receptive fields of different neurons partially overlap such that they cover the entire visual  field. CNN uses relatively little pre-processing compared to other image classification algorithms. This means that the network learns to optimize the filters (or kernels) through automated learning, whereas in traditional algorithms these filters are hand-engineered. This independence from prior knowledge and human intervention in feature extraction is a major advantage. Phylogenetic convolutional neural networks. A phylogenetic convolutional neural network (Ph-CNN) is a novel convolutional neural network architecture proposed by Fioranti et al. to classify metagenomics data. In this approach, phylogenetic data is endowed with patristic distance (the sum of the lengths of all branches connecting two operational  taxonomic units [OTU]) to select k-neighborhoods for each OTU, and each OTU and its neighbors are processed with convolutional filters. Ph-CNN achieves promising results compared to fully connected neural networks, random forest and support vector machines. Random forest. Random forests (RF) classify by constructing an ensemble of decision trees, and outputting the average prediction of the individual trees. This is a modification of bootstrap aggregating (which aggregates a large collection of decision trees) and can be used for classification or regression. As random forests give an internal estimate of generalization error, cross-validation is unnecessary. In addition, they  produce proximities, which can be used to impute missing values, and which enable novel data visualizations. Computationally, random forests are appealing because they naturally handle both regression and (multiclass) classification, are relatively fast to train and to predict, depend only on one or two tuning parameters, have a built-in estimate of the generalization error, can be used directly for high-dimensional problems, and can easily be implemented in parallel. Statistically, random forests are appealing for additional features, such as measures of variable importance, differential class weighting, missing value imputation, visualization, outlier detection, and unsupervised learning. Clustering. Clustering - the partitioning  of a data set into disjoint subsets, so that the data in each subset are as close as possible to each other and as distant as possible from data in any other subset, according to some defined distance or similarity function - is a common technique for statistical data analysis. Clustering is central to much data-driven bioinformatics research and serves as a powerful computational method whereby means of hierarchical, centroid-based, distribution-based, density-based, and self-organizing maps classification, has long been studied and used in classical machine learning settings. Particularly, clustering helps to analyze unstructured and high-dimensional  data in the form of sequences, expressions, texts, images, and so on. Clustering is also used to gain insights into biological processes at the genomic level, e.g. gene functions, cellular processes, subtypes of cells, gene regulation, and metabolic processes. Clustering algorithms used in bioinformatics. Data clustering algorithms can be hierarchical or partitional. Hierarchical algorithms find successive clusters using previously established clusters, whereas partitional algorithms determine all clusters at once. Hierarchical algorithms can be agglomerative (bottom-up) or divisive (top-down). Agglomerative algorithms begin with each element as a separate cluster and merge them in successively larger clusters. Divisive algorithms begin  with the whole set and proceed to divide it into successively smaller clusters. Hierarchical clustering is calculated using metrics on Euclidean spaces, the most commonly used is the Euclidean distance computed by finding the square of the difference between each variable, adding all the squares, and finding the square root of the said sum. An example of a hierarchical clustering algorithm is BIRCH, which is particularly good on bioinformatics for its nearly linear time complexity given generally large datasets. Partitioning algorithms are based on specifying an initial number of groups, and iteratively reallocating objects among groups to convergence. This algorithm  typically determines all clusters at once. Most applications adopt one of two popular heuristic methods: k-means algorithm or k-medoids. Other algorithms do not require an initial number of groups, such as affinity propagation. In a genomic setting this algorithm has been used both to cluster biosynthetic gene clusters in gene cluster families(GCF) and to cluster said GCFs. Workflow. Typically, a workflow for applying machine learning to biological data goes through four steps: Applications. In general, a machine learning system can usually be trained to recognize elements of a certain class given sufficient samples. For example, machine learning methods  can be trained to identify specific visual features such as splice sites. Support vector machines have been extensively used in cancer genomic studies. In addition, deep learning has been incorporated into bioinformatic algorithms. Deep learning applications have been used for regulatory genomics and cellular imaging. Other applications include medical image classification, genomic sequence analysis, as well as protein structure classification and prediction. Deep learning has been applied to regulatory genomics, variant calling and pathogenicity scores. Natural language processing and text mining have helped to understand phenomena including protein-protein interaction, gene-disease relation as well as predicting biomolecule structures and  functions. Precision/personalized medicine. Natural language processing algorithms personalized medicine for patients who suffer genetic diseases, by combining the extraction of clinical information and genomic data available from the patients. Institutes such as Health-funded Pharmacogenomics Research Network focus on finding breast cancer treatments. Precision medicine considers individual genomic variability, enabled by large-scale biological databases. Machine learning can be applied to perform the matching function between (groups of patients) and specific treatment modalities. Computational techniques are used to solve other problems, such as efficient primer design for PCR, biological-image analysis and back translation of proteins (which is, given  the degeneration of the genetic code, a complex combinatorial problem). Genomics. While genomic sequence data has historically been sparse due to the technical difficulty of sequencing a piece of DNA, the number of available sequences is growing exponentially. However, while raw data is becoming increasingly available and accessible, biological interpretation of this data is occurring at a much slower pace. This makes for an increasing need for developing computational genomics tools, including machine learning systems, that can automatically determine the location of protein-encoding genes within a given DNA sequence (i.e. gene prediction). Gene prediction is commonly performed through both  extrinsic searches and "intrinsic searches". For the extrinsic search, the input DNA sequence is run through a large database of sequences whose genes have been previously discovered and their locations annotated and identifying the target sequence's genes by determining which strings of bases within the sequence are homologous to known gene sequences. However, not all the genes in a given input sequence can be identified through homology alone, due to limits in the size of the database of known and annotated gene sequences. Therefore, an intrinsic search is needed where a gene prediction program attempts to identify the remaining  genes from the DNA sequence alone. Machine learning has also been used for the problem of multiple sequence alignment which involves aligning many DNA or amino acid sequences in order to determine regions of similarity that could indicate a shared evolutionary history. It can also be used to detect and visualize genome rearrangements. Proteomics. Proteins, strings of amino acids, gain much of their function from protein folding, where they conform into a three-dimensional structure, including the primary structure, the secondary structure (alpha helices and beta sheets), the tertiary structure, and the quartenary structure. Protein secondary structure prediction is a  main focus of this subfield as tertiary and quartenary structures are determined based on the secondary structure. Solving the true structure of a protein is expensive and time-intensive, furthering the need for systems that can accurately predict the structure of a protein by analyzing the amino acid sequence directly. Prior to machine learning, researchers needed to conduct this prediction manually. This trend began in 1951 when Pauling and Corey released their work on predicting the hydrogen bond configurations of a protein from a polypeptide chain. Automatic feature learning reaches an accuracy of 82-84%. The current state-of-the -art in secondary structure prediction uses a system called DeepCNF (deep convolutional neural fields) which relies on the machine learning model of artificial neural networks to achieve an accuracy of approximately 84% when tasked to classify the amino acids of a protein sequence into one of three structural classes (helix, sheet, or coil). The theoretical limit for three-state protein secondary structure is 88–90%. Machine learning has also been applied to proteomics problems such as protein side-chain prediction, protein loop modeling, and protein contact map prediction. Metagenomics. Metagenomics is the study of microbial communities from environmental DNA samples. Currently , limitations and challenges predominate in the implementation of machine learning tools due to the amount of data in environmental samples. Supercomputers and web servers have made access to these tools easier. The high dimensionality of microbiome datasets is a major challenge in studying the microbiome; this significantly limits the power of current approaches for identifying true differences and increases the chance of false discoveries. Despite their importance, machine learning tools related to metagenomics have focused on the study of gut microbiota and the relationship with digestive diseases, such as inflammatory bowel disease (IBD), "Clostridioides difficile" infection (CDI), colorectal cancer and  diabetes, seeking better diagnosis and treatments. Many algorithms were developed to classify microbial communities according to the health condition of the host, regardless of the type of sequence data, e.g. 16S rRNA or whole-genome sequencing (WGS), using methods such as least absolute shrinkage and selection operator classifier, random forest, supervised classification model, and gradient boosted tree model. Neural networks, such as recurrent neural networks (RNN), convolutional neural networks (CNN), and Hopfield neural networks have been added. For example, in 2018, Fioravanti et al. developed an algorithm called Ph-CNN to classify data samples from healthy patients and patients with  IBD symptoms (to distinguish healthy and sick patients) by using phylogenetic trees and convolutional neural networks. In addition, random forest (RF) methods and implemented importance measures help in the identification of microbiome species that can be used to distinguish diseased and non-diseased samples. However, the performance of a decision tree and the diversity of decision trees in the ensemble significantly influence the performance of RF algorithms. The generalization error for RF measures how accurate the individual classifiers are and their interdependence. Therefore, the high dimensionality problems of microbiome datasets pose challenges. Effective approaches require many possible variable combinations, which  exponentially increases the computational burden as the number of features increases. For microbiome analysis in 2020 Dang & Kishino developed a novel analysis pipeline. The core of the pipeline is an RF classifier coupled with forwarding variable selection (RF-FVS), which selects a minimum-size core set of microbial species or functional signatures that maximize the predictive classifier performance. The framework combines: They demonstrated performance by analyzing two published datasets from large-scale case-control studies: The proposed approach improved the accuracy from 81% to 99.01% for CDI and from 75.14% to 90.17% for CRC. The use of machine learning in  environmental samples has been less explored, maybe because of data complexity, especially from WGS. Some works show that it is possible to apply these tools in environmental samples. In 2021 Dhungel et al., designed an R package called MegaR. This package allows working with 16S rRNA and whole metagenomic sequences to make taxonomic profiles and classification models by machine learning models. MegaR includes a comfortable visualization environment to improve the user experience. Machine learning in environmental metagenomics can help to answer questions related to the interactions between microbial communities and ecosystems, e.g. the work of Xun et al., in 2021  where the use of different machine learning methods offered insights on the relationship among the soil, microbiome biodiversity, and ecosystem stability. Microarrays. Microarrays, a type of lab-on-a-chip, are used for automatically collecting data about large amounts of biological material. Machine learning can aid in analysis, and has been applied to expression pattern identification, classification, and genetic network induction. This technology is especially useful for monitoring gene expression, aiding in diagnosing cancer by examining which genes are expressed. One of the main tasks is identifying which genes are expressed based on the collected data. In addition, due to  the huge number of genes on which data is collected by the microarray, winnowing the large amount of irrelevant data to the task of expressed gene identification is challenging. Machine learning presents a potential solution as various classification methods can be used to perform this identification. The most commonly used methods are radial basis function networks, deep learning, Bayesian classification, decision trees, and random forest. Systems biology. Systems biology focuses on the study of emergent behaviors from complex interactions of simple biological components in a system. Such components can include DNA, RNA, proteins, and metabolites. Machine learning has been used  to aid in modeling these interactions in domains such as genetic networks, signal transduction networks, and metabolic pathways. Probabilistic graphical models, a machine learning technique for determining the relationship between different variables, are one of the most commonly used methods for modeling genetic networks. In addition, machine learning has been applied to systems biology problems such as identifying transcription factor binding sites using Markov chain optimization. Genetic algorithms, machine learning techniques which are based on the natural process of evolution, have been used to model genetic networks and regulatory structures. Other systems biology applications of machine learning include the task  of enzyme function prediction, high throughput microarray data analysis, analysis of genome-wide association studies to better understand markers of disease, protein function prediction. Evolution. This domain, particularly phylogenetic tree reconstruction, uses the features of machine learning techniques. Phylogenetic trees are schematic representations of the evolution of organisms. Initially, they were constructed using features such as morphological and metabolic features. Later, due to the availability of genome sequences, the construction of the phylogenetic tree algorithm used the concept based on genome comparison. With the help of optimization techniques, a comparison was done by means of multiple sequence alignment. Stroke diagnosis . Machine learning methods for the analysis of neuroimaging data are used to help diagnose stroke. Historically multiple approaches to this problem involved neural networks. Multiple approaches to detect strokes used machine learning. As proposed by Mirtskhulava, feed-forward networks were tested to detect strokes using neural imaging. As proposed by Titano 3D-CNN techniques were tested in supervised classification to screen head CT images for acute neurologic events. Three-dimensional CNN and SVM methods are often used. Text mining. The increase in biological publications increased the difficulty in searching and compiling relevant available information on a given topic. This task  is known as knowledge extraction. It is necessary for biological data collection which can then in turn be fed into machine learning algorithms to generate new biological knowledge. Machine learning can be used for this knowledge extraction task using techniques such as natural language processing to extract the useful information from human-generated reports in a database. Text Nailing, an alternative approach to machine learning, capable of extracting features from clinical narrative notes was introduced in 2017. This technique has been applied to the search for novel drug targets, as this task requires the examination of information stored in biological  databases and journals. Annotations of proteins in protein databases often do not reflect the complete known set of knowledge of each protein, so additional information must be extracted from biomedical literature. Machine learning has been applied to the automatic annotation of gene and protein function, determination of the protein subcellular localization, DNA-expression array analysis, large-scale protein interaction analysis, and molecule interaction analysis. Another application of text mining is the detection and visualization of distinct DNA regions given sufficient reference data. Clustering and abundance profiling of BGCs. Microbial communities are complex assembles of diverse microorganisms, where symbiont partners constantly  produce diverse metabolites derived from the primary and secondary (specialized) metabolism, from which metabolism plays an important role in microbial interaction. Metagenomic and metatranscriptomic data are an important source for deciphering communications signals. Molecular mechanisms produce specialized metabolites in various ways. Biosynthetic Gene Clusters (BGCs) attract attention, since several metabolites are clinically valuable, anti-microbial, anti-fungal, anti-parasitic, anti-tumor and immunosuppressive agents produced by the modular action of multi-enzymatic, multi-domains gene clusters, such as Nonribosomal peptide synthetases (NRPSs) and polyketide synthases (PKSs). Diverse studies show that grouping BGCs that share homologous core genes into gene cluster  families (GCFs) can yield useful insights into the chemical diversity of the analyzed strains, and can support linking BGCs to their secondary metabolites. GCFs have been used as functional markers in human health studies and to study the ability of soil to suppress fungal pathogens. Given their direct relationship to catalytic enzymes, and compounds produced from their encoded pathways, BGCs/GCFs can serve as a proxy to explore the chemical space of microbial secondary metabolism. Cataloging GCFs in sequenced microbial genomes yields an overview of the existing chemical diversity and offers insights into future priorities. Tools such as BiG-SLiCE  and BIG-MAP have emerged with the sole purpose of unveiling the importance of BGCs in natural environments. BiG-SLiCE. BiG-SLiCE (Biosynthetic Genes Super-Linear Clustering Engine), is an automated pipeline tool designed to cluster massive numbers of BGCs. By representing them in euclidean space, BiG-SLiCE can group BGCs into GCFs in a non-pairwise, near-linear fashion. from genomic and metagenomic data of diverse organisms. The BiG-SLiCE workflow starts at vectorization (feature extraction), converting input BGCs provided from dataset of cluster GenBank files from antiSMASH and MIBiG into vectors of numerical features based on the absence /presence and bitscores of hits obtained from querying BGC gene sequences from a library curated of profile Hidden Markov Model(pHMMs) of biosynthetic domains of BGCs. Those features are then processed by a super-linear clustering algorithm based on BIRCH clustering, resulting in centroid feature vectors representing the GCF models. All BGCs in the dataset are queried back against those models, outputting a list of GCF membership values for each BGC. Then a global cluster mapping is done using k-means to group all GCF centroid features in GCF bins. After that another round of membership assignment is performed to match  the full set of BGC features into the resulting GCF bins. In the end, it produces archives, which then can be used to perform further analysis (via external scripts) or to visualize the result in a user-interactive application. Satria et al. demonstrated the utility of such analyses by reconstructing a global map of secondary metabolic diversity across taxonomy to identify the uncharted biosynthetic potential of 1.2 million biosynthetic gene clusters. This opens up new possibilities to accelerate natural product discovery and offers a first step towards constructing a global and searchable interconnected network of BGCs. As more genomes are  sequenced from understudied taxa, more information can be mined to highlight their potentially novel chemistry. BiG-MAP. Since BGCs are an important source of metabolite production, current tools for identifying BGCs focus their efforts on mining genomes to identify their genomic landscape, neglecting relevant information about their abundance and expression levels which in fact, play an important ecological role in triggering phenotype dependent-metabolite concentration. That is why in 2020 BiG-MAP (Biosynthetic Gene cluster Meta’omics Abundance Profiler), an automated pipeline that helps to determine the abundance (metagenomic data) and expression (metatranscriptomic data) of BGCs across microbial communities. It shotguns  sequencing reads to gene clusters that have been predicted by antiSMASH or gutSMASH. BiG-MAP splits its workflow in four main modules. Decodification of RiPPs chemical structures. The increase of experimentally characterized ribosomally synthesized and post-translationally modified peptides (RiPPs), together with the availability of information on their sequence and chemical structure, selected from databases such as BAGEL, BACTIBASE, MIBIG, and THIOBASE, provide the opportunity to develop machine learning tools to decode the chemical structure and classify them. In 2017, researchers at the National Institute of Immunology of New Delhi, India, developed RiPPMiner software, a bioinformatics resource for decoding RiPP  chemical structures by genome mining. The RiPPMiner web server consists of a query interface and the RiPPDB database. RiPPMiner defines 12 subclasses of RiPPs, predicting the cleavage site of the leader peptide and the final cross-link of the RiPP chemical structure. Identification of RiPPs and prediction of RiPP Class. RiPPs analysis tools such as antiSMASH and RiPP-PRISM use HMM of modifying enzymes present in biosynthetic gene clusters in RiPP to predict the RiPP subclass. Unlike these tools, RiPPMiner uses a machine learning model, trained with 513 RiPPs, that uses the amino acid sequence of the RiPP gene uniquely  to identify and subclass them. RiPPMiner differentiates RiPPs from other proteins and peptides using a support-vector machine model trained on 293 experimentally characterized RiPPs as a positive data set, and 8140 genomes encoded non-RiPPs polypeptides as negative data set. The negative data set included SWISSProt entries similar in length to RiPPs, e.g., 30s ribosomal proteins, matrix proteins, cytochrome B proteins, etc. The support vectors consist of amino acid composition and dipeptide frequencies. Benchmarking on an independent dataset (not included in training) using a two-fold cross-validation approach indicated sensitivity, specificity, precision and MCC values of 0.93, 0.90 , 0.90, and 0.85, respectively. This indicates the model's predictive power for distinguishing between RiPPs and non-RiPPs. For prediction of RiPP class or sub-class, a Multi-Class SVM was trained using the amino acid composition and dipeptide frequencies as feature vectors. During the training of the Multi-Class SVM, available RiPP precursor sequences belonging to a given class (e.g. lasso peptide) were used as a positive set, while RiPPs belonging to all other classes were used as negative set. Prediction of cleavage site. Out of the four major RiPP classes that had more than 50 experimentally characterized RiPPs  in RiPPDB, SVM models for prediction of cleavage sites were developed for lanthipeptides, cyanobactins, and lasso peptides. In order to develop SVM for prediction of cleavage site for lanthipeptides, 12 mer peptide sequences centered on the cleavage sites were extracted from a set of 115 lanthipeptide precursor sequences with known cleavage pattern. This resulted in a positive dataset of 103 unique 12 mer peptides harboring the cleavage site at the center, while the other 12 constituted the negative dataset. Feature vectors for each of these mers consisted of the concatenation of 20-dimensional vectors corresponding to each of the 20  amino acids. An SVM model for prediction of cleavage site was developed and benchmarked using 2-fold cross-validation, where half of the data were used in training and the other half in testing. SVM models were developed for the prediction of the cleavage sites in cyanobactin and lasso peptides. Based on analysis of the ROC curves, a suitable score cutoff was chosen for the prediction of cleavage sites in lanthipeptides and lasso peptides. Prediction of cross-links. The algorithm for the prediction of cross-links and deciphering the complete chemical structure of RiPP has been implemented for lanthipeptides, lasso  peptides, cyanobactins, and thiopeptides. The prediction of lanthionine linkages in lanthipeptides was carried out using machine learning. A dataset of 93 lanthipeptides whose chemical structures was known was taken from RiPPDB. For each lanthipeptide in this set, the sequence of the core peptide was scanned for strings or sub-sequences of the type Ser/Thr-(X)n-Cys or Cys-(X)n-Ser/Thr to enumerate all theoretically possible cyclization patterns. Out of these sequence strings, the strings corresponding to Ser/Thr-Cys or Cys-Ser/Thr pairs which were linked by lanthionine bridges were included in the positive set, while all other strings  were included in the negative set. Mass spectral similarity scoring. Many tandem mass spectrometry (MS/MS) based metabolomics studies, such as library matching and molecular networking, use spectral similarity as a proxy for structural similarity. Spec2vec algorithm provides a new way of spectral similarity score, based on Word2Vec. Spec2Vec learns fragmental relationships within a large set of spectral data, in order to assess spectral similarities between molecules and to classify unknown molecules through these comparisons. For systemic annotation, some metabolomics studies rely on fitting measured fragmentation mass spectra to library spectra or contrasting spectra via network analysis. Scoring functions are  used to determine the similarity between pairs of fragment spectra as part of these processes. So far, no research has suggested scores that are significantly different from the commonly utilized cosine-based similarity. Databases. An important part of bioinformatics is the management of big datasets, known as databases of reference. Databases exist for each type of biological data, for example for biosynthetic gene clusters and metagenomes. General databases by bioinformatics. National Center for Biotechnology Information. The National Center for Biotechnology Information (NCBI) provides a large suite of online resources for biological information and data, including the GenBank nucleic acid sequence  database and the PubMed database of citations and abstracts for published life science journals. Augmenting many of the Web applications are custom implementations of the BLAST program optimized to search specialized data sets. Resources include PubMed Data Management, RefSeq Functional Elements, genome data download, variation services API, Magic-BLAST, QuickBLASTp, and Identical Protein Groups. All of these resources can be accessed through NCBI. Bioinformatics analysis for biosynthetic gene clusters. antiSMASH. antiSMASH allows the rapid genome-wide identification, annotation and analysis of secondary metabolite biosynthesis gene clusters in bacterial and fungal genomes. It integrates and cross-links with a large number  of in silico secondary metabolite analysis tools. gutSMASH. gutSMASH is a tool that systematically evaluates bacterial metabolic potential by predicting both known and novel anaerobic metabolic gene clusters (MGCs) from the gut microbiome. MIBiG. MIBiG, the minimum information about a biosynthetic gene cluster specification, provides a standard for annotations and metadata on biosynthetic gene clusters and their molecular products. MIBiG is a Genomic Standards Consortium project that builds on the minimum information about any sequence (MIxS) framework. MIBiG facilitates the standardized deposition and retrieval of biosynthetic gene cluster data as well as the development of comprehensive comparative analysis tools. It  empowers next-generation research on the biosynthesis, chemistry and ecology of broad classes of societally relevant bioactive secondary metabolites, guided by robust experimental evidence and rich metadata components. SILVA. SILVA is an interdisciplinary project among biologists and computers scientists assembling a complete database of RNA ribosomal (rRNA) sequences of genes, both small (16S,18S, SSU) and large (23S, 28S, LSU) subunits, which belong to the bacteria, archaea and eukarya domains. These data are freely available for academic and commercial use. Greengenes. Greengenes is a full-length 16S rRNA gene database that provides chimera screening, standard alignment and a curated taxonomy based  on de novo tree inference. Overview: Open Tree of Life Taxonomy. Open Tree of Life Taxonomy (OTT) aims to build a complete, dynamic, and digitally available Tree of Life by synthesizing published phylogenetic trees along with taxonomic data. Phylogenetic trees have been classified, aligned, and merged. Taxonomies have been used to fill in sparse regions and gaps left by phylogenies. OTT is a base that has been little used for sequencing analyzes of the 16S region, however, it has a greater number of sequences classified taxonomically down to the genus level compared to SILVA and Greengenes. However, in terms of  classification at the edge level, it contains a lesser amount of information Ribosomal Database Project. Ribosomal Database Project (RDP) is a database that provides RNA ribosomal (rRNA) sequences of small subunits of domain bacterial and archaeal (16S); and fungal rRNA sequences of large subunits (28S).