The submatrices character count problem: An efficient solution using separable values

DOI10.1016/j.ic.2003.12.001zbMath1085.68115OpenAlexW1988851172MaRDI QIDQ598188

Emanuel Dar, Amihood Amir, Kenneth W. Church

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.ic.2003.12.001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Cites Work

• Alphabet dependence in parameterized matching
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Efficient string matching
• Fast Pattern Matching in Strings
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Pattern Matching with Swaps
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Unnamed Item

This page was built for publication: The submatrices character count problem: An efficient solution using separable values