The submatrices character count problem: An efficient solution using separable values
type: Item
instance of: scholarly article
title: The submatrices character count problem: An efficient solution using separable values
zbMATH Open document ID: 1085.68115
author: Amihood Amir
author: Kenneth W. Church
author: Emanuel Dar
published in: Information and Computation
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2083122
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ic.2003.12.001
OpenAlex ID: W1988851172
cites work: Efficient string matching
cites work: Pattern Matching with Swaps
cites work: Q4828959
cites work: Efficient 2-dimensional approximate matching of half-rectangular figures
cites work: Alphabet dependence in parameterized matching
cites work: A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
cites work: GENERALIZED INTERSECTION SEARCHING PROBLEMS
cites work: Fast Pattern Matching in Strings
DOI: 10.1016/J.IC.2003.12.001
Recommended article: Near-optimal algorithm to count occurrences of subsequences of a given length
Recommended article: Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
Recommended article: Q3140444
Recommended article: Two-Dimensional Parameterized Matching
Recommended article: A Generalization of the Suffix Tree to Square Matrices, with Applications
description: scientific article; zbMATH DE number 2083122