Overlap matching.

DOI10.1016/S0890-5401(02)00035-4zbMath1054.68119OpenAlexW2914418758MaRDI QIDQ1401926

Ramesh Hariharan, Moshe Lewenstein, Ely Porat, Amihood Amir, Richard John Cole

Publication date: 19 August 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(02)00035-4

zbMATH Keywords

Pattern matchingDesign and analysis of algorithmsCombinatorial algorithms on wordsNon-standard pattern matchingPattern matching with swaps

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Pattern recognition, speech recognition (68T10)

Related Items (24)

Swap and mismatch edit distance ⋮ The swap matching problem revisited ⋮ PATTERN MATCHING WITH SWAPS IN PRACTICE ⋮ Exploiting pseudo-locality of interchange distance ⋮ The approximate swap and mismatch edit distance ⋮ On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ Isometric words based on swap and mismatch distance ⋮ On the relationship between histogram indexing and block-mass indexing ⋮ Approximate String Matching with Address Bit Errors ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Order-preserving matching ⋮ String matching with up to \(k\) swaps and mismatches ⋮ Fast algorithms for single and multiple pattern Cartesian tree matching ⋮ On a compact encoding of the swap automaton ⋮ Pattern matching with address errors: rearrangement distances ⋮ Property matching and weighted matching ⋮ Pattern matching in pseudo real-time ⋮ Approximate string matching with stuck address bits ⋮ Pattern Matching with Swaps for Short Patterns in Linear Time ⋮ A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns ⋮ Cartesian Tree Matching and Indexing ⋮ Unnamed Item ⋮ Approximate string matching with address bit errors ⋮ Order-preserving pattern matching indeterminate strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient special cases of pattern matching with swaps
• Alphabet dependence in parameterized matching
• Efficient 2-dimensional approximate matching of half-rectangular figures
• String matching under a general matching relation
• An Improved Algorithm For Approximate String Matching
• An Extension of the String-to-String Correction Problem
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Incremental String Comparison
• Pattern Matching with Swaps
• A theory of parameterized pattern matching

This page was built for publication: Overlap matching.