SCOPUS 정보 검색 플랫폼

Volumn 134, Issue 2, 1994, Pages 473-491

Approximating shortest superstrings with constraints

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; LINEAR PROGRAMMING; OPTIMAL SYSTEMS; PERFORMANCE;

GREEDY STYLE ALGORITHMS; HUNGARIAN ALGORITHM; POLYNOMIAL TIME; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SUPERSTRINGS;

ALGORITHMS;

EID: 0028539682 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(94)90249-6 Document Type: Article

Times cited : (12)

References (16)

1
- 84936676730
- Linear approximation of shortest superstrings
- also to appear in in J. ACM.
- (1991) Proc. 23rd ACM Symp. on Theory of Computing , pp. 328-336
- Blum¹ Jiang² Li³ Tromp⁴ Yannakakis⁵

2
- 0002758466
- Sequencing by hybridization (SBH) with oligonucleotide probes as an integral approach for the analysis of complex genomes
- (1992) Internat. J. Genomic Res. , vol.1-1 , pp. 59-79
- Drmanac¹ Crkvenjakov²

3
- 0018983891
- On finding minimal length superstring
- (1980) J. Comput. System Sci. , vol.20 , pp. 50-58
- Gallant¹ Maier² Storer³

5
- 0001724641
- On simple linear programming problems
- V. Klee, AMS, Providence, RI
- (1963) Convexity: Proc. of Symposia in Pure Mathematics , vol.7
- Hoffman¹

6
- 84913007310
- submitted for publication
- (1993) DNA sequencing and string learning
- Jiang¹ Li²

7
- 0012415671
- On the complexity of learning strings and sequences
- Theoret. Comput. Sci. 119 1993 363 371
- (1991) Proc. 4th Workshop on Computational Learning , pp. 367-371
- Jiang¹ Li²

9
- 0025720355
- Towards a DNA sequencing theory
- (1990) Proc. 31st IEEE Symp. on Foundations of Computer Science , pp. 125-134
- Li¹

10
- 19644366709
- Towards DNA sequencing by hybridization
- manuscript
- (1993) Towards DNA sequencing by hybridization
- Pevzner¹ Lipschutz²

12
- 84976693225
- Algorithms for some string matching problems arising in molecular genetics
- (Proc. IFIP Congress)
- (1983) Inform. Process. , vol.83 , pp. 53-64
- Peltola¹ Soderlund² Tarhio³ Ukkonen⁴

13
- 85040877619
- Computer Science Press, Rockville, MD
- (1988) Data Compression: Methods and Theory
- Storer¹

14
- 0024135088
- A greedy approximation algorithm for constructing shortest common superstrings
- (1988) Theoret. Comput. Sci. , vol.57 , pp. 131-145
- Tarhio¹ Ukkonen²

15
- 0024749527
- Approximation algorithms for the shortest common superstring problem
- (1989) Inform. and Comput. , vol.83 , pp. 1-20
- Turner¹

16
- 0021518106
- A theory of the learnable
- (1984) Comm. ACM , vol.27 , Issue.11 , pp. 1134-1142
- Valiant¹

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