Enriching and Answering Proteomic Queries Using Semantic Knowledges

Kunale Kudagba¹, Omar El Beqqali¹, and Hassan Badir²

¹USMBA University, Computer Science Department, P.O. Box. 1796, 30000 Fes, Morocco
kkunale@fsdmfes.ac.ma
oelbeqqali@fsdmfes.ac.ma

²National School of Applied Sciences, Computer Science Department, P.O. Box. 1818, 45000 Tangier, Morocco
hbadir@ensat.ac.ma

Abstract. Querying and sharing Web proteomics is a challenging topic in Pharmaceutical Drug Discovery and Computational Biology. Given that, several data sources can be used to answer the same sub-goals in the Global query, it is obvious that we can have many different candidates rewritings. The user-query is formulated using Concepts and Properties related to Proteomics research (Domain Ontology). Semantic mappings describe the contents of underlying sources in order to reflect their query capabilities.

In this work, we propose to enrich the user query using WordNet and we give a characterization of query rewriting problem using semantic mappings as an associated hypergraph. Hence, the generation of candidates rewrititngs can be formulated as the discovery of minimals Transversals associated with this hypergraph. We exploit and adapt algorithms available in Hypergraph Theory to find all candidates rewritings from a query answering problem. In this context, some relevant criteria could help to determine optimal and qualitative rewritings, according to user preferences, and sources technical performances.

Keywords: Proteomics, Ontology, WordNet, XML, Trees, Semantic Web, ψ-terms, Query Rewriting, minimal Transversals

LNCS 5872, p. 11 f.

Full article in PDF | BibTeX

lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2009