Results 11 to 20 of about 7,122,799 (334)
A Survey on Distributed Graph Pattern Matching in Massive Graphs
ACM Computing Surveys, 2021 Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it impractical for graph pattern matching (GPM) in the context of big data.
Sarra Bouhenni +3 more
semanticscholar +3 more sources
Simple and Efficient Pattern Matching Algorithms for Biological Sequences [PDF]
IEEE Access, 2020 The remarkable growth of biological data is a motivation to accelerate the discovery of solutions in many domains of computational bioinformatics. In different phases of the computational pipelines, pattern matching is a very practical operation.
Peyman Neamatollahi +2 more
semanticscholar +2 more sources
A novel optimal multi-pattern matching method with wildcards for DNA sequence. [PDF]
Technol Health Care, 2021 Wang X +4 more
europepmc +3 more sources
Singular Value Decomposition (SVD) Method for LiDAR and Camera Sensor Fusion and Pattern Matching Algorithm. [PDF]
Sensors (Basel)Tian K +5 more
europepmc +3 more sources
Proceedings of the 15th ACM SIGPLAN International Haskell Symposium, 2022 Haskell is a popular choice for hosting deeply embedded languages. A recurring challenge for these embeddings is how to seamlessly integrate user defined algebraic data types. In particular, one important, convenient, and expressive feature for creating and inspecting data -- pattern matching -- is not directly available on embedded terms. We present a
McDonell, Trevor L. +2 more
openaire +3 more sources
Faster Approximate Pattern Matching: A Unified Approach [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 In the approximate pattern matching problem, given a text $T$, a pattern $P$, and a threshold $k$, the task is to find (the starting positions of) all substrings of $T$ that are at distance at most $k$ from $P$.
P. Charalampopoulos +2 more
semanticscholar +1 more source
Quantum-effective exact multiple patterns matching algorithms for biological sequences [PDF]
PeerJ Computer Science, 2022 This article presents efficient quantum solutions for exact multiple pattern matching to process the biological sequences. The classical solution takes Ο(mN) time for matching m patterns over N sized text database.
Kapil Kumar Soni, Akhtar Rasool
doaj +2 more sources
Refactoring pattern matching [PDF]
Science of Computer Programming, 2013 Defining functions by pattern matching over the arguments is advantageous for understanding and reasoning, but it tends to expose the implementation of a datatype. Significant effort has been invested in tackling this loss of modularity; however, decoupling patterns from concrete representations while maintaining soundness of reasoning has been a ...
Wang, Meng +3 more
openaire +3 more sources
Pattern Matching Based on Object Graphs
IEEE Access, 2021 Pattern matching has been widely adopted in functional programming languages, and is gradually getting popular in OO languages, from Scala to Python.
Wei Ke, Ka-Hou Chan
doaj +1 more source
Generalised Pattern Matching Revisited [PDF]
, 2020 In the problem of Generalised Pattern Matching (GPM) [STOC'94, Muthukrishnan and Palem], we are given a text T of length n over an alphabet Σ_T, a pattern P of length m over an alphabet Σ_P, and a matching relationship ⊆ Σ_T × Σ_P, and must return all ...
Dudek, Bartłomiej +2 more
core +2 more sources