Title of article :
The greedy algorithm for shortest superstrings
Author/Authors :
Haim Kaplan، نويسنده , , Nira Shafrir، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2005
Pages :
5
From page :
13
To page :
17
Keywords :
analysis of algorithms , Approximation algorithms , Shortest superstring , Algorithms
Journal title :
Information Processing Letters
Serial Year :
2005
Journal title :
Information Processing Letters
Record number :
130008
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130008
بازگشت