More Agility to Semantic Similarities Algorithm Implementations

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Measuring semantic similarity between Gene Ontology (GO) terms is crucial for identifying functional gene associations.
• Existing GO semantic similarity algorithm implementations lack flexibility and are difficult for biologists to use.
• There is a need for user-friendly implementation of GO semantic similarity algorithms to address biological problems.

Purpose of the Study:

• To develop a generic implementation approach for user-defined GO semantic similarity algorithms.
• To enable researchers, particularly those from biology backgrounds, to focus on algorithm design and execution rather than programming.
• To provide a flexible tool that supports various algorithms and ontologies.

Main Methods:

• Developed an implementation approach that understands and executes user-defined GO semantic similarity algorithms.
• Utilized a question-and-answer format for defining algorithms.
• Ensured compatibility with direct acyclic graphs in Open Biomedical Ontologies (OBO)-like formats and their annotations.

Main Results:

• Created a system capable of understanding and executing user-defined GO semantic similarity algorithms.
• The approach supports generic algorithm definition and execution, moving beyond specific implementations.
• The system is adaptable to various ontologies and annotations in OBO-like formats.

Conclusions:

• This work simplifies the implementation of GO semantic similarity algorithms, making them accessible to biologists.
• The developed approach facilitates algorithm design and execution, accelerating biological discovery.
• The system serves as a valuable template for software developers in bioinformatics.