☆ 4.2 Article

The greedy algorithm for shortest superstrings

INFORMATION PROCESSING LETTERS (2005)

Get Full Text
Add to Collection

Journal

INFORMATION PROCESSING LETTERS
Volume 93, Issue 1, Pages 13-17

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2004.09.012

Keywords

algorithms; analysis of algorithms; approximation algorithms; shortest superstring

Categories

Computer Science, Information Systems

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available
Webinars Posters Questions Hubs Funding Journals Papers Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.