In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
The problem addressed by this paper is accurate and automatic gene annotation following precise identification/annotation of exon and intron boundaries of biologically verified ...
Alexandre Tchourbanov, Daniel Quest, Hesham H. Ali...
The Web of Linked Data is characterized by linking structured data from different sources using equivalence statements, such as owl:sameAs, as well as other types of linked propert...
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
This paper presents a new shape registration algorithm that establishes "meaningful correspondence" between objects, in that it preserves the local shape correspondence ...
Yun Zhu, Xenophon Papademetris, Albert J. Sinusas,...