A greedy algorithm for constructing shortest common superstrings
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 602-610
- https://doi.org/10.1007/bfb0016287
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Optimization of parser tables for portable compilersACM Transactions on Programming Languages and Systems, 1984
- The greedy travelling salesman's problemNetworks, 1979
- Storing a sparse tableCommunications of the ACM, 1979
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977