A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings

Esko Ukkonen. A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. Algorithmica, 5(3):313-323, 1990.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.