Peltola et al., 2014 - Google Patents
String matching with lookaheadPeltola et al., 2014
View HTML- Document ID
- 17611328783551949592
- Author
- Peltola H
- Tarhio J
- Publication year
- Publication venue
- Discrete Applied Mathematics
External Links
Snippet
Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string matching. Forward-SBNDM inspects a 2-gram in the text such that the first character is the last one of an alignment window of the pattern and the second one is then outside the …
- 229920003013 deoxyribonucleic acid 0 abstract description 9
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
- G06F9/30021—Compare instructions, e.g. Greater-Than, Equal-To, MINMAX
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/44—Encoding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/43—Checking; Contextual analysis
- G06F8/436—Semantic checking
- G06F8/437—Type checking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/42—Syntactic analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/32—Address formation of the next instruction, e.g. incrementing the instruction counter, jump
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30964—Querying
- G06F17/30979—Query processing
- G06F17/30985—Query processing by using string matching techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/55—Detecting local intrusion or implementing counter-measures
- G06F21/56—Computer malware detection or handling, e.g. anti-virus arrangements
- G06F21/562—Static detection
- G06F21/563—Static detection by source code analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Suzuki et al. | Introducing difference recurrence relations for faster semi-global alignment of long sequences | |
| Vasimuddin et al. | Efficient architecture-aware acceleration of BWA-MEM for multicore systems | |
| Peltola et al. | Alternative algorithms for bit-parallel string matching | |
| Fisher et al. | Compiling for SIMD within a register | |
| US6324689B1 (en) | Mechanism for re-writing an executable having mixed code and data | |
| Ďurian et al. | Tuning BNDM with q-grams | |
| US5625773A (en) | Method of encoding and line breaking text | |
| Peltola et al. | Variations of Forward-SBNDM. | |
| Kalsi et al. | Comparison of exact string matching algorithms for biological sequences | |
| Cameron et al. | Bitwise data parallelism in regular expression matching | |
| Peltola et al. | String matching with lookahead | |
| Ďurian et al. | Improving practical exact string matching | |
| Tolmachev et al. | Design and structure of the Juman++ morphological analyzer toolkit | |
| Ďurian et al. | Bit-parallel search algorithms for long patterns | |
| Bingmann et al. | Engineering faster sorters for small sets of items | |
| Louza et al. | Inducing the Lyndon array | |
| Fischer et al. | Practical evaluation of lempel-Ziv-78 and lempel-ziv-welch tries | |
| Blacher et al. | Fast and robust vectorized in-place sorting of primitive types | |
| Groth et al. | Parallelizing Approximate Search on Adaptive Radix Trees. | |
| García et al. | Vectorization of multigrid codes using SIMD ISA extensions | |
| Kociumaka et al. | Faster recovery of approximate periods over edit distance | |
| Hirvola | Bit-parallel approximate string matching under Hamming distance | |
| Aydoğmuş et al. | Optimizing packed string matching on AVX2 platform | |
| Cameron et al. | Bitwise data parallelism with llvm: The icgrep case study | |
| Fredriksson | Row-wise tiling for the Myers’ bit-parallel approximate string matching algorithm |