Fast low-level pattern matching algorithm
This paper focuses on pattern matching in the DNA sequence. It was inspired by a previously reported method that proposes encoding both pattern and sequence using prime numbers. Although fast, the method is limited to rather small pattern lengths, due to computing precision problem. Our approach successfully deals with large patterns, due to our implementation that uses modular arithmetic. In order to get the results very fast, the code was adapted for multithreading and parallel implementations. The method is reduced to assembly language level instructions, thus the final result shows significant time and memory savings compared to the reference algorithm.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
SoftMatcha: A Soft and Fast Pattern Matcher for Billion-Scale Corpus Searches
Researchers and practitioners in natural language processing and computational linguistics frequently observe and analyze the real language usage in large-scale corpora. For that purpose, they often employ off-the-shelf …
ArticlesWord EmbeddingsFast Key Points Detection and Matching for Tree-Structured Images
This paper offers a new authentication algorithm based on image matching of nano-resolution visual identifiers with tree-shaped patterns. The algorithm includes image-to-tree conversion by greedy extraction of the fracta…
Graph MatchingKey Point MatchingRE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction
Semantic matching is a mainstream paradigm of zero-shot relation extraction, which matches a given input with a corresponding label description. The entities in the input should exactly match their hypernyms in the descr…
RelationRelation ExtractionSentenceAerial Map-Based Navigation Using Semantic Segmentation and Pattern Matching
This paper proposes a novel approach to map-based navigation system for unmanned aircraft. The proposed system attempts label-to-label matching, not image-to-image matching, between aerial images and a map database. The …
Deep LearningImage-Based LocalizationPositionSemantic SegmentationImproving Subgraph Matching by Combining Algorithms and Graph Neural Networks
Homomorphism is a key mapping technique between graphs that preserves their structure. Given a graph and a pattern, the subgraph homomorphism problem involves finding a mapping from the pattern to the graph, ensuring tha…
Graph Neural Network