Function matching: Algorithms, applications, and a lower bound

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 929-942

  Amir, Amihood ^a   Aumann, Yonatan ^a   Cole, Richard ^b   Lewenstein, Moshe ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Color indexing; Function matching; Parameterized matching; Pattern matching; Protein folding; Register allocation

Indexed keywords

ALGORITHMS; PATTERN MATCHING; PROTEIN FOLDING;

COLOR INDEXING; DETERMINISTIC ALGORITHMS; FUNCTION MATCHING; MATCHING CRITERION; PARAMETERIZED MATCHING; RANDOMIZED ALGORITHMS; REGISTER ALLOCATION; TEXT LOCATION;

COLOR MATCHING;

EID: 35248829485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_72     Document Type: Article

References (18)

1. K. Abrahamson. Generalized string matching. SIAM J. Comp., 16(6):1039-1051, 1987.
2. A. Amir, G. Benson, and M. Farach. An alphabet independent approach to two dimensional pattern matching. SIAM J. Comp., 23(2):313-323, 1994.
3. A. Amir, K. W. Church, and E. Dar. Separable attributes: a technique for solving the submatrices character count problem. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 400-401, 2002.
4. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation, 118(1):1-11, April 1995.
5. A. Amir, M. Farach, and S. Muthukrishnan. Alphabet dependence in parameterized matching. Information Processing Letters, 49:111-115, 1994.
6. G.P. Babu, B.M. Mehtre, and M.S. Kankanhalli. Color indexing for efficient image retrieval. Multimedia Tools and Applications, 1(4):327-348, Nov. 1995.
7. B. S. Baker. A theory of parameterized pattern matching: algorithms and applications. In Proc. 25th Annual ACM Symposium on the Theory of Computation, pages 71-80, 1993.
8. J. H. Bowie, R. Luthy, and D. Eisenberg. A method to identify protein sequences that fold into a known three-dimensional structure. Science, (253):164-176, 1991.
9. R. Cole and R. Hariharan. Verifying candidate matches in sparse and wildcard matching. In Proc. 34st Annual Symposium on the Theory of Computing (STOC), pages 592-601, 2002.
10. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
11. M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113-125, 1974.
12. W.C. Kreahling and C. Norris. Profile assisted register allocation. In Proc. ACM Symp. on Applied Computing (SAC), pages 774-781, 2000.
13. G-Y. Lueh, T. Gross, and A-R. Adl-Tabatabai. Fusion-based register allocation. ACM Transactions on Programming Languages and Sustems (TOPLAS), 22(3):431-470, 2000.
14. Jr. K. Merz and S. M. La Grand. The Protein Folding Problem and Tertiary Structure Prediction. Birkhauser, Boston, 1994.
15. S. Muthukrishnan and K. Palem. Non-standard stringology: Algorithms and complexity. In Proc. 26th Annual Symposium on the Theory of Computing, pages 770-779, 1994.
16. M. Swain and D. Ballard. Color indexing. International Journal of Computer Vision, 7(1):11-32, 1991.
17. J. Yadgari, Amihood Amir, and Ron Unger. Genetic algorithms for protein threading. In J. Glasgow, T. Littlejohn, F. Major, R. Lathrop, D. Sankoff, and C. Sensen, editors, Proc. 6th Int'l Conference on Intelligent Systems for Molecular Biology (ISMB 98), pages 193-202. AAAI, AAAI Press, 1998.
18. A. C. C. Yao. Some complexity questions related to distributed computing. In Proc. 11h Annual Symposium on the Theory of Computing (STOC), pages 209-213, 1979.