Parameterized matching on non-linear structures-Reference-Cited by-同舟云学术

Parameterized matching on non-linear structures

Published:2009-07 Issue:15 Volume:109 Page:864-867
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Amir Amihood,Navarro Gonzalo

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference21 articles.

1. T. Akutsu, A linear time pattern matching algorithm between a string and a tree, in: Proc. 4th Symp. on Combinatorial Pattern Matching (CPM), Padova, Italy, 1993, pp. 1–10

2. Function matching;Amir;SIAM Journal on Computing,2006

3. An alphabet independent approach to two dimensional pattern matching;Amir;SIAM Journal on Computing,1994

4. A. Amir, K.W. Church, E. Dar, Separable attributes: A technique for solving the submatrices character count problem, in: Proc. 13th ACM–SIAM Symp. on Discrete Algorithms (SODA), 2002, pp. 400–401

5. Alphabet dependence in parameterized matching;Amir;Information Processing Letters,1994

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A brief history of parameterized matching problems;Discrete Applied Mathematics;2020-03

2. Order Preserving Pattern Matching on Trees and DAGs;String Processing and Information Retrieval;2017

3. On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling;Combinatorial Pattern Matching;2015

4. Plagiarism Detection in Software Using Efficient String Matching;Computational Science and Its Applications – ICCSA 2012;2012