A Note on Shortest Superstrings with Flipping

@article{Jiang1992ANO,
  title={A Note on Shortest Superstrings with Flipping},
  author={Tao Jiang and Ming Li and Dingzhu Du},
  journal={Inf. Process. Lett.},
  year={1992},
  volume={44},
  pages={195-199}
}
Jiang, T., M. Li and D.-z. Du, A note on shortest superstrings with flipping, Information Processing Letters 44 (1992) 195-199. Approximation algorithms for the shortest common superstring problem have been studied recently. This paper considers an interesting variation of the problem: For a given set of strings S = (st, , s,}, find a shortest superstring that contains either s, or sIR for each i. The problem may have applications in DNA sequencing practice when orientations of the fragments in… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…