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

DOI10.1016/J.IC.2003.12.001MaRDI QIDQ598188zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Kenneth W. Church, Emanuel Dar

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)

Recommendations

• Near-optimal algorithm to count occurrences of subsequences of a given length
• Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
• scientific article; zbMATH DE number 437565
• Two-dimensional parameterized matching
• A Generalization of the Suffix Tree to Square Matrices, with Applications

Cites work

• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Alphabet dependence in parameterized matching
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Efficient string matching
• Fast Pattern Matching in Strings
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• scientific article; zbMATH DE number 2119688 (Why is no real title available?)
• Pattern Matching with Swaps

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

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