Combined super-/substring and super-/subsequence problems

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 247-267

  Middendorf, Martin ^a   Manlove, David F ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MANUFACTURE; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

MANUFACTURING SYSTEMS; PROCESS PLANNING; STRINGOLOGY; SUBSTRINGS; SUPERSTRINGS;

COMPUTER SCIENCE;

EID: 2442669501     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.001     Document Type: Article

References (19)

1. Blum A., Jiang T., Li M., Tromp J., Yannakakis M. Linear approximation of shortest superstrings. J. ACM. 41:1994;630-647.
2. M. Farach, Optimal suffix tree construction with large alphabets, Proc. of FOCS '97: The 38th Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society, Silver Spring, MD, 1997, pp. 137-143.
3. C.B. Fraser, Subsequences and supersequences of strings, Ph.D Thesis, Dept. of Computing Science, University of Glasgow, 1995.
4. Fraser C.B., Irving R.W., Middendorf M. Maximal common subsequences and minimal common supersequences. Inform. Comput. 124:1996;145-153.
5. Gallant J., Maier D., Storer J.A. On finding minimal length superstrings. J. Comput. Syst. Sci. 20:1980;50-58.
6. Garey M.R., Johnson D.S. Computers and Intractability. 1979;W.H. Freeman, San Francisco, CA.
7. Gusfield D. Algorithms on Strings, Trees and Sequences. 1997;Cambridge University Press, Cambridge.
8. L.C.K. Hui, Color set size problem with applications to string matching, Proc. of CPM '92: the 3rd Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 644, Springer, Berlin, 1992, pp. 230-243.
9. Jiang T., Li M. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput. 24:1995;1122-1139.
10. Maier D. The complexity of some problems on subsequences and supersequences. J. ACM. 25:1978;322-336.
11. D.F. Manlove, Minimaximal and maximinimal optimisation problems: a partial order-based approach, Ph.D. Thesis, Department of Computing Science, University of Glasgow, 1998.
12. Massaglia F., Poncelet P., Cischetti R. An efficient algorithm for Web usage mining. Networking Inform. Syst. J. 2:1999;571-603.
13. Middendorf M. The shortest common nonsubsequence problem is NP-complete. Theoret. Comput. Sci. 108:1993;365-369.
14. Middendorf M. On finding minimal, maximal, and consistent sequences over a binary alphabet. Theoret. Comput. Sci. 145:1994;317-327.
15. M. Middendorf, Plan Merging und verwandte Probleme, Habilitation Thesis, Faculty of Economics, University of Karlsruhe, 1998.
16. Papadimitriou C.H., Yannakakis M. Optimization, approximation and complexity classes. J. Comput. Syst. Sci. 43:1991;425-440.
17. Räihä K.-J., Ukkonen E. The shortest common supersequence problem over binary alphabet is NP-complete. Theoret. Comput. Sci. 16:1981;187-198.
18. Timkovsky V.G. Complexity of common subsequence and supersequence problems and related problems. Cybernetics. 25:1990;565-580.
19. Zhang L. On the approximation of longest common non-supersequences and shortest common non-subsequences. Theoret. Comput. Sci. 143:1995;353-362.