OpenAlex
PricingAboutJobs
Log inGet started
Work

Approximating shortest superstrings

HTML

Year: 2002
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.1993.366871
Authors: Shang-Hua Teng, F. Yao
Institutions: Massachusetts Institute of Technology, Palo Alto Research Center
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: approximation algorithms, approximation ratio, NP-hardness, MAX-SNP hardness, string concatenation, data compression, DNA sequencing

Open Access status: closed
OpenAlex ID: W2101468281
FWCI: 1.437
Cites: 17
Cited by: 50
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security