Approximation algorithms for the shortest common superstring problem
- 1 October 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 83 (1) , 1-20
- https://doi.org/10.1016/0890-5401(89)90044-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Self-adjusting binary search treesJournal of the ACM, 1985
- Data compression via textual substitutionJournal of the ACM, 1982
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- On finding minimal length superstringsJournal of Computer and System Sciences, 1980
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- Computer programs for the assembly of DNA sequencesNucleic Acids Research, 1979
- Inferring DNA structures from segmentation dataArtificial Intelligence, 1978
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Information compression by factorising common stringsThe Computer Journal, 1975
- An Algorithm for Reconstructing Protein and RNA SequencesJournal of the ACM, 1967