Approximate matching in the Linfinity metric

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Information Processing Letters

• Publication date

  2008-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ipl.2007.08.012
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient String Matching with k Mismatches

  2018cited by this paper
• Invited talk

  2007cited by this paper
• Approximate Matching in the L1 Metric

  2005cited by this paper
• Faster Algorithms for delta, gamma-Matching and Related Problems

  2005cited by this paper
• Closest Pair Problems in Very High Dimensions

  2004cited by this paper
• Swap and mismatch edit distance

  2004cited by this paper
• Function Matching: Algorithms, Applications, and a Lower Bound

  2003cited by this paper
• Entropy and predictability of stock market returns

  2002cited by this paper
• Verifying candidate matches in sparse and wildcard matching

  2002cited by this paper
• The string edit distance matching problem with moves

  2002cited by this paper
• Overlap matching

  2001cited by this paper
• Perceptual Issues in Music Pattern Recognition: Complexity of Rhythm and Key Finding

  2001cited by this paper
• Ground-Motion Scaling in the Apennines (Italy)

  2000cited by this paper
• Faster algorithms for string matching with k mismatches

  2000cited by this paper
• A Time to Sequence

  1995cited by this paper
• Fast Algorithms for Approximately Counting Mismatches

  1993cited by this paper
• Efficient 2-dimensional approximate matching of non-rectangular figures

  1991cited by this paper
• Highly parallelizable problems

  1989cited by this paper
• Generalized String Matching

  1987cited by this paper
• Improved string matching with k mismatches

  1986cited by this paper
• Open Problems in Stringology

  1985cited by this paper
• Combinatorial Algorithms on Words

  1985cited by this paper
• Fast Algorithms for Finding Nearest Common Ancestors

  1984cited by this paper
• A Space-Economical Suffix Tree Construction Algorithm

  1976cited by this paper
• STRING-MATCHING AND OTHER PRODUCTS

  1974cited by this paper
• Linear Pattern Matching Algorithms

  1973cited by this paper

• Recent Advances in Text-to-Pattern Distance Algorithms

  2020influential citation
• Order-Preserving Pattern Matching Indeterminate Strings

  2018cites this paper
• One-dimensional approximate point set pattern matching with Lp-norm

  2014cites this paper
• Order Preserving Matching

  2013cites this paper
• Approximate Point Set Pattern Matching with L p -Norm

  2011cites this paper
• Pattern Matching under Polynomial Transformation

  2011cites this paper
• DEFINITION AND SOLUTION OF A NEW STRING SEARCHING VARIANT TERMED -PARAMETERIZED MATCHING

  2010cites this paper
• delta-gamma-Parameterized Matching

  2008cites this paper