Pattern Matching with Swaps
From MaRDI portal
Publication:4521515
DOI10.1006/jagm.2000.1120zbMath0964.68037OpenAlexW2048675381MaRDI QIDQ4521515
Gad M. Landau, Amihood Amir, Yonatan Aumann, 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
Related Items
The swap matching problem revisited, PATTERN MATCHING WITH SWAPS IN PRACTICE, The submatrices character count problem: An efficient solution using separable values, On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling, Space lower bounds for online pattern matching, Counting (Watson-Crick) palindromes in Watson-Crick conjugates, On the hardness of the consensus string problem, Overlap matching., 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, Property matching and weighted matching, Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams, Restricted and swap common superstring: a multivariate algorithmic perspective, Generalized function matching, Space Lower Bounds for Online Pattern Matching, 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, Indexing Circular Patterns, Cartesian Tree Matching and Indexing, Unnamed Item, Approximate swapped matching., Order-preserving pattern matching indeterminate strings