On the closest string and substring problems

doi:10.1145/506147.506150

On the closest string and substring problems

Full Text:

PDF

Buy this Article

Authors:	Ming Li	University of Waterloo, Waterloo, Ont., Canada
	Bin Ma	University of Western Ontario, London, Ont., Canada
	Lusheng Wang	City University of Hong Kong, Kowloon, Hong Kong, China

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 49 Issue 2, March 2002
Pages 157-171
ACM New York, NY, USA
table of contents doi>10.1145/506147.506150

	2002 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 31 · Downloads (cumulative): 485 · Citation Count: 60

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms closest string and substring computer applications nonnumerical algorithms and problems polynomial-time approximation scheme 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 Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder