Shortest common superstrings for strings of random letters-Reference-Cited by-同舟云学术

Shortest common superstrings for strings of random letters

Published:1994 Issue: Volume: Page:164-172
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Alexander Kenneth S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58094-8_15.pdf

Reference6 articles.

1. Alexander, K.S. Shortest common superstrings of random strings. (1993) Preprint.

2. Arratia, R. and Waterman, M.S. Critical phenomena in sequence matching. Ann. Probability 13 (1985) 1236–1249.

3. Blum, A., Jiang, T., Li, M., Tromp, J. and Yannakakis, M. Linear approximation of shortest superstrings. Proc. 23rd ACM Symp. on Theory of Computing, (1991) 328–336.

4. Peltola, H., Söderlund, H., Tarhio, J. and Ukkonen, E. Algorithms for some string matching problems arising in molecular genetics. In: Information Processing 83 (Proc. of the IFIP Congress 1983), R.E.A. Mason, ed. North-Holland, Amsterdam, (1983) 53–64.

5. Tarhio, J. and Ukkonen, E. A greedy approximation algorithm for constructing shortest common superstrings. Theor. Comp. Sci. 57 (1986) 131–145.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Shortest Superstring Problem;Optimization in Science and Engineering;2014

2. A Probabilistic PTAS for Shortest Common Superstring;Mathematical Foundations of Computer Science 2009;2009

3. Greedy algorithms for the shortest common superstring that are asymtotically optimal;Algorithms — ESA '96;1996

4. Shortest common superstrings for strings of random letters;Combinatorial Pattern Matching;1994