Dynamic partitioning of search patterns for approximate pattern matching using search schemes [PDF]
iScience, 2021 Summary: Search schemes constitute a flexible and generic framework to describe how all approximate occurrences of a search pattern in a text can be found efficiently.
Luca Renders +2 more
doaj +2 more sources
Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps. [PDF]
PLoS ONE, 2012 BACKGROUND: For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them.
Kentaro Inoue +3 more
doaj +2 more sources
b-move: faster lossless approximate pattern matching in a run-length compressed index [PDF]
Algorithms for Molecular BiologyBackground Due to the increasing availability of high-quality genome sequences, pan-genomes are gradually replacing single consensus reference genomes in many bioinformatics pipelines to better capture genetic diversity.
Lore Depuydt +5 more
doaj +2 more sources
NETASPNO: Approximate Strict Pattern Matching Under Nonoverlapping Condition
IEEE Access, 2018 In pattern matching, a gap constraint is a more flexible wildcard than traditional wildcards “?”and “*”. Pattern matching with gap constraints is more difficult to handle and fulfills user's enquiries more easily.
Youxi Wu +4 more
doaj +3 more sources
A novel linear indexing method for strings under all internal nodes in a suffix tree [PDF]
Frontiers in BioinformaticsSuffix trees are fundamental data structures in stringology and have wide applications across various domains. In this work, we propose two linear-time algorithms for indexing strings under each internal node in a suffix tree while preserving the ability
Anas Al-okaily, Abdelghani Tbakhi
doaj +2 more sources
Approximate Circular Pattern Matching
CoRR, 2022 AT_PUBLICATION
P. Charalampopoulos (Panagiotis) +6 more
+11 more sources
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations. [PDF]
PLoS ONE, 2017 Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k ...
ThienLuan Ho, Seung-Rohk Oh, HyunJin Kim
doaj +1 more source
On approximate pattern matching with thresholds [PDF]
Information Processing Letters, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peng Zhang 0052, Mikhail J. Atallah
openaire +1 more source
Approximate Content-Addressable Memories: A Review
Chips, 2023 Content-addressable memory (CAM) has been part of the memory market for more than five decades. CAM can carry out a single clock cycle lookup based on the content rather than an address.
Esteban Garzón +3 more
doaj +1 more source
Linear Approximate Pattern Matching Algorithm [PDF]
, 2021 Abstract Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference stream of data (usually of large length). The matching can be as an exact or as an approximate (inexact) matching.
Anas Al-Okaily, AbdelGhani Tbakhi
openaire +2 more sources