Moara: a Java library for extracting and normalizing gene and protein mentions
© Neves et al; licensee BioMed Central Ltd. 2010
Received: 10 June 2009
Accepted: 26 March 2010
Published: 26 March 2010
Gene/protein recognition and normalization are important preliminary steps for many biological text mining tasks, such as information retrieval, protein-protein interactions, and extraction of semantic information, among others. Despite dedication to these problems and effective solutions being reported, easily integrated tools to perform these tasks are not readily available.
This study proposes a versatile and trainable Java library that implements gene/protein tagger and normalization steps based on machine learning approaches. The system has been trained for several model organisms and corpora but can be expanded to support new organisms and documents.
Moara is a flexible, trainable and open-source system that is not specifically orientated to any organism and therefore does not requires specific tuning in the algorithms or dictionaries utilized. Moara can be used as a stand-alone application or can be incorporated in the workflow of a more general text mining system.
Some of the most important steps in the analysis of scientific literature are related to the extraction and normalization of genes and proteins in the text and their association with the particular entry in a corresponding biological database. These are known as gene/protein recognition and normalization tasks, respectively, and are common preceding steps to complex text mining tasks.
The main difficulties relating to gene/protein recognition and normalization tasks are the large number of existing gene and protein entities and a lack of rules concerning nomenclature, or the resistance of the scientific community to its use . Some entities coincide with common English words (e.g., "deafness"), which complicates their detection in free-form text. In addition, nomenclature can appear as long descriptive names (e.g., "tumor necrosis factor") or as acronyms (e.g., "TNF"), making normalization difficult. Furthermore, some existing biological entities are known by more than one name and some newly-discovered entities have been assigned a name that is already in use for an existing gene or protein.
For gene normalization, different organisms might require different strategies  or specific curated dictionaries [3, 4], depending on the complexity of their nomenclature and the degree of ambiguity in the assigned synonyms. This is a problem because a name may or may not refer to distinct entities of the same organism. Gene/protein extraction and normalization tasks are extremely important, and have received much attention from the scientific community. BioCreative evaluation [5–7] is one example of a community-wide effort to evaluate text mining systems applied to the field of biology.
Many solutions have been proposed for gene/protein recognition  and normalization [6, 7] tasks. There are freely available taggers, but a mix of them is desirable in order to extract the maximum mentions of an entity from a text. For gene/protein extraction, Banner , ABNER  and GENIA  produce good results based on Conditional Random Fields , as well as the U-Compare framework . Web available systems including GNAT  and Whatizit  are available for normalization tasks. Despite research into the development of gene/protein recognition and normalization methodologies, the search continues for reliable systems and dictionaries of synonyms that can be easily integrated into more general text mining systems.
Moara, which comes as a freely available Java library, could be an alternative to these systems. Gene/protein recognition is carried out by a Case-based reasoning approach (CBR-Tagger), and a machine learning methodology that uses an organism-independent strategy is proposed (ML-Normalization) for normalization steps. The normalization procedure is currently available for Saccharomyces cerevisiae (yeast), Mus musculus (mouse), Drosophila melanogaster (fly) and Homo sapiens (human), but can be trained with new organisms. The results presented in the supplementary material demonstrate the suitability of these strategies for gene/protein tagging and normalization tasks.
The Moara project is a Java library oriented to gene/protein recognition and normalization tasks, carried out by CBR-Tagger and ML-Normalization, respectively. The system makes use of some MySQL databases and three external libraries: the Weka machine learning tool , SecondString http://secondstring.sourceforge.net/ library for string distance metrics, and ABNER  as an additional tagger for the extraction of mentions.
MySQL databases store data that have been learned by the system during training phases and external data that are necessary for some of the functionalities of the system. The four databases in Moara are listed below:
moara: contains general and biological data that are of use for the functionalities in the project. This database holds the data related to stopwords http://moara.dacya.ucm.es/download.html, Biothesaurus biomedical terms http://pir.georgetown.edu/pirwww/iprolink/biothesaurus.shtml and a list of all organisms present in Entrez Gene Taxonomy http://www.ncbi.nlm.nih.gov/Taxonomy/, and is essential for all functionalities of the Moara project.
moara_mention: contains data (cases) that are learned during the training step of CBR-Tagger; it is used for extracting gene/protein mentions from texts.
moara_gene: contains data related to the genome, and a dictionary of synonyms of the organisms under consideration. The current version supports yeast, mouse, fly and human. This data are used for both the matching procedure and the disambiguation strategy of the gene/protein normalization task.
moara_normalization: contains data related to the transformations that have been applied to the gene/protein synonyms in order to compose the features that take part in the machine learning matching procedure of the normalization task.
This section describes the methodology that was used in the development of both systems, as well as the details of the available functionalities in version 1.0.5 of the Moara Project. For the sake of simplicity only a straightforward example will be shown. The documentation page http://moara.dacya.ucm.es/documentation.html supplies complete code examples.
Example of use
For the normalization function, the array of extracted mentions must be provided, as well as the original text, which is necessary for the disambiguation step. The mentions may be extracted by a tagger, the ones provided at Moara project - ABNER and CBR-Tagger - or any external one. Moara does not restrict the use of any tagger. In the normalization procedure, a matching procedure is carried out and one or more candidates can be chosen, normally the one with highest score (single disambiguation) or the top scored ones according to an automatically defined threshold (multiple disambiguation).
Extraction of mentions
Gene/protein recognition is carried out by the CBR-Tagger , a tagger based on Cased-based reasoning (CBR) foundations. Case-based reasoning  is a machine learning method that consists of learning cases from training documents and retrieving the case most similar to a given problem during the testing step. From this case, the final solution is obtained. One of the advantages of the CBR algorithm is the possibility, by means of checking the features that compose the case-solution, of getting an explanation of why a certain category has been assigned to a given token. In addition, the base of cases can be used as a natural source of knowledge from which to learn extra information about the training dataset, i.e., the number of tokens (or cases) that share a certain value of a feature. Moara provides the possibility of extracting mentions from a text using CBR-Tagger and training it with extra documents. In addition, a wrapper of the ABNER tagger  was developed in order to use its mentions without the need to learn the ABNER library.
Training the CBR-Tagger
There are five built-in models in the "moara_mention" database; one model trained with the BioCreative 2 Gene Mention task alone and four models trained with the latter in combination with the BioCreative task 1B corpora for the yeast, mouse and fly and the three. This section explains the training strategy of the system and how it can be trained for extra documents.
First, several cases of the classes considered here (gene mention or not) are stored in two bases, one storing known and the other storing unknown cases . The known cases are used by the system to classify tokens that are not new, i.e. tokens that have appeared in the training documents. The attributes used to represent a known case are the token itself, the category of the token (if it is a gene mention or not), and the category of the preceding token (if it is a gene mention or not). Each token represents a single case, and repetition of cases with exactly the same attributes is not allowed. In order to account for repetitions, the frequency of the case is incremented to indicate the number of times that it appears in the training dataset.
The unknown base is used to classify tokens that were not present in the training documents. The unknown cases are built over the same training data used for the known cases. Instead of saving the token itself, a shape of the token is kept in order to allow the system to classify unknown tokens by looking for cases with similar shape. Therefore, as in the known cases, the attributes that have been used to represent the unknown cases are the shape of the token, the category of the token (if it is a gene mention or not), and the category of the preceding token (if it is a gene mention or not). The system saves these attributes for each token in the sentence as an unknown case. As with known cases, no repetition is allowed and instead the frequency of the case is incremented.
The shape of the token is given by its transformation into a set of symbols according to the type of character found: "A" for any upper case letter; "a" for any lower case letter; "1" for any number; "p" for any token in a stopwords list; "g" for a Greek letter; "$" for identifying 3-letter-prefixes and 4-letter-suffixes in a token. For example, "Dorsal" is represented by "Aa", "Bmp4" by "Aa1", "the" by "p", "cGKI(alpha)" by "aAAA(g)", "patterning" by "pat$a" ('$' separates the 3-letter prefix) and "activity" by "a$vity" ('$' separates the 4-letters suffix). The symbol that represents an uppercase letter ("A") can be repeated to take into account the number of letters in an acronym, as shown in the example above. However, the lowercase symbol ("a") is not repeated; suffixes and prefixes are considered instead. These are automatically extracted from each token by considering the last 4 letters and first 3 letters, respectively; they do not come from a predefined list of common suffixes and prefixes.
CBR-Tagger has been trained with the training set of documents made available during the BioCreative 2 Gene Mention task  and with additional corpora to improve the extraction of mentions from different organisms. These extra corpora belong to the gene normalization datasets for the BioCreative task 1B  corresponding to yeast, mouse and fly gene/protein normalization. These training datasets will be referred to hereafter as CbrBC2, CbrBC2y, CbrBC2m, CbrBC2f and CbrBC2ymf, depending if they are composed by the BioCreative 2 Gene Mention task corpus alone or combined with the BioCreative task 1B corpus for the yeast, mouse, fly or all three, respectively. Two functionalities are available in CBR-Tagger: extraction of the mentions with the built-in models and training a new CBR-Tagger with extra documents.
CBR-Tagger can be trained with extra corpora if the documents are provided in the format used in the BioCreative 2 Gene Mention task, in which the text of the documents and the annotated gene/protein mentions are provided in two distinct files. For example, the sentence below (PubMed 30937) was part of the BioCreative 2 Gene Mention task training corpus identified by P00030937A0119.
P00030937A0119 SGPT, SGOT, and alkaline phosphatase concentrations were essentially normal in all subjects.
The mentions that are present in the sentence are listed as follows:
P00030937A0119|13 31|alkaline phosphatase
The position of the mention in the original text is represented by the position of the first and last characters of the token, with no consideration of the spaces in the original text. Additionally, cases that have been learned for CBR-Tagger beforehand, from the aforementioned five training datasets, can also be considered. CBR-Tagger provides a method for copying cases automatically, without the need to train the tagger for the latter corpora. More than one tagger can be trained, although a short identifier must be provided for use as part of the name of the tables in the database.
The codes below illustrate the training of CBR-Tagger using the data generated by training the tagger with the BioCreative 2 Gene Mention dataset , and documents provided in the specified files, in the format discussed above:
. . .
TrainTagger tt = new TrainTagger();
. . .
Extraction of mentions with CBR-Tagger
During the testing step, the system searches the known and unknown bases for the case most similar to the problem and a classification decision is given by the class of the case selected as being most similar. The classification procedure works in a similar way to the construction of cases. The text is tokenized and a sliding window is applied in the forward direction and then in the backward direction. In each case, the system keeps track of the category of the preceding token (false at the beginning), gets the shape of the token (according to the symbols described above) and attempts to find a case most similar to it in the base. If more than one case if found, the one with the higher frequency is chosen.
The search procedure is separated into two parts, one for the known cases and another for unknown cases. In this search strategy, priority is given to the known cases. For known cases, the token is saved exactly as it appeared in the training documents, and the classification is more precise than using unknown cases. The system also separates the token into parts in order to classify them individually. Although CBR life cycle  allows the re-training of the system with the experience learnt from retrieved cases, the CBR-Tagger does not include this step.
The "moara_mention" database contains five built-in models; one model trained with the BioCreative 2 Gene Mention task alone and in combination with the corpora for the yeast, mouse and fly, and three trained with BioCreative task 1B. Therefore five constants are available according to the set of documents used for training the tagger. Line 40 in Figure 2 shows an example of the function that extracts the mention using the tagger trained with the CbrBC2 dataset. There is no requirement to retrain the system; all these models are included by default in the specified database. The extraction method receives two string arguments: the predefined or user-specific model used to train the tagger and the text from which the mention are to be recognized.
When adding a new organism to Moara, the user does not need to train CBR-Tagger with specific documents; it is possible but not mandatory. We have implemented these specific models for the yeast, mouse and fly because these were the organisms for which annotated corpora are available from BioCreative tasks. The user can always use the CbrBC2 model or any other tagger that is available.
Extraction of mentions with ABNER
We have developed a wrapper for the ABNER tagger  in order to allow a mix of taggers to be used when extracting mentions, with no need to learn the details of an extra library. ABNER comes with two models based on the corpora of the NLPBA http://www-tsujii.is.s.u-tokyo.ac.jp/GENIA/ERtask/report.html and BioCreative task 1A challenges. We have constructed five more models for ABNER, namely CbrBC2, CbrBC2y, CbrBC2m, CbrBC2f and CbrBC2ymf, by training it with the same datasets that were used for CBR-Tagger. The code below illustrates the use of the ABNER wrapper for a given text:
. . .
AbnerTagger abner = new AbnerTagger(WrapperConstant.ABNER_BC2);
ArrayList<GeneMention> gms = abner.extract(text);
. . .
Normalization of mentions
The normalization task is accomplished by ML-Normalization, which consists of a flexible and a machine learning matching approach as well as a disambiguation strategy based on the text under consideration. Organism-specific data previously extracted from the genome databases are also required at this step. More importantly, ML-Normalization uses freely available minimum organism-specific data. This is especially useful if no specifically tailored dictionary is available. The normalization step was trained for the four supported organisms considered here: yeast, mouse, fly and human. For the matching strategy, a flexible and a machine learning based matching were available.
Normalizing mentions by flexible matching
Flexible matching is accomplished by exact matching between the mention extracted from the text and the synonyms in the dictionaries. It is flexible because the mention and the synonyms are previously pre-processed by dividing the token according to punctuations, numbers, Greek letters, and BioThesaurus terms, and finally ordering the parts of the token alphabetically. The initial lists of synonyms for the four organisms were available in the two editions of the BioCreative challenge: BioCreative task 1B  for yeast, mouse and fly; and BioCreative 2 gene normalization task  for humans. The code presented in Figure 2 (line 45 to 48) illustrates the flexible matching normalization for a given text.
For both flexible and machine learning matching, the normalization method receives the array of mentions ("GeneMention" objects) and the original text, which can be used for the disambiguation strategy, as illustrated in Figure 2 (line 48). The output of the normalization procedure is stored in the same array of "GeneMention" objects, and each object can be associated with one or more "GenePrediction" objects that keep track of the candidates that were matched to the respective mention according to the matching strategy under consideration. However, a mention ("GeneMention" object) may have no associated candidates.
Using the dictionary of synonyms
We have made available a list of the pre-processed synonyms used in our flexible matching strategy http://moara.dacya.ucm.es/download.html. This allows the option of using our dictionary of synonyms with other matching procedures. However, it should be noted that the same pre-processing procedure must be carried out for the mentions under consideration. We have made available a specific function for this task, which receives the text of the mention and returns a list of variations of the specified text, as shown in the example below:
. . .
Organism yeast = new Organism(Constant.ORGANISM_YEAST);
ExactMatchingNormalization app = new ExactMatchingNormalization(yeast);
String text = "alpha subunit of the rod cGMP-gated channel";
ArrayList<String> variations = app.getFlexibleMentions(text);
. . .
The variations of a mention (or synonym) are generated by applying a set of editing procedures to the text, such as breaking the text according to parentheses, numbers and Greek letters, ignoring punctuations and symbols, and filtering tokens such as stopwords and biomedical terms. In order to illustrate the tokenization procedure, the input "YPK1 and YKR2(YPK2) genes" would be separated according to the parenthesis into "YPK1 and YKR2 genes" and "YPK2". The former would be separated into smaller parts, as long as the part is a valid token, i.e., it is not a BioThesaurus term or a stopword. Thus, the "YPK1 and YKR2 genes" would be separated into "YPK1" and "YKR2".
Biomedical terms are filtered in such a way that the number of terms in the BioThesaurus that are ignored from the text is increased according to their frequency in this lexicon. Only those terms with frequencies higher than 10,000 are filtered before the procedure is repeated for terms with frequencies higher than 1,000, 100, 50, 10 or zero (all terms). This procedure generates many variations of the original mention (or synonym).
Regarding the BioThesaurus, we consider the complete lexicon in our filtering step, i.e., the files identified as "BioMedical terms", "Chemical terms", "Macromolecules" ("enzymes", "single word names" and "general names"), "Common English" and "Single non-word tokens". We perform filtering for the terms identified as "gn" and "pr", as they indicate tokens that refer to genes and proteins.
Training of the flexible matching normalization
Moara is trained for using the flexible matching strategy with four organisms: yeast, mouse, fly and human. However, new organisms may be added to the system by providing general available information such as the code of the specified organism in NCBI Taxonomy. For example, in order to train the system for Bos taurus, the identifier "9113" must be used. The table "organism" in the "moara" database contains all the organisms present in NCBI Taxonomy. The system will automatically create the necessary tables related to the new organism, including the table that saves information related to the gene/protein synonyms. These tables are easily identified in the database as they are preceded by a nickname such as "yeast" for Saccharomyces cerevisiae; in the case of Bos Taurus, "cattle" would be an appropriate nickname. Minimum organism-specific information must be provided, for example the "gene_info.gz" and "gene2go.gz" files from Entrez Gene FTP ftp://ftp.ncbi.nih.gov/gene/DATA/, but no gene normalization class needs to be created. An example of training the system for Bos Taurus is outlined below:
. . .
Organism cattle = new Organism("9913");
String name = "cattle";
String directory = "normalization";
TrainNormalization tn = new TrainNormalization(cattle);
. . .
Normalizing mentions by machine learning matching
In addition to flexible matching, an approximated machine learning matching is provided for the normalization procedure. The strategy is based on the methodology proposed by Tsuruoka et al. , but using the Weka implementation of the Vector Machines (SVM), and Random Forests or Logistic Regression as the machine learning algorithms. In the proposed methodology, the attributes of the training examples are obtained by comparing two synonyms from the dictionary according to predefined features. When the comparison is between two different synonyms for the same gene/protein, it constitutes a positive example for the machine learning algorithm; otherwise, it is a negative example.
The training of the machine learning matching is a three-step procedure in which the data produced in each phase are retained for further use. All the synonyms of its dictionary are represented with the features under consideration, hereafter called "synonym-features": 3-letter-prefix, 3-letters-suffix, a number that is part of the synonym, a Greek letter that is part of the synonym, bigram and trigram and the shape of the synonym, the same features used in the CBR-Tagger. In the second step, pairs of synonyms are chosen on the basis of their similarity, or more precisely, on the percentage of bigrams and trigrams they have in common. This is a time-consuming step and the data obtained are stored for further use. Several experiments have been carried out for different values of the percentage of similarity (0.6, 0.7, 0.8 and 0.9) for both bigram and trigrams. During the third step the system extracts the features that represent the comparison of the synonym-features of the previously selected positive and negative pairs of synonyms, hereafter called "pair-features". These features are indicative of equal prefix, suffix, number and Greek letter, bigram/trigram similarity, string similarity and shape similarity. String similarity is established using the SecondString Java library and experiments have been accomplished for the following string distances : Levenstein, Jaro-Winkler, Smith-Waterman, Monge-Elkan and Soft-TFIDF. These features are used for training the classifiers with one of the available machine learning algorithms: Support Vector Machines, Random Forests or Logistic Regression.
During the testing step, when mentions are presented to be normalized, the system repeats the three-step procedure for each mention: the features of the mentions are extracted (synonym-features); the system selects the candidate synonyms according to a certain percentage of bigram/trigram similarity between the synonyms and the given mention; the features of the selected pairs (pair-features) are extracted to be presented to the machine learning algorithm and to be classified as positive or negative. If a pair of mention-synonyms is classified as positive, the identifier of the respective synonym is set as the gene/protein identifier of the given mention and the normalization task is over. A disambiguation strategy is carried out when more than one pair of mention-synonyms are classified as positive, allowing the best identifier to be chosen from the candidates.
Listed below are the parameters that can be chosen when using machine learning matching for the gene/normalization task:
Percentage similarity: any value between 0 and 1 (0.9 by default);
Selection of the pair of mention-synonyms: bigram or trigram similarity, or both (default option);
Machine learning algorithm: Support Vector Machines (default option), Random Forests or Logistic Regression;
Set of pair-features: all of them (indicative of equal prefixes, suffixes, numbers and Greek letters, bigram/trigram similarity, string similarity and shape similarity) or just the best of them (bigram/trigram similarity, number and string similarity) (default option).
String similarity method: Levenstein, Jaro-Winkler, Smith-Waterman (default option), Monge-Elkan or Soft-TFIDF.
The default values shown in the list of parameters above represent the configuration of the system that works reasonably well for the four organisms we have considered (yeast, mouse, fly and human). Therefore, Moara comes with four previously learned models using the default values, one for each of the organisms under consideration. The example below demonstrates how to normalize the previously extracted mention using machine learning matching.
. . .
ArrayList<GeneMention> gms = gr.extract (MentionConstant.MODEL_BC2,text);
MachineLearningNormalization gn = new MachineLearningNormalization(human);
gms = gn.normalize(text,gms);
. . .
Training of the machine learning matching
Training the machine learning matching is possible for values of parameters outside the built-in models, as well as for new organisms. In the latter case, the procedure to be used is the same as the one presented for flexible matching, with the exception that we must ask the system to generate data for the machine learning matching as well. An example is shown below:
. . .
Organism cattle = new Organism("9913");
String name = "cattle";
String directory = "normalization";
TrainNormalization tn = new TrainNormalization(cattle);
In order to normalize the mentions using a model based on parameters others than the default ones, the system must first be trained to create the specified model. This procedure can be time-consuming depending on the number of synonyms for the organism under consideration as well as the parameters that have been chosen. The code below demonstrates how to train a model for Bos taurus according to the specified parameters:
. . .
Organism cattle = new Organism("9913");
MachineLearningModel mlm = new MachineLearningModel(cattle);
. . .
The "MachineLearningModel" class provides functions for setting any of the parameters discussed above. The system would be ready for normalizing the mentions using the previously trained model. In order that the system uses the model under consideration rather than the default one, the parameters for the "MachineLearningNormalization" class must be explicitly specified, as carried out for the "MachineLearningModel" class. The example below illustrates how to normalize the mention for Bos taurus using the previously trained model:
. . .
ArrayList<GeneMention> gms = gr.extractBC2(text);
MachineLearningNormalization gn = new MachineLearningNormalization(human);
gms = gn.normalize(text,gms);
. . .
Disambiguation of identifiers
When more than one identifier is obtained for a mention, a disambiguation procedure is used to decide which is more likely to be correct. The selection decision is performed by comparing the similarity between the abstract of the article and a document representative of each of the genes/proteins (gene-document). The gene-document is constructed by compiling information extracted from several databases, such as SGD http://www.yeastgenome.org/ for yeast, MGI http://www.informatics.jax.org/ for mouse, FlyBase http://flybase.org/ for the fly and Entrez Gene http://www.ncbi.nlm.nih.gov/sites/entrez?db=gene for humans. The fields collected for the construction of the gene-documents were symbols, aliases, descriptions, summaries, products, phenotypes, relationships, interactions, Gene Ontology http://www.geneontology.org/ terms related to the gene and their names, definition and synonyms.
Three disambiguation methodologies can be selected. The first considers the cosine similarity  between the article and the gene-documents, while the second takes into account the number of common tokens between the two texts. In the first case, the gene-document with the highest cosine similarity is chosen as the correct identifier for the mention. In the second case, the gene-document with highest number of common tokens is chosen as the best solution. The third methodology, based the decisions on both the higher product of the cosine similarity and the number of common tokens, is the default option.
Choosing between single (default option) and multiple disambiguation selection is possible at this step. The single option selects only the best candidate; the multiple selection selects the top scored ones according to a given threshold. The threshold is not a fixed value; it is automatically calculated for each mention and it is given by 50% of the value of the highest score. For example, a mention was matched to four candidates with scores of 0.9, 0.7, 0.5 and 0.4. Using single disambiguation, the only answer is the candidate with best score, 0.9. Using multiple disambiguation, the threshold is automatically calculated as 50% of the highest score, therefore 0.45. The candidates with scores 0.9, 0.7 and 0.5 would be returned by the system as their scores are higher than the threshold. The code of Figure 2 (lines 46-47) shows an example of how to normalize the mention with flexible matching using a disambiguation strategy distinct from the default.
Results for the CBR-Tagger evaluated with the BioCreative 2 GM test set
Results for the ML-Normalization evaluated with the test corpora
(BioCreative and GNAT)
Machine learning matching
Although machine learning matching often produces poorer results than exact matching, it is a useful alternative when working with new organisms where the user has no indication of the performance of exact matching. In addition, machine learning produces better recall performance than exact matching, although it is not as precise. In cases where higher recall is needed, machine learning is the best alternative to use.
The results demonstrate that the methodology implemented in Moara is capable of solving gene recognition and normalization tasks in a simple and effective manner. Although CBR-Tagger does not produce the best results when used alone, when combined with other taggers (such as ABNER or BANNER), our experiments (cf. results page) showed that it improves the final results. In the case of normalization approach Moara does not reach the levels of other existing systems. However, as far as we know, no other gene/protein normalization tool is freely available for integrating and for training with new organisms. This is a strong point in Moara since it allows plenty of room for improvements.
Moara utilizes freely available organism-specific data and no tuning was executed for any of the organisms investigated. The possibility of training the system for more organisms makes it a flexible alternative. Therefore, Moara is an asset for those who wish a simple but practical solution to the primary phases of general text mining.
The Java library presented here represents a good alternative for those scientists working in the text mining field, where gene/protein mention and normalization is required during the process. The performance of Moara is below that achieved in BioCreative competitions, in which the participating systems have made use of specific tailored knowledge for each organism considered, but this is not always available to the scientific community. We have constructed a system that can perform for any organism where minimum organism-specific information is supplied.
We use organism-specific information from different sources and different formats, but no manual curation is performed for the normalization task. Rather than curating the dictionary for each organism, we use those provided by the BioCreative's challenges or by NCBI. Some existing systems  use specific tailored information for organisms that produce very good results. However, these dictionaries are not freely available. The free availability and the ease of use of the Java library, as well as the possibility of training the CBR-Tagger and the ML-Normalization with extra documents or organisms, respectively, makes it a necessity for any text mining system.
The inclusion of Moara as an open-source application in Sourceforge is intended to allow the community to change, modify and evolve Moara according to their needs. It is expected that training or using Moara with more specific enriched dictionaries will significantly improve precision and recall. Systems that report an overall gene normalization F-Measure performance of over 80% are not freely available; GENO  is not available for download and GNAT  is only available through the website. Neither are open-source systems and they are not easily trained, expanded or integrated into another text mining tool such as Moara. As supplementary material http://moara.dacya.ucm.es/suppl_material_bmc.html, a comparative table of the available gene/protein recognition and normalization tools has been built in order to highlight some of the important features of Moara. In view of the importance of integration capabilities, Moara will be fully available in the future in the BioCreative Meta Server  and in the U-Compare framework , for which the CBR-Tagger is already integrated, and the gene/protein normalization procedure will be extended with other organisms, such as the ones included in Entrez Gene  and Uniprot . Some organism-specific databases might also be considered for the most important species, such as HUGO  for human.
As this system does not use features that are specific to the gene/protein domain, it might be extended to others domains, although depending on their complexity the CBR-Tagger might be or not appropriate for this task. Some types of entities might require more advanced natural language processing techniques, such as the part-of-speech tag or the use of parsers, while some others are better recognized with the use of specific lexicons, such as the diseases. CBR-Tagger might be more appropriate to those domains which the entities have some similarities to the gene/protein, for example the entities whose names are composed by alphanumeric and symbols or that present some special suffixes or prefixes, in order to exploit the strength of the shape feature.
Moara will be systematically updated to support new functionalities that could potentially help in the analysis of scientific texts. This tool has the potential to help research in this field using and adapting methods that are conceptually simple and powerful for the processing of texts but rather complex in their implementation.
Availability and requirements
Project name: Moara
Project page: http://moara.dacya.ucm.es/
Sourceforge page: http://sourceforge.net/projects/moara
Operating system: Platform independent
Programming language: Java
Other requirements: MySQL, MySQL JDBC connector, Weka library (optional), SecondString library (optional) and ABNER tagger library (optional).
This work has been partially funded by the Spanish grants BIO2007-67150-C03-02, S-Gen-0166/2006, PS-010000-2008-1 and European Union Grant FP7-HEALTH-F4-2008-202047. APM acknowledges the support of the Spanish Ramón y Cajal program. The authors acknowledge support from Integromics, S.L.
- Tamames J, Valencia A: The success (or not) of HUGO nomenclature. Genome Biol 2006, 7(5):402. 10.1186/gb-2006-7-5-402View ArticlePubMedPubMed CentralGoogle Scholar
- Crim J, McDonald R, Pereira F: Automatically annotating documents with normalized gene lists. BMC Bioinformatics 2005, 6(Suppl 1):S13. 10.1186/1471-2105-6-S1-S13View ArticlePubMedPubMed CentralGoogle Scholar
- Hanisch D, Fundel K, Mevissen HT, Zimmer R, Fluck J: ProMiner: rule-based protein and gene entity recognition. BMC Bioinformatics 2005, 6(Suppl 1):S14. 10.1186/1471-2105-6-S1-S14View ArticlePubMedPubMed CentralGoogle Scholar
- Fundel K, Guttler D, Zimmer R, Apostolakis J: A simple approach for protein name identification: prospects and limits. BMC Bioinformatics 2005, 6(Suppl 1):S15. 10.1186/1471-2105-6-S1-S15View ArticlePubMedPubMed CentralGoogle Scholar
- Smith L, Tanabe LK, Ando RJ, Kuo CJ, Chung IF, Hsu CN, Lin YS, Klinger R, Friedrich CM, Ganchev K, et al.: Overview of BioCreative II gene mention recognition. Genome Biology 2008, 9(Suppl 2):S2. 10.1186/gb-2008-9-s2-s2View ArticlePubMedPubMed CentralGoogle Scholar
- Hirschman L, Colosimo M, Morgan A, Yeh A: Overview of BioCreAtIvE task 1B: normalized gene lists. BMC Bioinformatics 2005, 6(Suppl 1):S11. 10.1186/1471-2105-6-S1-S11View ArticlePubMedPubMed CentralGoogle Scholar
- Morgan AA, Lu Z, Wang X, Cohen AM, Fluck J, Ruch P, Divoli A, Fundel K, Leaman R, Hakenberg J, et al.: Overview of BioCreative II gene normalization. Genome Biology 2008, 9(Suppl 2):S3. 10.1186/gb-2008-9-s2-s3View ArticlePubMedPubMed CentralGoogle Scholar
- Leaman R, Gonzalez G: BANNER: an executable survey of advances in biomedical named entity recognition. Pac Symp Biocomput 2008, 652–663.Google Scholar
- Settles B: ABNER: an open source tool for automatically tagging genes, proteins and other entity names in text. Bioinformatics 2005, 21(14):3191–3192. 10.1093/bioinformatics/bti475View ArticlePubMedGoogle Scholar
- Tsuruoka Y, Tateishi Y, Kim J-D, Ohta T, McNaught J, Ananiadou S, Tsujii J: Developing a Robust Part-of-Speech Tagger for Biomedical Text. Advances in Informatics - 10th Panhellenic Conference on Informatics: 2005: LNCS 2005, 282–392.Google Scholar
- McDonald R, Pereira F: Identifying gene and protein mentions in text using conditional random fields. BMC Bioinformatics 2005, 6(Suppl 1):S6. 10.1186/1471-2105-6-S1-S6View ArticlePubMedPubMed CentralGoogle Scholar
- Kano Y, Baumgartner WA Jr, McCrohon L, Ananiadou S, Cohen KB, Hunter L, Tsujii J: U-Compare: share and compare text mining toolswith UIMA. Bioinformatics 2009.Google Scholar
- Hakenberg J, Plake C, Leaman R, Schroeder M, Gonzalez G: Inter-species normalization of gene mentions with GNAT. Bioinformatics 2008, 24(16):i126–132. 10.1093/bioinformatics/btn299View ArticlePubMedGoogle Scholar
- Rebholz-Schuhmann D, Arregui M, Gaudan S, Kirsch H, Jimeno A: Text processing through Web services: calling Whatizit. Bioinformatics 2008, 24(2):296–298. 10.1093/bioinformatics/btm557View ArticlePubMedGoogle Scholar
- Witten IH, Frank E: Data mining: Practical machine learning tools and techniques. 2nd edition. San Francisco: Morgan Kaufmann; 2005.Google Scholar
- Neves M, Chagoyen M, Carazo JM, Pascual-Montano A: CBR-Tagger: a case-based reasoning approach to the gene/protein mention problem. BioNLP 2008 Workshop at ACL 2008: 2008; Columbus, OH, USA 2008.Google Scholar
- Aamodt A, Plaza E: Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications 1994, 7(1):39–59.Google Scholar
- Daelemans W, Zavrel J, Berck P, Gillis S: MBT: A Memory-Based Part of Speech Tagger-Generator. Fourth Workshop on Very Large Corpora: 1996; Copenhagen, Denmark 1996, 14–27.Google Scholar
- Tsuruoka Y, McNaught J, Tsujii J, Ananiadou S: Learning string similarity measures for gene/protein name dictionary look-up using logistic regression. Bioinformatics 2007, 23(20):2768–2774. 10.1093/bioinformatics/btm393View ArticlePubMedGoogle Scholar
- Cohen WC, Ravikumar P, Fienberg SE: A Comparison of String Distance Metrics for Name-Matching Tasks. IIWeb Workshop on International Joint Conference on Artificial Intelligence: 2003; Acapulco, Mexico 2003, 73–78.Google Scholar
- Shatkay H, Feldman R: Mining the biomedical literature in the genomic era: an overview. J Comput Biol 2003, 10(6):821–855. 10.1089/106652703322756104View ArticlePubMedGoogle Scholar
- Wermter J, Tomanek K, Hahn U: High-performance gene name normalization with GeNo. Bioinformatics 2009, 25(6):815–821. 10.1093/bioinformatics/btp071View ArticlePubMedGoogle Scholar
- Leitner F, Krallinger M, Rodriguez-Penagos C, Hakenberg J, Plake C, Kuo CJ, Hsu CN, Tsai RT, Hung HC, Lau WW, et al.: Introducing meta-services for biomedical information extraction. Genome Biol 2008, 9(Suppl 2):S6. 10.1186/gb-2008-9-s2-s6View ArticlePubMedPubMed CentralGoogle Scholar
- Maglott D, Ostell J, Pruitt KD, Tatusova T: Entrez Gene: gene-centered information at NCBI. Nucleic Acids Res 2007, (35 Database):D26–31. 10.1093/nar/gkl993Google Scholar
- The Universal Protein Resource (UniProt) 2009: Nucleic Acids Res. 2009, (37 Database):D169–174.Google Scholar
- Povey S, Lovering R, Bruford E, Wright M, Lush M, Wain H: The HUGO Gene Nomenclature Committee (HGNC). Hum Genet 2001, 109(6):678–680. 10.1007/s00439-001-0615-0View ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.