The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
PRINTS is a database of protein family ‘fingerprints’ offering a diagnostic resource for newly-determined sequences. By contrast with PROSITE, which uses single consensus expr...
Terri K. Attwood, Michael E. Beck, Darren R. Flowe...
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely f...
Wisam Dakka, Luis Gravano, Panagiotis G. Ipeirotis
A digital video library of over 900 hours of video and 18000 stories from The HistoryMakers was used by 266 students, faculty, librarians, and life-long learners interacting with ...
Michael G. Christel, Scott M. Stevens, Bryan Maher...
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...