SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 37, Issue 1, 1988, Pages 63-78

Fast string matching with k differences

(2) Landau, Gad M a Vishkin, Uzi b

a TEL AVIV UNIVERSITY (Israel)

b NEW YORK UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002193989 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(88)90045-1 Document Type: Article

Times cited : (165)

References (22)

1
- 0003415652
- Addison-Wesley, Reading, MA
- (1974) The Design and Analysis of Computer Algorithms
- Aho¹ Hopcroft² Ullman³

2
- 0017547820
- A fast string searching algorithm
- (1977) Comm. ACM , vol.20 , pp. 762-772
- Boyer¹ Moore²

3
- 0001884405
- Efficient and elegant subword tree construction
- A. Apostolico, Z. Galil, NATO ASI Series, Series F: Computer and System Sciences, Springer-Verlag, Berlin/New York
- (1985) Combinatorial Algorithms on Words , vol.12 , pp. 97-107
- Chen¹ Seiferas²

4
- 85031932554
- Optimal parallel algorithms for string matching
- (1984) Proc. 16th ACM Symposium on Theory of Computing , pp. 240-248
- Galil¹

5
- 0022138863
- also
- (1985) Inform. and Control , vol.67 , pp. 144-157
- Galil¹

6
- 0041607846
- Open problems in stringology
- A. Apostolico, Z. Galil, NATO (ASI) Series, Series F: Computer and System Sciences, Springer-Verlag, Berlin/New York
- (1985) Combinatorial Algorithms on Words , vol.12 , pp. 1-8
- Galil¹

7
- 0020764168
- Time-space-optimal string matching
- (1983) J. Comput. System Sci. , vol.26 , pp. 280-294
- Galil¹ Seiferas²

8
- 0021426157
- Fast algorithms for finding nearest common ancestors
- (1984) SIAM J. Comput. , vol.13 , Issue.2 , pp. 338-355
- Harel¹ Tartan²

9
- 84916167159
- Recognition of an approximate occurrence of words on a Turing machine in real time
- (1985) Mathematics of the USSR-Izvestiya , vol.24 , Issue.3 , pp. 479-522
- Ivanov¹

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

11
- 0022030599
- Efficient randomized pattern-matching algorithms
- (1987) IBM Journal of Research and Development , vol.31 , Issue.2 , pp. 249-260
- Karp¹ Rabin²

12
- 0022198799
- Efficient string matching in the presence of errors
- (1985) Proc. 26th IEEE FOCS , pp. 126-136
- Landau¹ Vishkin²

13
- 0010211338
- Introducing efficient parallelism into approximate string matching
- (1986) Proc. 18th ACM Symposium on Theory of Computing , pp. 220-230
- Landau¹ Vishkin²

14
- 38249042384
- Efficient string matching with k mismatches
- (1986) Theoret. Comput. Sci. , vol.43 , pp. 239-249
- Landau¹ Vishkin²

15
- 0023045756
- An efficient string matching algorithm with k differences for nucleotide and amino acid sequences
- (1986) Nucleic Acid Res. , vol.14 , Issue.1 , pp. 31-46
- Landau¹ Vishkin² Nussinov³

16
- 0003725141
- Addison-Wesley, Reading, MA
- (1983) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
- Sankoff¹ Kruskal²

17
- 84916150606
- B. Schieber and U. Vishkin Parallel computation of lowest common ancestor in trees, SIAM J. Comput. to appear.

18
- 84983986619
- On approximate string matching
- Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York
- (1983) Proc. Int. Conf. Found. Comp. Theor. , vol.158 , pp. 487-495
- Ukkonen¹

19
- 0000386785
- Finding approximate pattern in strings
- (1985) J. Algorithms , vol.6 , pp. 132-137
- Ukkonen¹

20
- 84914842539
- Optimal parallel pattern matching in strings
- Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York
- (1985) Proc. 12th ICALP , vol.194 , pp. 497-508
- Vishkin¹

21
- 0022142469
- also
- (1985) Inform. and Control , vol.67 , pp. 91-113
- Vishkin¹

22
- 85043482370
- Linear pattern matching algorithm
- (1973) Proc. 14th IEEE Symposium on Switching and Automata Theory , pp. 1-11
- Weiner¹

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