Search for Author All Reviews
	Shafrir, Nira     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       The greedy algorithm for shortest superstrings Kaplan H., Shafrir N. Information Processing Letters 93(1): 13-17, 2005.  Type: Article The shortest superstring problem is as follows: given a finite set of strings, find the shortest possible string s, such that every string in the set is a substring of s. Although this question is ...... Nov 3 2005
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy