String noninclusion optimization problems

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 3, 1998, Pages 456-467

  Rubinov, Anatoly R ^a   Timkovsky, Vadim G ^b,c  

^a National Transport Institute   (Russian Federation)

^b INSTITUTE OF ECONOMIC FORECASTING   (Russian Federation)

^c Star Data Systems Inc   (Canada)

Author keywords

Common; Longest; NP hard problem; Polynomial time algorithm; Shortest; String inclusion; Subsequence; Substring; Supersequence; Superstring

Indexed keywords

EID: 0043066374     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480192234277     Document Type: Article

References (17)

1. R. BEAN, A. EHRENFEUCHT, AND G. F. MCNULTY, Avoidable patterns in strings of symbols, Pacific J. Math., 85 (1979), pp. 261-294.
2. H. M. EDWARDS, Fermat's Last Theorem, Springer-Verlag, New York, 1977.
3. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, W. H. Freeman San Francisco, CA, 1979.
4. M. HALL, JR., Combinatorial Theory, Blaisdel, Waltham, MA, 1967.
5. J.-J. HEBRARD, An algorithm for distinguishing efficiently bit-strings by their subsequences, Theoret. Comput. Sci., 82 (1991), pp. 35-49.
6. T. JIANG, Private communication, 1993.
7. T. JIANG AND M. LI, Approximating shortest superstrings with constraints, Theoret Comput. Sci., 134 (1994), pp. 473-491.
8. E.L. LAWLER, Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
9. A. LESK, ED., Computational Molecular Biology, Sources and Methods for Sequence Analysis, Oxford University Press, Oxford, 1988.
10. M. MIDDENDORF, The shortest common non-subsequence problem is NP-complete, Theoret. Comput. Sci., 108 (1993), pp. 365-369.
11. A. SALOMAA, Jewels of Formal Language Theory, Computer Science Press, Rockville, MD, 1981.
12. J. STORER, Data Compression: Methods and Theory, Computer Science Press Rockville, MD, 1988.
13. V. G. TIMKOVSKY, Discrete Mathematics in Engineering, Nauka, Moscow, 1992 (in Russian).
14. V. G. TIMKOVSKY, Complexity of common subsequence and supersequence problems and related problems, Kibernetika, 5 (1989), pp. 1-13 (in Russian). English transl. in Cybernetics, 25 (1990), pp. 565-580.
15. V. G. TIMKOVSKY, Complexity of common subsequence and supersequence problems and related problems, Kibernetika, 5 (1989), pp. 1-13 (in Russian). English transl. in Cybernetics, 25 (1990), pp. 565-580.
16. L. ZHANG, On the approximation of longest common nonsupersequences and the shortest common nonsubsequences, Theoret. Comput. Sci., 143 (1995), pp. 353-362.
17. A. I. ZIMIN, Blocking sets of terms, Math. Sbornik, 119 (1982), pp. 363-375 (in Russian).