The C programming language
Improved string matching with k mismatches
ACM SIGACT News
Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Software—Practice & Experience
A new approach to text searching
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient text searching
A very fast substring search algorithm
Communications of the ACM
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Experiments with a very fast substring search algorithm
Software—Practice & Experience
Information retrieval
Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Communications of the ACM
Unstructured data bases or very efficient text searching
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Text-Retrieval: Theory and Practice
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
String Searching Algorithms Revisited
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Fast and Practical Approximate String Matching
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
Discovering Patterns from Large and Dynamic Sequential Data
Journal of Intelligent Information Systems
An efficient text input method for pen-based computers
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Window-accumulated subsequence matching problem is linear
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
A new string-pattern matching algorithm using partitioning and hashing efficiently
Journal of Experimental Algorithmics (JEA)
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Research on a faster algorithm for pattern matching
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
Adding Compression to Block Addressing Inverted Indexes
Information Retrieval
New and faster filters for multiple approximate string matching
Random Structures & Algorithms
Tries for Approximate String Matching
IEEE Transactions on Knowledge and Data Engineering
CASM: A VLSI Chip for Approximate String Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast algorithm for extracting multiple unordered short motifs using bit operations
Information Sciences—Applications: An International Journal
Parallel implementations for string matching problem on a cluster of distributed workstations
Neural, Parallel & Scientific Computations
Database indexing for large DNA and protein sequence collections
The VLDB Journal — The International Journal on Very Large Data Bases
Faster String Matching with Super-Alphabets
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Fast Regular Expression Search
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The Max-Shift Algorithm for Approximate String Matching
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Compact DFA Representation for Fast Regular Expression Search
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Fast Implementations of Automata Computations
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Bit Parallelism - NFA Simulation
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Shift-And Approach to Pattern Matching in LZW Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Text Searching on a Heterogeneous Cluster of Workstations
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Speeding Up Pattern Matching by Text Compression
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Application of max-plus algebra to biological sequence comparisons
Theoretical Computer Science
A note on randomized algorithm for string matching with mismatches
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Shift-or string matching with super-alphabets
Information Processing Letters
Occurrence and substring heuristics for δ-matching
Fundamenta Informaticae - Special issue on computing patterns in strings
Fast multipattern search algorithms for intrusion detection
Fundamenta Informaticae - Special issue on computing patterns in strings
Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms
Fundamenta Informaticae - Special issue on computing patterns in strings
Transposition invariant pattern matching for multi-track strings
Nordic Journal of Computing
Ladderlike stepping and interval jumping searching algorithms for DNA sequences
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Exact pattern matching for RNA secondary structures
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Bases of Motifs for Generating Repeated Patterns with Wild Cards
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximate string matching with ordered q-grams
Nordic Journal of Computing
Proceedings of the 2005 ACM symposium on Applied computing
Exact matching of RNA secondary structure patterns
Theoretical Computer Science - Pattern discovery in the post genome
Multiple serial episodes matching
Information Processing Letters
The Mercury system: exploiting truly fast hardware for data search
SNAPI '03 Proceedings of the international workshop on Storage network architecture and parallel I/Os
Increased bit-parallelism for approximate and multiple string matching
Journal of Experimental Algorithmics (JEA)
Multipattern string matching with q-grams
Journal of Experimental Algorithmics (JEA)
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
The wide window string matching algorithm
Theoretical Computer Science
A programmable array processor architecture for flexible approximate string matching algorithms
Journal of Parallel and Distributed Computing
Efficient parameterized string matching
Information Processing Letters
Efficient String Matching in Huffman Compressed Texts
Fundamenta Informaticae
A general compression algorithm that supports fast searching
Information Processing Letters
Efficient generation of super condensed neighborhoods
Journal of Discrete Algorithms
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
Bit-parallel string matching under Hamming distance in O(n⌈m/w⌉) worst case time
Information Processing Letters
Fast pattern-matching on indeterminate strings
Journal of Discrete Algorithms
A software system for gene sequence database construction based on fast approximate string matching
International Journal of Bioinformatics Research and Applications
Parallel text searching applications on a heterogeneous cluster architecture
International Journal of Computational Science and Engineering
Hardware implementation for network intrusion detection rules with regular expression support
Proceedings of the 2008 ACM symposium on Applied computing
Processor array architectures for flexible approximate string matching
Journal of Systems Architecture: the EUROMICRO Journal
Finding the longest common subsequence for multiple biological sequences by ant colony optimization
Computers and Operations Research
FPGA based string matching for network processing applications
Microprocessors & Microsystems
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
Fast and compact regular expression matching
Theoretical Computer Science
Faster pattern matching with character classes using prime number encoding
Journal of Computer and System Sciences
Pattern Matching with Swaps for Short Patterns in Linear Time
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Multi-patterns parameterized shift-and string matching algorithm with super alphabets
Proceedings of the International Conference on Advances in Computing, Communication and Control
Nested Counters in Bit-Parallel String Matching
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
FPGA-based ROM-free network intrusion detection using shift-OR circuit
Journal of Embedded Computing - Design and Optimization for High Performance Embedded Systems
Simple Random Access Compression
Fundamenta Informaticae
Efficient Exact Pattern-Matching in Proteomic Sequences
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Fast Searching in Packed Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
International Journal of Bioinformatics Research and Applications
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Proceedings of the 2nd international conference on Security of information and networks
Average-optimal string matching
Journal of Discrete Algorithms
Identification of design motifs with pattern matching algorithms
Information and Software Technology
Improving practical exact string matching
Information Processing Letters
An Automaton for Motifs Recognition in DNA Sequences
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Multiple serial episodes matching
Information Processing Letters
A fast bit-parallel multi-patterns string matching algorithm for biological sequences
ISB '10 Proceedings of the International Symposium on Biocomputing
Efficient bit-parallel multi-patterns string matching algorithms for limited expression
Proceedings of the Third Annual ACM Bangalore Conference
Tuning string matching for huge pattern sets
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Software maintenance by multi-patterns parameterized string matching with q-gram
ACM SIGSOFT Software Engineering Notes
Parameterized string matching: an application to software maintenance
ACM SIGSOFT Software Engineering Notes
Simple compression code supporting random access and fast string matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A neural network string matcher
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Significant subpatterns matching
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Tuning approximate Boyer-Moore for gene sequences
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Algorithms for weighted matching
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
A new model to solve the swap matching problem and efficient algorithms for short patterns
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
Fundamenta Informaticae
A hash trie filter method for approximate string matching in genomic databases
Applied Intelligence
Regular expression matching with multi-strings and intervals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Bit-(parallelism)2: getting to the next level of parallelism
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast bit-parallel matching for network and regular expressions
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Fast searching in packed strings
Journal of Discrete Algorithms
An intelligent system for gathering rates of local taxes on the web
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A regular expression matching circuit based on a decomposed automaton
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
Pattern matching in the Hamming distance with thresholds
Information Processing Letters
WHAM: a high-throughput sequence alignment method
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient algorithm for detecting parameterized multiple clones in a large software system
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Efficient bit-parallel algorithms for (δ, α)-matching
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Efficient logic circuit for network intrusion detection
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Sublinear algorithms for parameterized matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Finding patterns with variable length gaps or don’t cares
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A new approach to determinisation using bit-parallelism
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A fast algorithm for approximate string matching on gene sequences
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
An efficient algorithm for generating super condensed neighborhoods
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
New algorithms for regular expression matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Journal of Discrete Algorithms
Parallel pattern matching with swaps on a linear array
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
On bit-parallel processing of multi-byte text
AIRS'04 Proceedings of the 2004 international conference on Asian Information Retrieval Technology
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Information and Computation
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications
Faster generation of super condensed neighbourhoods using finite automata
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
A fast string search algorithm for deep packet classification
Computer Communications
Simple Random Access Compression
Fundamenta Informaticae
Fast Multipattern Search Algorithms for Intrusion Detection
Fundamenta Informaticae - Computing Patterns in Strings
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Fundamenta Informaticae - Computing Patterns in Strings
Occurrence and Substring Heuristics for δ-Matching
Fundamenta Informaticae - Computing Patterns in Strings
Efficient String Matching in Huffman Compressed Texts
Fundamenta Informaticae
European Journal of Combinatorics
WHAM: A High-Throughput Sequence Alignment Method
ACM Transactions on Database Systems (TODS)
Fast matching method for DNA sequences
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A measure of tortuosity based on chain coding
Pattern Recognition
A simple pattern matching algorithm for weighted sequences
Proceedings of the 2012 ACM Research in Applied Computation Symposium
A fast suffix automata based algorithm for exact online string matching
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Fast multiple string matching using streaming SIMD extensions technology
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
International Journal of Mobile Network Design and Innovation
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Journal of Experimental Algorithmics (JEA)
An efficient bit-parallel algorithm for IDS
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Finding overlaps within regular expressions with variable-length gaps
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Approximate pattern matching with k-mismatches in packed text
Information Processing Letters
A graph-theoretic model to solve the approximate string matching problem allowing for translocations
Journal of Discrete Algorithms
Simple tree pattern matching for trees in the prefix bar notation
Discrete Applied Mathematics
String matching with lookahead
Discrete Applied Mathematics
On a compact encoding of the swap automaton
Information Processing Letters
| Hi-index | 48.24 |