SCOPUS 정보 검색 플랫폼

Volumn 57, Issue 1, 1988, Pages 131-145

A greedy approximation algorithm for constructing shortest common superstrings

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY; OPTIMIZATION;

GREEDY APPROXIMATION ALGORITHM; LONGEST HAMILTONIAN PATHS; SHORTEST COMMON SUPERSTRINGS; STRING COMPRESSION; STRING-MATCHING; WEIGHTED GRAPHS;

COMPUTER PROGRAMMING;

EID: 0024135088 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(88)90167-3 Document Type: Article

Times cited : (111)

References (8)

1
- 84976758346
- Optimization of parser tables for portable compilers
- (1984) ACM Transactions on Programming Languages and Systems , vol.6 , pp. 546-572
- Dencker¹ Dũrre² Heuft³

2
- 77950393797
- String compression algorithms
- Princeton University
- (1982) Ph.D. Thesis
- Gallant¹

4
- 0018767270
- The greedy travelling salesman's problem
- (1979) Networks , vol.9 , pp. 363-373
- Jenkyns¹

5
- 0000904908
- Fast pattern matching in strings
- (1977) SIAM Journal on Computing , vol.6 , pp. 323-350
- Knuth¹ Morris² Pratt³

6
- 9344234849
- A note on complexity of the superstring problem
- Dept. EECS, Princeton University
- (1977) Tech. Rept. TR-233
- Maier¹ Storer²

7
- 0020946963
- Algorithms for some string matching problems arising in molecular genetics
- R.E.A. Mason, North-Holland, Amsterdam
- (1983) Information Processing 83 (Proc. of the IFIP Congress 1983) , pp. 53-64
- Peltola¹ Söderlund² Tarhio³ Ukkonen⁴

8
- 0018543294
- Storing a sparse table
- (1979) Comm. ACM , vol.22 , pp. 606-611
- Tarjan¹ Yao²

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