Function matching

SIAM Journal on Computing

Volumn 35, Issue 5, 2006, Pages 1007-1022

  Amir, Amihood ^a   Aumann, Yonatan ^a   Lewenstein, Moshe ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Color maps; Function matching; Parameterized matching; Pattern matching

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; FUNCTION EVALUATION; IMAGE PROCESSING; PROBLEM SOLVING;

COLOR MAPS; COMPUTATIONAL BIOLOGY; FUNCTION MATCHING; PARAMETERIZED MATCHING;

PATTERN MATCHING;

EID: 33750188932     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702424496     Document Type: Article

References (32)

1. K. ABRAHAMSON, Generalized string matching, SIAM J. Comput., 16 (1987), pp. 1039-1051.
2. A. AMIR, Y. AUMANN, G. LANDAU, M. LEWENSTEIN, AND N. LEWENSTEIN, Pattern matching with swaps, J. Algorithms, 37 (2000), pp. 247-266.
3. A. AMIR, G. BENSOM, AND M. FARACH, An alphabet independent approach to two-dimensional pattern matching, SIAM J. Comput., 23 (1994), pp. 313-323.
4. A. AMIR, K. W. CHURCH, AND E. DAR, The submatrices character count problem: An efficient solution using separable values, Inform. Comput., 190 (2002), pp. 100-116.
5. A. AMIR, R. COLE, R. HARIHARAN, M. LEWENSTEIN, AND E. PORAT, Overlap matching, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 2001, pp. 279-288.
6. A. AMIR AND M. FARACH, Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. Comput., 118 (1995), pp. 1-11.
7. A. AMIR, M. FARACH, AND S. MUTHUKRISHNAN, Alphabet dependence in parameterized matching, Inform. Process. Lett., 49 (1994), pp. 111-115.
8. A. AMIR AND G. LANDAU, Fast parallel and serial multidimensional approximate array matching, Theoret. Comput. Sci., 81 (1991), pp. 97-115.
9. A. APOSTOLICO AND Z. GALIL, EDS., Pattern Matching Algorithms, Oxford University Press, Oxford, UK, 1997.
10. G. P. BABU, B. M. MEHTRE, AND M. S. KANKANHALLI, Color indexing for efficient image retrieval, Multimedia Tools Appl., 1 (1995), pp. 327-348.
11. B. S. BAKER, A theory of parameterized pattern matching: Algorithms and applications, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 71-80.
12. J. H. SOWIE, R. LUTHY, AND D. EISENBERG, A method to identify protein sequences that fold into a known three-dimensional structure, Science, 253 (1991), pp. 164-176.
13. R. S. BOYER AND J. S. MOORE, A fast string searching algorithm, Comm. ACM, 20 (1977), pp. 762-772.
14. M. T. CHEN AND J. SEIFERAS, Efficient and elegant subword-tree construction, in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, eds., NATO, Adv. Sci. Inst. Ser. F Comput. Systems Sci. 12, Springer, Berlin, 1985, pp. 97-107.
15. 3 m) time, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 66-75.
16. 3 n)-time, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 1999, pp. 245-254.
17. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA; McGraw-Hill, New York, 1990.
18. M. CROCHEMORE AND W. RYTTER, Text Algorithms, Oxford University Press, Oxford, UK, 1994.
19. M. J. FISCHER AND M. S. PATERSON, String matching and other products, in Complexity of Computation, R. M. Karp, ed., SIAM-AMS Proceedings 7, AMS, Providence, RI, 1974, pp. 113-125.
20. D. E. KNUTH, J. H. MORRIS, JR., AND V. R. PRATT, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), pp. 323-350.
21. S. RAO KOSARAJU, Efficient String Matching, manuscript, 1987.
22. W. C. KREAHLING AND C. NORRIS, Profile assisted register allocation, in Proceedings of the ACM Symposium on Applied Computing (SAC), ACM, New York, 2000, pp. 774-781.
23. G-Y. LUEH, T. GROSS, AND A-R. ADL-TABATABAI, Fusion-based register allocation, ACM Trans. Programming Languages and Systems, 22 (2000), pp. 431-470.
24. K. MERZ. JR., AND S. M. LE GRAND, The Protein Folding Problem and Tertiary Structure Prediction, Birkhäuser Boston, Boston, MA, 1994.
25. S. MUTHUKRISHNAN, New results and open problems related to nonstandard stringology, in Proceedings of the 6th Annual Combinatorial Pattern Matching Conference, Lecture Notes in Comput. Sci. 937, Springer, Berlin, 1995, pp. 298-317.
26. S. MUTHUKRISHNAN AND K. PALEM, Nonstandard stringology: Algorithms and complexity, in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, New York, 1994, pp. 770-779.
27. M. SWAIN AND D. BALLARD, Color indexing, Internat. J. Comput. Vision, 7 (1991), pp. 11-32.
28. U. VISHKIN, Optimal parallel pattern matching in strings, in Inform, and Control, 67 (1985), pp. 91-113.
29. U. VISHKIN, Deterministic sampling - a new technique for fast pattern matching, SIAM J. Comput., 20 (1991), pp. 22-40.
30. P. WEINER, Linear pattern matching algorithm, in Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, IEEE, Piscataway. NJ, 1973, pp. 1-11.
31. J. YADGARI, A. AMIR, AND R. UNGER, Genetic algorithms for protein threading, in Proceedings of the 6th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 98), J. Glasgow, T. Littlejohn, F. Major, R. Lathrop, D. Sankoff, and C. Sensen, eds., AAAI Press, Menlo Park, CA, 1998, pp. 193-202.
32. A. C. C. YAO, Some complexity questions related to distributive computing, in Proceedings of the Eleventh Annual Symposium on the Theory of Computing (STOC), ACM, New York, 1979, pp. 209-213.