Pattern Matching with Swaps

DOI10.1006/JAGM.2000.1120MaRDI QIDQ4521515zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Yonatan Aumann, Gad M. Landau, Noa Lewenstein, Moshe Lewenstein

Publication date 19 December 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2000.1120

zbMATH Keywords

pattern matching with swaps

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Pattern matching with swaps in practice
• Efficient special cases of pattern matching with swaps
• A new algorithm for efficient pattern matching with swaps
• Pattern Matching with Swaps for Short Patterns in Linear Time
• Computational and Information Science
• Pattern matching for permutations
• Pattern matching for permutations
• Pattern Matching
• String matching with up to k swaps and mismatches

Cited in

(39)

• Space lower bounds for online pattern matching
• On the hardness of the consensus string problem
• Pattern Matching with Swaps for Short Patterns in Linear Time
• Order-preserving pattern matching indeterminate strings
• Order-preserving pattern matching indeterminate strings
• Indexing Circular Patterns
• Computational and Information Science
• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• On a compact encoding of the swap automaton
• Swap and mismatch edit distance
• Pattern matching with swaps in practice
• Property matching and weighted matching
• Adjacent Swaps on Strings
• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• String matching with up to k swaps and mismatches
• Efficient Algorithms for the Spoonerism Problem
• Efficient special cases of pattern matching with swaps
• The swap matching problem revisited
• The submatrices character count problem: An efficient solution using separable values
• A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Restricted and swap common superstring: a multivariate algorithmic perspective
• scientific article; zbMATH DE number 2080211 (Why is no real title available?)
• The approximate swap and mismatch edit distance
• Algorithms – ESA 2004
• Finding patterns and periods in Cartesian tree matching
• Overlap matching.
• On the complexity of indeterminate strings matching
• Space Lower Bounds for Online Pattern Matching
• Cartesian Tree Matching and Indexing
• A new algorithm for efficient pattern matching with swaps
• Approximate swapped matching.
• Quantum path parallelism: a circuit-based approach to text searching
• Counting (Watson-Crick) palindromes in Watson-Crick conjugates
• A general quantum circuit for string matching: unleashing quantum path parallelism
• Order-preserving matching
• Generalized function matching
• Fast Cartesian tree matching
• Approximate Cartesian tree matching: an approach using swaps

This page was built for publication: Pattern Matching with Swaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521515)