The following pages link to A fast string searching algorithm (Q3090391):
Displaying 50 items.
- Fast string matching in stationary ergodic sources (Q2785374) (← links)
- Efficient Algorithms for the Order Preserving Pattern Matching Problem (Q2830069) (← links)
- Performance Estimation Using Symbolic Data (Q2842645) (← links)
- Inferring strings from cover arrays (Q2846478) (← links)
- Fast Order-Preserving Pattern Matching (Q2867128) (← links)
- Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts (Q2909199) (← links)
- Algorithms for jumbled pattern matching in strings (Q2909200) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- Finite Automata for Generalized Approach to Backward Pattern Matching (Q3073621) (← links)
- Regular Expressions at Their Best: A Case for Rational Design (Q3073651) (← links)
- (Q3143774) (← links)
- (Q3165665) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (Q3421840) (← links)
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME (Q3421849) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- Accelerating Boyer Moore Searches on Binary Texts (Q3503901) (← links)
- On String Matching in Chunked Texts (Q3503903) (← links)
- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching (Q3618607) (← links)
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density (Q3634488) (← links)
- Fast Searching in Packed Strings (Q3637108) (← links)
- The conjugacy problem in subgroups of right-angled Artin groups (Q3644315) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS (Q3655532) (← links)
- Parallel String Matching Algorithms (Q3814826) (← links)
- An 0(1) time algorithm for string matching (Q3989790) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences (Q4639924) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- A high-speed dynamic full-text search method by using memory management (Q4652853) (← links)
- Shimba-an environment for reverse engineering Java software systems (Q4791091) (← links)
- A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences (Q4792964) (← links)
- A concurrent multi-string matching from multi-text algorithm based on the algorithm of Hamiltonian Path Problem and DNA computation (Q4821804) (← links)
- Boosting Pattern Matching Performance via k-bit Filtering (Q4932641) (← links)
- Fast algorithms for two dimensional and multiple pattern matching (Q5056115) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- Pattern matching in hypertext (Q5096935) (← links)
- (Q5111826) (← links)
- (Q5140763) (← links)
- Creating improvisations on chord progressions using suffix trees (Q5207099) (← links)
- PAMA: A FAST STRING MATCHING ALGORITHM (Q5291301) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING (Q5404517) (← links)
