205 search results - page 41 / 41 » Similarity Search on Supergraph Containment |
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
IAAI
2003
13 years 7 months ago
2003
This paper reports some results of a long-term work in application of AI techniques whose ultimate goal is the development of tools for resource scheduling. Most of the efforts so...
IADIS
2003
13 years 7 months ago
2003
This paper presents the method for retrieving and summarizing changes in topics from online resources. Users often want to know what are the major changes in their areas of intere...
BMCBI
2005
13 years 5 months ago
2005
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
BMCBI
2007
13 years 5 months ago
2007
Background: Natural antisense transcripts (NATs) are endogenous RNA molecules that exhibit partial or complete complementarity to other RNAs, and that may contribute to the regula...