Matches in SemOpenAlex for { <https://semopenalex.org/work/W2486381620> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W2486381620 abstract "String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has a rather sparse set of techniques. This work represents a new algorithmic technique for two-dimensional matching: periodicity analysis. Its strength lies in the fact that it is inherently two-dimensional.Periodicity in strings has recently been used to solve string matching problems. Multidimensional periodicity, though, is not as simple as it is in strings and was not formally studied or used in pattern matching. In this work, I define and analyze two-dimensional periodicity in rectangular arrays. I show that, based on the ability of an array to overlap itself, there are exactly four categories of periodic arrays: non-periodic, lattice-periodic, line-periodic and radiant-periodic.I present serial and parallel algorithms that find all locations where an overlap originates. In addition, for any other location my algorithms find a witness providing that the array does not self overlap. For an array P, the serial algorithm runs in time $O(vert Pvert)$ (linear time) when the alphabet size is finite, and $O(vert Pvertlogvert Pvert)$ otherwise. The parallel algorithm runs in time $O(logvert Pvert)$ using $O(vert Pvert)$ CRCW processors. The definition of two-dimensional periodicity has proven to be robust as illustrated by its use in solving the following two problems: (1) Compressed Matching. A text array T and pattern array P are given in compressed forms $c(T)$ and $c(P)$. We seek all appearances of P in T, without decompressing T. I show using periodicity analysis, that for the two-dimensional run-length compression there is a $O(vert c(T)vertlogvert Pvert + vert Pvert)$, or almost optimal matching algorithm. (2) Two-Dimensional Exact Matching. A text array T and a pattern array P are given. We seek all appearances of P in T. Previous solutions to this problem had a logarithmic dependence on the alphabet size. In the worst case, (unbounded alphabet size), these algorithms run in time $O(vert Tvertlogvert Pvert)$ with $O(vert Pvertlogvert Pvert)$ preprocessing. I show using periodicity analysis, that the time for the text scanning can be reduced to $O(vert Tvert)$, independent of the alphabet size." @default.
- W2486381620 created "2016-08-23" @default.
- W2486381620 creator A5065328235 @default.
- W2486381620 date "1992-01-01" @default.
- W2486381620 modified "2023-09-27" @default.
- W2486381620 title "Two-dimensional periodicity and matching algorithms" @default.
- W2486381620 hasPublicationYear "1992" @default.
- W2486381620 type Work @default.
- W2486381620 sameAs 2486381620 @default.
- W2486381620 citedByCount "0" @default.
- W2486381620 crossrefType "journal-article" @default.
- W2486381620 hasAuthorship W2486381620A5065328235 @default.
- W2486381620 hasConcept C105795698 @default.
- W2486381620 hasConcept C112876837 @default.
- W2486381620 hasConcept C11413529 @default.
- W2486381620 hasConcept C114614502 @default.
- W2486381620 hasConcept C118615104 @default.
- W2486381620 hasConcept C121332964 @default.
- W2486381620 hasConcept C138885662 @default.
- W2486381620 hasConcept C165064840 @default.
- W2486381620 hasConcept C177264268 @default.
- W2486381620 hasConcept C199360897 @default.
- W2486381620 hasConcept C24890656 @default.
- W2486381620 hasConcept C2781204021 @default.
- W2486381620 hasConcept C33923547 @default.
- W2486381620 hasConcept C41008148 @default.
- W2486381620 hasConcept C41895202 @default.
- W2486381620 hasConcept C68859911 @default.
- W2486381620 hasConcept C7757238 @default.
- W2486381620 hasConceptScore W2486381620C105795698 @default.
- W2486381620 hasConceptScore W2486381620C112876837 @default.
- W2486381620 hasConceptScore W2486381620C11413529 @default.
- W2486381620 hasConceptScore W2486381620C114614502 @default.
- W2486381620 hasConceptScore W2486381620C118615104 @default.
- W2486381620 hasConceptScore W2486381620C121332964 @default.
- W2486381620 hasConceptScore W2486381620C138885662 @default.
- W2486381620 hasConceptScore W2486381620C165064840 @default.
- W2486381620 hasConceptScore W2486381620C177264268 @default.
- W2486381620 hasConceptScore W2486381620C199360897 @default.
- W2486381620 hasConceptScore W2486381620C24890656 @default.
- W2486381620 hasConceptScore W2486381620C2781204021 @default.
- W2486381620 hasConceptScore W2486381620C33923547 @default.
- W2486381620 hasConceptScore W2486381620C41008148 @default.
- W2486381620 hasConceptScore W2486381620C41895202 @default.
- W2486381620 hasConceptScore W2486381620C68859911 @default.
- W2486381620 hasConceptScore W2486381620C7757238 @default.
- W2486381620 hasLocation W24863816201 @default.
- W2486381620 hasOpenAccess W2486381620 @default.
- W2486381620 hasPrimaryLocation W24863816201 @default.
- W2486381620 hasRelatedWork W1502253143 @default.
- W2486381620 hasRelatedWork W1519660397 @default.
- W2486381620 hasRelatedWork W1589909894 @default.
- W2486381620 hasRelatedWork W1597782742 @default.
- W2486381620 hasRelatedWork W2007283112 @default.
- W2486381620 hasRelatedWork W2024557852 @default.
- W2486381620 hasRelatedWork W2036743346 @default.
- W2486381620 hasRelatedWork W2047790227 @default.
- W2486381620 hasRelatedWork W2071882054 @default.
- W2486381620 hasRelatedWork W2095392206 @default.
- W2486381620 hasRelatedWork W2152994773 @default.
- W2486381620 hasRelatedWork W2164090479 @default.
- W2486381620 hasRelatedWork W2174021104 @default.
- W2486381620 hasRelatedWork W2260728842 @default.
- W2486381620 hasRelatedWork W2902555313 @default.
- W2486381620 hasRelatedWork W2911687805 @default.
- W2486381620 hasRelatedWork W3127593639 @default.
- W2486381620 hasRelatedWork W1274355441 @default.
- W2486381620 hasRelatedWork W2181490837 @default.
- W2486381620 hasRelatedWork W3022713583 @default.
- W2486381620 isParatext "false" @default.
- W2486381620 isRetracted "false" @default.
- W2486381620 magId "2486381620" @default.
- W2486381620 workType "article" @default.