Internet Archive Scholar

Approximating shortest superstrings with constraints [chapter]

Tao Jiang, Ming Li
1993 Lecture Notes in Computer Science  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.5 MB)
https://web.archive.org/web/20170928184345/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/6b5/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTk0OTAyNDk2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

Jiang, T. and M. Li, Approximating shortest superstrings with constraints, Theoretical Computer Science 134 (1994) 473-491.
doi:10.1007/3-540-57155-8_264 fatcat:cnkgz7fbfbhfpaul5fze3idnv4
Citation

Tao Jiang, Ming Li. "Approximating shortest superstrings with constraints." Lecture Notes in Computer Science (1993) 385-396