SCOPUS 정보 검색 플랫폼

Journal of Complexity

Volumn 4, Issue 1, 1988, Pages 33-72

Data structures and algorithms for approximate string matching

(2) Galil, Z a,b Giancarlo, R a,c

a Och Spine at New York Presbyterian Hospitals (United States)

b TEL AVIV UNIVERSITY (Israel)

c UNIVERSITY OF SALERNO (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012743030 PISSN: 0885064X EISSN: 10902708 Source Type: Journal
DOI: 10.1016/0885-064X(88)90008-8 Document Type: Article

Times cited : (92)

References (38)

1
- 0002139526
- The myriad virtues of subword trees
- A Apostolico, Z Galil, NATO ASI Series F, Springer-Verlag, Berlin
- (1984) Combinatorial Algorithms on Words , vol.12 , pp. 85-96
- Apostolico¹

2
- 0023565941
- Generalized string matching
- (1984) SIAM Journal on Computing , vol.16 , pp. 1039-1051
- Abrahamson¹

3
- 0001539365
- On economic construction of the transitive closure of a directed graph
- (1970) Soviet Math. Dokl. , vol.11 , pp. 1209-1210
- Arlazarov¹ Dinic² Kronrod³ Faradzev⁴

4
- 0023586274
- The longest common subsequent problem revisited
- (1987) Algorithmica , vol.2 , pp. 315-336
- Apostolico¹ Guerra²

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

6
- 84913385631
- APOSTOLICO, A., ILIOPOULIS, C., LANDAU, G. M., SHIEBER, B., AND Vishkin, U., Parallel construction of a suffix tree, Algorithmica, to appear.

7
- 84913385630
- String Matching with Context Dependent Errors
- Dipartimento di Informatica, Universitá di Pisa
- (1987) Tech. Report
- Bertossi¹ Lodi² Luccio³ Pagli⁴

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

9
- 0022880641
- Parallel merge sort
- (1986) Proceedings, 27th IEEE FOCS , pp. 511-516
- Cole¹

10
- 70749151045
- Optimal factor transducers
- A Apostolico, Z Galil, NATO ASI Series F, Springer-Verlag, Berlin
- (1984) Combinatorial Algorithms on Words , vol.12 , pp. 31-44
- Crochemore¹

11
- 84976772007
- Parallel prefix computation
- (1980) Journal of the ACM , vol.27 , pp. 831-838
- Fischer¹ Ladner²

12
- 0002743213
- String matching and other products
- R.M Karp, SIAM-AMS Proceedings, American Mathematical Society, Providence, RI
- (1974) Complexity of Computation , vol.7 , pp. 113-125
- Fischer¹ Paterson²

13
- 0015960104
- The string to string correction problem
- (1974) Journal of the ACM , vol.21 , pp. 168-178
- Fischer¹ Wagner²

14
- 0018052202
- Parallelism in random access machines
- (1978) Proceedings, 10th ACM STOC , pp. 114-118
- Fortune¹ Wyllie²

15
- 0041607846
- Open problems in stringology
- A Apostolico, Z Galil, NATO ASI Series F, Springer-Verlag, Berlin
- (1984) Combinatorial Algorithms on Words , vol.12 , pp. 1-8
- Galil¹

16
- 0345937600
- Improved string matching with k mismatches
- (1986) ACM SIGACT News , vol.17 , pp. 52-54
- Galil¹ Giancarlo²

17
- 0023501737
- Parallel string matching with k mismatches
- (1987) Theoretical Computer Science , vol.51 , pp. 343-348
- Galil¹ Giancarlo²

18
- 0020734086
- An efficient general purpose parallel computer
- (1983) J. ACM , vol.30 , pp. 360-387
- Galil¹ Paul²

19
- 0016518550
- A linear space algorithm for computing maximal common subsequences
- (1975) Comm. ACM , vol.18 , pp. 341-343
- Hirschberg¹

20
- 4243639594
- Fast Sequential Algorithms to Find Shuffle Minimizing and Shortest Paths in a Shuffle Exchange Network
- Dept. of Computer Science, Stanford University, Stanford
- (1985) Tech. Rep. TR STANCS-85-1050
- Hershberger¹ Mayr²

21
- 0017492836
- A fast algorithm for computing longest common subsequences
- (1977) Comm. ACM , vol.20 , pp. 350-353
- Hunt¹ Szymanski²

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

23
- 84913364926
- Distinguishing an approximate word's inclusion on Turing machine in real time
- (1984) Izv. Acad. Nauk USSR Ser. Mat. , vol.48 , pp. 520-528
- Ivanov¹

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

25
- 0003352252
- The Art of Computer Programming
- Vol. 1, Addison-Wesley, Reading, MA
- (1973) Sorting and Searching
- Knuth¹

26
- 84884341409
- String Matching in Erroneous Input
- Dept. of Computer Science, Tel-Aviv University, Tel-Aviv
- (1986) Ph.D. thesis
- Landau¹

27
- 0001116877
- Binary codes capable of correcting deletions, insertions and reversals
- (1966) Soviet Phys. Dokl. , vol.6 , pp. 707-710
- Levenshtein¹

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

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

30
- 0010211338
- Introducing efficient parallelism into approximate string matching and a new serial algorithm
- (1986) Proceedings, 18th ACM STOC , pp. 220-230
- Landau¹ Vishkin²

31
- 0016942292
- A space economical suffix tree construction algorithm
- (1976) J. ACM , vol.23 , pp. 262-272
- McCreight¹

32
- 0003214850
- Data Structures and Algorithms. 1. Sorting and Searching
- Springer-Verlag, Berlin
- (1984) EATCS Monographs on TCS
- Mehlhorn¹

33
- 0018985316
- A faster algorithm computing string edit distances
- (1980) J. Comput. System Sci. , vol.20 , pp. 18-31
- Masek¹ Paterson²

34
- 0242405251
- Incremental Alignment Algorithms and Their Applications
- University of Arizona, Tucson
- (1986) Tech. Rep., Dept. of Computer Science
- Myers¹

35
- 84934915776
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Dept. of Computer Science, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv
- (1986) Tech. Rep.
- Schieber¹ Vishkin²

36
- 84983986619
- On approximate string matching
- Lecture Notes in Computer Science, Springer-Verlag, Berlin
- (1983) Proceedings, Int. Conf. on Foundations of Computer Science , pp. 487-495
- Ukkonen¹

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

38
- 85043482370
- Linear pattern matching algorithms
- (1973) Proceedings, 14th Symposium on Switching and Automata Theory , pp. 1-11
- Wiener¹

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