A fast algorithm on average for all-against-all sequence matching

String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

Volumn , Issue , 1999, Pages 16-23

  Baeza Yates, Ricardo A ^a   Gonnet, Gaston H ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DATABASE SYSTEMS; GENETIC PROGRAMMING; GROUPWARE; INFORMATION RETRIEVAL;

ALIGNMENT ALGORITHMS; APPROXIMATE STRING MATCHING PROBLEM; AVERAGE-CASE ANALYSIS; DATABASE SIZE; FAST ALGORITHMS; GENETIC SEQUENCE; SEQUENCE MATCHING; SUFFIX ARRAYS;

DYNAMIC PROGRAMMING;

EID: 0037868029     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1999.796573     Document Type: Conference Paper

References (15)

1. [AS92] A. Apostolico and W. Szpankowski. Self-A lignments in words and their applications. Journal of Algorithms, 13:446-467, 1992.
2. [BYG89] R. Baeza-Yates and G.H. Gonnet. Efficient text searching of regular expressions. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, ICALP'89, Lecture Notes in Computer Science 372, pages 46-62, Stresa, Italy, July 1989. Springer-Verlag.
3. Final version appeared in Journal of ACM 43(6): 915-936, 1996.
4. [BYG9O] R.A. Baeza-Yates and G.H. Gonnet. All-A gainst-all sequence matching. Technical Report, Dept. of Computer Science, Universidad de Chile, 1990.
5. [Cob95] A. Cobbs, Fast Approximate String Matching using Suffix Trees, In CPM'95, LNCS 937, Springer-Verlag, 41-54, Espoo, Finland, 1995.
6. [DS078] M.O. Dayhoff, R.M. Schwartz, and B.C. Orcntt. A Model of Evolutionary Change in Proteins, volume 5, Suppl. 3, pages 345-352. Natl. Biomed. Res. Found., Washington, DC, 1978.
7. [FP86] P. Flajolet and C. Puech. Tree structures for partial match retrieval. J.ACM, 33:371-407, 1986.
8. [Gan59] F.R. Gantmacher. The Theory of Matrices (2 Vols,). Chelsea Publishing Company, New York, 1959.
9. [GB91] G.H. Gonnet and S.A. Benner. Computational biochemistry research at ETH. Informatik/Organic Chemistry, ETH, Zurich, 1991.
10. [GCB92] G. Gonnet, M. Cohen, and S. Benner, Exhaustive Matching of the Entire Protein Sequence Database, Science, 256:1443-45, 1992.
11. [Knu73] D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973.
12. [MM9O] U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. In 1st ACM-SIAM Symposium on Discrete Algorithms, pages 319-327, San Francisco, January 1990.
13. [NBY99] G. Navarro and R. Baeza-Yates, A New Indexing Method for Approximate String Matching, CPM'99, Manchester, England, July 1999.
14. [NW7O] S.B. Needleman and C.D. Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Molec. Biol., 48:443-453, 1970.
15. [Ukk93] E. Ukkonen, Approximate String Matching over Suffix Trees, In CPM'93, LNCS 520, Springer-Verlag, 240-248, Padova, Italy, 1993.