Skip Navigation


Bioinformatics Advance Access originally published online on August 12, 2007
Bioinformatics 2007 23(20):2768-2774; doi:10.1093/bioinformatics/btm393
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrowOA All Versions of this Article:
23/20/2768    most recent
btm393v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Google Scholar
Right arrow Articles by Tsuruoka, Y.
Right arrow Articles by Ananiadou, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Tsuruoka, Y.
Right arrow Articles by Ananiadou, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2007 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Learning string similarity measures for gene/protein name dictionary look-up using logistic regression

Yoshimasa Tsuruoka 1,*, John McNaught 1,2, Jun'i;chi Tsujii 1,2,3 and Sophia Ananiadou 1,2

1School of Computer Science, The University of Manchester, Manchester, 2National Centre for Text Mining (NaCTeM), Manchester, UK and 3Department of Computer Science, The University of Tokyo, Japan

*To whom correspondence should be addressed.


  Abstract

Motivation: One of the bottlenecks of biomedical data integration is variation of terms. Exact string matching often fails to associate a name with its biological concept, i.e. ID or accession number in the database, due to seemingly small differences of names. Soft string matching potentially enables us to find the relevant ID by considering the similarity between the names. However, the accuracy of soft matching highly depends on the similarity measure employed.

Results: We used logistic regression for learning a string similarity measure from a dictionary. Experiments using several large-scale gene/protein name dictionaries showed that the logistic regression-based similarity measure outperforms existing similarity measures in dictionary look-up tasks.

Availability: A dictionary look-up system using the similarity measures described in this article is available at http://text0.mib.man.ac.uk/software/mldic/

Contact: yoshimasa.tsuruoka{at}manchester.ac.uk

Associate Editor: Jonathan Wren

Received on June 3, 2007; revised on July 27, 2007; accepted on July 28, 2007

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
J. Wermter, K. Tomanek, and U. Hahn
High-performance gene name normalization with GENO
Bioinformatics, March 15, 2009; 25(6): 815 - 821.
[Abstract] [Full Text] [PDF]

Home page
 J. Am. Med. Inform. Assoc.Home page
M. Torii, Z. Hu, C. H. Wu, and H. Liu
BioTagger-GM: A Gene/Protein Name Recognition System
J. Am. Med. Inform. Assoc., March 1, 2009; 16(2): 247 - 255.
[Abstract] [Full Text] [PDF]

Home page
 Adv. Physiol. Educ.Home page
L. Nordquist
Physiology education and the linguistic jungle of science
Advan Physiol Educ, September 1, 2008; 32(3): 173 - 174.
[Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.