Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Multi-channel information systems involve data redundancy, which, in turn, requires the implementation of synchronization mechanisms among overlapping databases. This need for peri...
Cinzia Cappiello, Chiara Francalanci, Barbara Pern...
The full integration of information retrieval (IR) features into a database management system (DBMS) has long been recognized as both a significant goal and a challenging undertak...
Samuel DeFazio, Amjad M. Daoud, Lisa Ann Smith, Ja...