IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v56y2005i5p493-504.html
   My bibliography  Save this article

Mining association rules from biological databases

Author

Listed:
  • Andrés Rodríguez
  • José María Carazo
  • Oswaldo Trelles

Abstract

We present a novel application of knowledge discovery technology to a developing and challenging application area such as bioinformatics. This methodology allows the identification of relationships between low‐magnitude similarity (LMS) sequence patterns and other well‐contrasted protein characteristics, such as those described by database annotations. We start with the identification of these signals inside protein sequences by exhaustive database searching and automatic pattern recognition strategies. In a second step we address the discovering of association rules that will allow tagging sequences that hold LMS signals with consequent functional keywords. We have designed our own algorithm for discovering association rules, meeting the special necessities of bioinformatics problems, where the patterns we search lie in sparse datasets and are uncommon and thus difficult to locate. Computational efficiency has been verified both with synthetic and real biological data showing that the algorithm is well suited to this application area compared to state of the art algorithms. The usefulness of the method is confirmed by its ability to produce previously unknown and useful knowledge in the area of biological sequence analysis. In addition, we introduce a new and promising application of the rule extraction algorithm on gene expression databases.

Suggested Citation

  • Andrés Rodríguez & José María Carazo & Oswaldo Trelles, 2005. "Mining association rules from biological databases," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 56(5), pages 493-504, March.
  • Handle: RePEc:bla:jamist:v:56:y:2005:i:5:p:493-504
    DOI: 10.1002/asi.20138
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.20138
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asi.20138?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:56:y:2005:i:5:p:493-504. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.