Pattern Matching with Swaps
From MaRDI portal
Publication:4521515
DOI10.1006/jagm.2000.1120zbMath0964.68037MaRDI 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
Unnamed Item, Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams, Cartesian Tree Matching and Indexing, A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns, Indexing Circular Patterns, The swap matching problem revisited, Space lower bounds for online pattern matching, On the hardness of the consensus string problem, Restricted and swap common superstring: a multivariate algorithmic perspective, The submatrices character count problem: An efficient solution using separable values, Property matching and weighted matching, Overlap matching., Approximate swapped matching., String matching with up to \(k\) swaps and mismatches, Order-preserving pattern matching indeterminate strings, Finding patterns and periods in Cartesian tree matching, Fast algorithms for single and multiple pattern Cartesian tree matching, Order-preserving matching, On a compact encoding of the swap automaton, Generalized function matching, Counting (Watson-Crick) palindromes in Watson-Crick conjugates, PATTERN MATCHING WITH SWAPS IN PRACTICE, On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling, Space Lower Bounds for Online Pattern Matching, Pattern Matching with Swaps for Short Patterns in Linear Time
