SIGN IN
SIGN UP
On the efficient evaluation of relaxed queries in biological databases
Full Text:
PDF
Buy this Article
Authors:
Yangjun Chen
Uni. of Winnipeg, Canada
Duren Che
Souther Illinois University, IL
Karl Aberer
Distributed Information Systems Laboratory, Lausanne, Swtzerland
Published in:
· Proceeding
CIKM '02
Proceedings of the eleventh international conference on Information and knowledge management
Pages 227-236
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-492-4
doi>
10.1145/584792.584832
2002 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 20
· Downloads (cumulative): 222
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
CIKM'13
Share:
|
Tags:
algorithms
automaton
biological databases
performance
position trees
query optimization
query relaxation
systems
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder