Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Minimum Common String Partition Problem: Hardness and Approximations Avraham Goldstein? , Petr Kolman?? , and Jie Zheng? ? ? Abstract. String comparison is a fundamental problem in computer science, with applications in
Add to Reading List
Document Date: 2004-08-19 17:02:18
Open Document
File Size: 230,57 KB
Share Result on Facebook
Minimum Common String Partition Problem: Hardness and Approximations Avraham Goldstein? , Petr Kolman?? , and Jie Zheng? ? ? Abstract. String comparison is a fundamental problem in computer science, with applications in