SIGN IN
SIGN UP
Approximating the longest approximate common subsequence problem
Full Text:
PDF
Buy this Article
Authors:
Wen-Chen Hu
Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida
Gerhard X. Ritter
Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida
Mark S. Schmalz
Center for Computer Vision and Visualization, Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, Florida
Published in:
· Proceeding
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Pages 166-172
ACM
New York, NY
, USA
©1998
table of contents
ISBN:1-58113-030-9
doi>
10.1145/275295.283951
1998 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 14
· Downloads (cumulative): 375
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation
experimentation
performance
reducibility and completeness
self-modifying machines
theory
verification
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