{"version":"1.0","type":"link","title":"Compressed pattern matching - Newikis","description":"In computer science, compressed pattern matching (abbreviated as CPM) is the process of searching for patterns in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}