Approximate matching in the L1 metric

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 91-103

  Amir, Amihood ^a,b   Lipsky, Ohad ^a   Porat, Ely ^a   Umanski, Julia ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; CONVOLUTION; IMAGE PROCESSING; PROBLEM SOLVING;

HAMMING DISTANCE; NOISY CHANNELS; NON-BOOLEAN CONVOLUTION;

PATTERN MATCHING;

EID: 26444603465     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_9     Document Type: Conference Paper

References (23)

1. K. Abrahamson. Generalized string matching. SIAM J. Comp., 16(6):1039-1051, 1987.
2. A. Amir, A. Aumann, R. Cole, M. Lewenstein, and E. Porat. Function matching: Algorithms, applications, and a lower bound. In Proc. 30th ICALP, pages 929-942, 2003.
3. A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching. Information and Computation, 181(1):57-74, 2003.
4. A. Amir, E. Eisenberg, and E. Porat. Swap and mismatch edit distance. In Proc. 12th Annual European Symposium on Algorithms (ESA), pages 16-27, 2004.
5. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of halfrectangular figures. Information and Computation, 118(1): 1-11, April 1995.
6. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k mismatches. J. Algorithms, 2004.
7. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly parallelizable problems. Proc. 21st ACM Symposium on Theory of Computation, pages 309-319, 1989.
8. 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.
9. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proc. 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 667-676. Society for Industrial and Applied Mathematics, 2002.
10. 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.
11. Z. Galil. Open problems in stringology. In Z. Galil A. Apostolico, editor, Combinatorial Algorithms on Words, volume 12, pages 1-8. NATO ASI Series F, 1985.
12. Z. Galil and R. Giancarlo. Improved string matching with k mismatches. SIGACT News, 17(4):52-54, 1986.
13. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestor. Computer and System Science, 13:338-355, 1984.
14. H. Karloff. Fast algorithms for approximately counting mismatches. Information Processing Letters, 48(2):53-60, 1993.
15. G. M. Landau and U. Vishkin. Efficient string matching with k mismatches. Theoretical Computer Science, 43:239-249, 1986.
16. O. Lipsky. Efficient distance computations. Master's thesis, Bar-Ilan University, Department of Computer Science, Ramat-Gan 52900, ISRAEL, 2003.
17. E. Maasoumi and J. Racine. Entropy and predictability of stock market returns. Journal of Econometrics, 107(1) :291-312, 3 2002. available at http://ideas.repec.org/a/eee/econom/v107y2002il-2p291-312.html.
18. L. Malagnini, R.B. Herman, and M. Di Bona. Ground motion scaling in the apennines (italy). Bull. Seism. Soc. Am., 90:1062-1081, 2000.
19. E. M. McCreight. A space-economical suffix tree construction algorithm. J. of the ACM, 23:262-272, 1976.
20. M. V. Olson. A time to sequence. Science, 270:394-396, 1995.
21. A. Pentland. Invited talk. NSF Institutional Infrastructure Workshop, 1992.
22. I. Shmulevich, O. Yli-Harja, E. Coyle, D. Povel, and K. Lemstrom. Perceptual issues in music pattern recognition -complexity of rhythm and key finding, April 1999.
23. P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.