{"version":"1.0","type":"link","title":"Two-dimensional pattern matching - Newikis","description":"In computer science, two-dimensional pattern matching is the problem of locating occurrences of a two-dimensional matrix of characters (\"the pattern\") in a bigger two-dimensional matrix (\"the picture\", or, in analogy with string searching, \"the text\").","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}