SCOPUS 정보 검색 플랫폼

Algorithmica

Volumn 12, Issue 4-5, 1994, Pages 327-344

Sublinear approximate string matching and biological applications

(2) Chang, W I a Lawler, E L b

a Howard Hughes Medical Institute Cold Spring Harbor Laboratory Cold Spring Harbor (United States)

b UNIVERSITY OF CALIFORNIA (United States)

Author keywords

Chernoff bound; Computational biology; Edit distance; Lowest common ancestor; Pattern matching; Suffix tree

Indexed keywords

APPROXIMATION THEORY; BIOCHEMISTRY; COMPUTABILITY AND DECIDABILITY; NUCLEIC ACID SEQUENCES; PATTERN RECOGNITION; THRESHOLD LOGIC; TREES (MATHEMATICS);

CHERNOFF BOUND; COMPUTATIONAL BIOLOGY; EDIT DISTANCE; LOWEST COMMON ANCESTOR; PATTERN MATCHING; SUFFIX TREE;

ALGORITHMS;

EID: 0028516811 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/BF01185431 Document Type: Article

Times cited : (137)

References (49)

1
- 0016518897
- Efficient String Matching: An Aid to Bibliographic Search
- (1975) Comm. ACM , vol.18 , pp. 333-340
- Aho, A.V.¹ Corasick, M.J.²

2
- 0025183708
- A Basic Local Alignment Search Tool
- (1990) J. Molecular Biology , vol.215 , pp. 403-410
- Altschul, S.F.¹ Gish, W.² Miller, W.³ Myers, E.W.⁴ Lipman, D.J.⁵

3
- 0002139526
- The Myriad Virtues of Subword Trees
- A., Apostolico, Z., Galil, NATO ASI Series F, Vol. 12, Springer-Verlag, New York
- (1985) Combinatorial Algorithms on Words , pp. 85-96
- Apostolico, A.¹

4
- 84936731654
- W. I. Chang, Fast Implementation of the Schieber-Vishkin Lowest Common Ancestor Algorithm, Computer program, 1990.

5
- 84936694132
- Approximate Pattern Matching and Biological Applications
- University of California, Berkeley
- (1991) Ph.D. thesis
- Chang, W.I.¹

6
- 85008059400
- Approximate String Matching and Local Similarity
- Proc. Fifth Annual Symposium on Combinatorial Pattern Matching, Asilomar, CA, June 5–8, Springer-Verlag, Berlin
- (1994) Lecture Notes in Computer Science
- Chang, W.I.¹

7
- 85029474990
- Theoretical and Empirical Comparisons of Approximate String Matching Algorithms
- Proc. Third Annual Symposium on Combinatorial Pattern Matching, Tucson, AZ, April 29–May 1, 1992, Springer-Verlag, Berlin
- (1992) Lecture Notes in Computer Science, Vol. 644 , pp. 175-184
- Chang, W.I.¹ Lampe, J.²

8
- 84936731653
- W. I. Chang and E. L. Lawler, Approximate String Matching in Sublinear Expected Time, Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, Oct. 22–24, 1990, pp. 116–124.

9
- 84936731652
- W. I. Chang and E. L. Lawler, Approximate String Matching and Biological Sequence Analysis (poster), Human Genome II Official Program and Abstracts, San Diego, CA, Oct. 22–24, 1990, p. 24.

10
- 0023045776
- Sequence Landscapes
- (1986) Nucleic Acids Res. , vol.14 , Issue.1 , pp. 141-158
- Clift, B.¹ Haussler, D.² McConnell, R.³ Schneider, T.D.⁴ Stormo, G.D.⁵

11
- 84976849754
- Longest Common Factor of Two Words
- Springer-Verlag, Berlin
- (1988) Proc. TAPSOFT '87, Lecture Notes in Computer Science, Vol. 249 , pp. 26-36
- Crochemore, M.¹

12
- 0013428692
- R. F., Doolittle, Academic Press, New York
- (1990) Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, Methods in Enzymology, Volume 183
- Doolittle, R.F.¹

13
- 0024640034
- Data Compression with Finite Windows
- (1989) Comm. ACM , vol.32 , Issue.4 , pp. 490-505
- Fiala, E.R.¹ Greene, D.H.²

14
- 0012743030
- Data Structures and Algorithms for Approximate String Matching
- (1988) J. Complexity , vol.4 , pp. 33-72
- Galil, Z.¹ Giancarlo, R.²

15
- 0025588739
- An Improved Algorithm for Approximate String Matching
- (1990) SIAM J. Comput. , vol.19 , Issue.6 , pp. 989-999
- Galil, Z.¹ Park, K.²

16
- 0003915740
- 2nd edn., Addison-Wesely, Reading, MA
- (1991) Handbook of Algorithms and Data Structures: in Pascal and C
- Gonnet, G.H.¹ Baeza-Yates, R.²

17
- 84936731651
- Efficient Algorithms for String Manipulation and Pattern Matching
- University of California, Davis
- (1989) Lecture Notes
- Gusfield, D.¹

18
- 84936731669
- D. Gusfield, K. Balasubramanian, and D. Naor, Parametric Optimization of Sequence Alignment, Proc. Third Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 1992, pp. 432–439.

19
- 84936731670
- D. Gusfield, G. M. Landau, and B. Schieber, An Efficient Algorithm for the All Pairs Suffix-Prefix Problem, Proc. Sequences 91, Italy, July 1991.

20
- 0026693586
- A Contig Assembly Program Based on Sensitive Detection of Fragment Overlaps
- (1992) Genomics , vol.14 , Issue.1 , pp. 18-25
- Huang, X.¹

