331 search results - page 36 / 67 » Fast Matching for All Pairs Similarity Search |
95
Voted
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It ...
112
click to vote
ISMB
1994
14 years 11 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
91
Voted
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one ...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...