Approximate subset matching with Don't Cares

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 305-306

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

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Algorithms; Design; Performance; Theory

Indexed keywords

EID: 64049104820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Karl Abrahamson, Generalized string matching, SIAM Journal on Computing, v.16 n.6, p.1039-1051, December 1, 1987 [doi>10.1137/0216067]
2. A. Amir , Y. Aumann , G. M. Landau , M. Lewenstein , N. Lewenstein, Pattern matching with swaps, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.144, October 19-22, 1997
3. Amihood Amir , Moshe Lewenstein , Ely Porat, Faster algorithms for string matching with k mismatches, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.794-803, January 09-11, 2000, San Francisco, California, United States
4. Brenda S. Baker, A theory of parameterized pattern matching: algorithms and applications, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.71-80, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167115] 5 Richard Cole , Ramesh Hariharan, Tree pattern matching and subset matching in randomized O(nlog3m) time, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.66-75, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258553]
5. Richard Cole , Ramesh Hariharan , Piotr Indyk, Tree pattern matching and subset matching in deterministic O(n log3 n)-time, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.245-254, January 17-19, 1999, Baltimore, Maryland, United States
6. 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.
7. S. R. Kosaraju. Efficient tree pattern matching. Proc. 30th IEEE FOCS, pages 178-183, 1989.