Approximate matching in the L∞ metric

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

Volumn 3772 LNCS, Issue , 2005, Pages 331-334

  Lipsky, Ohad ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBLEM SOLVING; TEXT PROCESSING;

APPROXIMATE MATCHING; METRIC PROBLEM; NATURAL NUMBERS;

PATTERN MATCHING;

EID: 33646729871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_37     Document Type: Conference Paper

References (9)

1. 1 metric. In Apostolico et al. [2], pages 91-103.
2. Alberto Apostolico, Maxime Crochemore, and Kunsoo Park, editors, Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, volume 3537 of Lecture Notes in Computer Science. Springer, 2005.
3. Alberto Apostolico and Zvi Galil, editors. Combinatorial Algorithms on Words. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1985.
4. Peter Clifford, Raphaël Clifford, and Costas S. Iliopoulos. Faster algorithms for delta, gamma-matching and related problems. In Apostolico et al. [2], pages 68-78.
5. Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, and Ely Porat. Closest pair problems in very high dimensions. In ICALP, volume 3142 of Lecture Notes in Computer Science, pages 782-792. Springer, 2004.
6. Piotr Indyk, Ohad Lipsky, and Ely Porat. Approximate translation matching, manuscript. 2004.
7. Ohad Lipsky. Efficient distance computations. Master's thesis, Bar-Ilan University, Department of Computer Science, 2003.
8. ∞ matching. Technical report, Department of Computer Science, 2003.
9. Ilya Shmulevich, O. Yli-Harja, E. Coyle, D. Povel, and K. Lemstrom. Perceptual issues in music pattern recognition - complexity of rhythm and key fining. 1999.