A linear-time algorithm for finding approximate shortest common superstrings
- 1 June 1990
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 5 (1-4) , 313-323
- https://doi.org/10.1007/bf01840391
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A greedy algorithm for constructing shortest common superstringsPublished by Springer Nature ,2005
- A greedy approximation algorithm for constructing shortest common superstringsTheoretical Computer Science, 1988
- SEQAID: a DNA sequence assembling program based on a mathematical modelNucleic Acids Research, 1984
- Automation of the computer handling of gel reading data produced by the shotgun method of DNA sequencingNucleic Acids Research, 1982
- On finding minimal length superstringsJournal of Computer and System Sciences, 1980
- Computer programs for the assembly of DNA sequencesNucleic Acids Research, 1979
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Efficient string matchingCommunications of the ACM, 1975