402 search results - page 37 / 81 » XSACT: A Comparison Tool for Structured Search Results |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
DAGSTUHL
2007
13 years 9 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
BMCBI
2008
13 years 7 months ago
2008
Background: For many types of analyses, data about gene structure and locations of non-coding regions of genes are required. Although a vast amount of genomic sequence data is ava...
WABI
2001
Springer
14 years 17 hour ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
ICWS
2007
IEEE
13 years 9 months ago
2007
IEEE
Web services are designed to standardize interactions between heterogeneous applications using Internet technologies. Within the framework of Internet search technologies, Web ser...