21
- 85006627991
- Color Set Size Problem with Applications to String Matching
- Proc. Third Annual Symposium on Combinatorial Pattern Matching, Tucson, AZ, April 29–May 1, Springer-Verlag, Berlin
- (1992) Lecture Notes in Computer Science, Vol. 644 , pp. 230-243
- Hui, L.C.¹

22
- 84936731668
- P. Jokinen, J. Tarhio, and E. Ukkonen, A Comparison of Approximate String Matching Algorithms, Manuscript, 1990

23
- 84936731351
- S. Kannan and T. Warnow, Inferring Evolutionary History from DNA Sequences, Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, October 1990, pp. 362–371.

24
- 0038673215
- Patterns in DNA and Amino Acid Sequences and Their Statistical Significance
- M. S., Waterman, CRC Press, Boca Raton, FL
- (1989) Mathematical Methods for DNA Sequences , pp. 133-157
- Karlin, S.¹ Ost, F.² Blaisdell, B.E.³

25
- 33746088254
- Probabilistic Analysis of Algorithms
- University of California, Berkeley
- (1988) Lecture notes
- Karp, R.M.¹

26
- 0022030599
- Efficient Randomized Pattern-Matching Algorithms
- (1987) IBM Journal of Research and Development , vol.31 , pp. 249-260
- Karp, R.M.¹ Rabin, M.O.²

27
- 0039578696
- Exact and Approximate Algorithms for DNA Sequence Reconstruction
- University of Arizona, Tucson
- (1991) Ph.D. thesis
- Kececioglu, J.D.¹

28
- 0000904908
- Fast Pattern Matching in Strings
- (1977) SIAM Journal on Computing , vol.6 , Issue.2 , pp. 323-350
- Knuth, D.E.¹ Morris, J.H.² Pratt, V.R.³

29
- 0002193989
- Fast String Matching with k Differences
- (1988) J. Comp. System Sci. , vol.37 , pp. 63-78
- Landau, G.M.¹ Vishkin, U.²

30
- 0001421462
- Fast Parallel and Serial Approximate String Matching
- (1989) J. Algorithms , vol.10 , pp. 157-169
- Landau, G.M.¹ Vishkin, U.²

31
- 0001116877
- Binary Codes Capable of Correcting Deletions, Insertions and Reversals
- (1966) Soviet Phys. Dokl. , vol.6 , pp. 126-136
- Levenshtein, V.¹

32
- 0016942292
- A Space-Economical Suffix Tree Construction Algorithm
- (1976) J. Assoc. Comput. Mach. , vol.23 , Issue.2 , pp. 262-272
- McCreight, E.M.¹

33
- 84936630230
- A Sublinear Algorithm for Approximate Keyword Matching
- Computer Science Department, University of Arizona, Tucson
- (1991) Technical Report TR90-25
- Myers, E.W.¹

34
- 84936731349
- National Center for Human Genome Research, Understanding Our Genetic Inheritance (The U.S. Human Genome Project: The First Five Years FY 1991–1995), NIH Publication No. 90-1580, April 1990.

35
- 84936731348
- K. Park, Fast String Matching On the Average, Manuscript, 1990.

36
- 0023989064
- Improved tools for biological sequence comparison
- (1988) Proc. Nat. Acad. Sci. USA , vol.85 , pp. 2444-2448
- Pearson, W.R.¹ Lipman, D.J.²

37
- 0021760072
- SEQAID: A DNA Sequence Assembling Program Based on a Mathematical Model
- (1984) Nucleic Acids Res. , vol.12 , Issue.1 , pp. 307-321
- Peltola, H.¹ Söderlund, H.² Ukkonen, E.³

38
- 0347494019
- Linear Algorithms for Data Compression via String Matching
- (1981) Journal of the ACM , vol.28 , Issue.1 , pp. 16-24
- Rodeh, M.¹ Pratt, V.R.² Even, S.³

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

40
- 0024144496
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- (1988) SIAM J. Comput. , vol.17 , Issue.6 , pp. 1253-1262
- Schieber, B.¹ Vishkin, U.²

41
- 49149141669
- The Theory and Computation of Evolutionary Distances: Pattern Recognition
- (1980) J. Algorithms , vol.1 , pp. 359-373
- Sellers, P.H.¹

42
- 0000386785
- Finding Approximate Patterns in Strings
- (1985) J. Algorithms , vol.6 , pp. 132-137
- Ukkonen, E.¹

43
- 84936731347
- E. Ukkonen, Personal communications.

44
- 84936731346
- E. Ukkonen and D. Wood, Approximate String Matching with Suffix Automata, Report A-1990-4, Department of Computer Science, University of Helsinki, April 1990.

45
- 0040260756
- Sequence Alignments
- M. S., Waterman, CRC Press, Boca Raton, FL
- (1989) Mathematical Methods for DNA Sequences , pp. 53-92
- Waterman, M.S.¹

46
- 0026736581
- Parametric Sequence Comparisons
- (1992) Proc. Nat. Acad. Sci. USA , vol.89 , pp. 6090-6093
- Waterman, M.S.¹ Eggert, M.² Lander, E.³

47
- 84936731345
- P. Weiner, Linear Pattern Matching Algorithms, Proc. IEEE Symposium on Switching and Automata Theory, 1973, pp. 1–11.

48
- 84936731344
- Improving the Running Times for Some String Matching Problems
- Computer Science Department, University of Arizona, Tucson
- (1991) Technical Report TR91-20
- Wu, S.¹ Manber, U.² Myers, E.³

49
- 0008452767
- The Complexity of Pattern Matching for a Random String
- (1979) SIAM Journal on Computing , vol.8 , pp. 368-387
- Yao, A.C.¹

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