default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Why greed works for shortest common superstring problem."

Bin Ma (2009)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2009.09.014

access: open

type: Journal Article

metadata version: 2023-03-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Ma09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Ma09
Bin Ma:
Why greed works for shortest common superstring problem. Theor. Comput. Sci. 410(51): 5374-5381 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.