SCOPUS 정보 검색 플랫폼

Volumn 165, Issue 2, 1996, Pages 233-246

Consistent subsequences and supersequences

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

CONSISTENT SUBSEQUENCE; CONSISTENT SUPERSEQUENCE; POLYNOMIAL TIME ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0030257403 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(95)00138-7 Document Type: Article

Times cited : (5)

References (11)

1
- 0003603813
- Freeman, San Francisco, CA
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, CA, 1979).
- (1979) Computers and Intractability: a Guide to the Theory of NP-completeness
- Garey, M.R.¹ Johnson, D.S.²

2
- 0043066376
- Maximal common subsequences and minimal common supersequences
- C.B. Fraser, R.W. Irving and M. Middendorf, Maximal common subsequences and minimal common supersequences, Inform. Comput. 124 (1996) 145-153.
- (1996) Inform. Comput. , vol.124 , pp. 145-153
- Fraser, C.B.¹ Irving, R.W.² Middendorf, M.³

3
- 0027680827
- On the complexity of learning strings and sequences
- T. Jiang and M. Li, On the complexity of learning strings and sequences, Theoret. Comput. Sci. 119 (1992) 363-371.
- (1992) Theoret. Comput. Sci. , vol.119 , pp. 363-371
- Jiang, T.¹ Li, M.²

4
- 84976657294
- The complexity of some problems on subsequences and supersequences
- D. Maier, The complexity of some problems on subsequences and supersequences, J. ACM 25 (1978) 322-336.
- (1978) J. ACM , vol.25 , pp. 322-336
- Maier, D.¹

5
- 0027539492
- The shortest common nonsubsequences problem is NP-complete
- M. Middendorf, The shortest common nonsubsequences problem is NP-complete, Theoret. Comput. Sci. 108 (1993) 365-369.
- (1993) Theoret. Comput. Sci. , vol.108 , pp. 365-369
- Middendorf, M.¹

6
- 0028395746
- More on the complexity of common superstring and supersequence problems
- M. Middendorf, More on the complexity of common superstring and supersequence problems, Theoret. Comput. Sci. 125 (1994) 205-228.
- (1994) Theoret. Comput. Sci. , vol.125 , pp. 205-228
- Middendorf, M.¹

7
- 0004460195
- The shortest common supersequence problem over binary alphabet is NP-complete
- K.J. Räihä and E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete, Theoret. Comput. Sci. 16 (1981) 187-198.
- (1981) Theoret. Comput. Sci. , vol.16 , pp. 187-198
- Räihä, K.J.¹ Ukkonen, E.²

9
- 0042565513
- Complexity of common subsequence and supersequence problems and related problems
- V.G. Timkovsky, Complexity of common subsequence and supersequence problems and related problems, Kibernetika 5 (1989) 1-13; English translation in Cybernetics 25 (1990) 565-580.
- (1989) Kibernetika , vol.5 , pp. 1-13
- Timkovsky, V.G.¹

10
- 0039207402
- V.G. Timkovsky, Complexity of common subsequence and supersequence problems and related problems, Kibernetika 5 (1989) 1-13; English translation in Cybernetics 25 (1990) 565-580.
- (1990) Cybernetics , vol.25 , pp. 565-580

11
- 0029327342
- On the approximation of longest common non-supersequences and shortest common non-subsequences
- L. Zhang, On the approximation of longest common non-supersequences and shortest common non-subsequences, Theoret. Comput. Sci. 143 (1995) 353-362.
- (1995) Theoret. Comput. Sci. , vol.143 , pp. 353-362
- Zhang, L.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.