ACM SIGACT News
Pattern-matching and text-compression algorithms
ACM Computing Surveys (CSUR)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Matching and indexing sequences of different lengths
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Algorithms for Variable Length Subnet Address Assignment
IEEE Transactions on Computers
Learning one-variable pattern languages in linear average time
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Pattern Matching Image Compression: Algorithmic and Empirical Results
IEEE Transactions on Pattern Analysis and Machine Intelligence
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
On Estimating the Large Entries of a Convolution
IEEE Transactions on Computers
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)
Journal of Symbolic Computation
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Compact recognizers of episode sequences
Information and Computation
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
Tree pattern matching with a more general notion of occurrence of the pattern
Information Processing Letters
Information Retrieval
A speed-up for the commute between subword trees and DAWGs
Information Processing Letters
Regular biosequence pattern matching with cellular automata
Information Sciences—Applications: An International Journal
Parallel implementations for string matching problem on a cluster of distributed workstations
Neural, Parallel & Scientific Computations
Pattern-matching problems for two-dimensional images described by finite automata
Nordic Journal of Computing
On special families of morphisms related to δ-matching and don't care symbols
Information Processing Letters
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Variations on a Theorem of Fine & Wilf
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Word Equations in One Variable
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Space-Economical Construction of Index Structures for All Suffixes of a String
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Text Compression Using Antidictionaries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Combinatorics of Periods in Strings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Compact Directed Acyclic Word Graphs for a Sliding Window
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Tree Pattern Matching for Linear Static Terms
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Similarity in Two-Dimensional Strings
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Repetition Complexity of Words
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Complexity of Sequential Pattern Matching Algorithms
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Discovering Best Variable-Length-Don't-Care Patterns
DS '02 Proceedings of the 5th International Conference on Discovery Science
Mining from Literary Texts: Pattern Discovery and Similarity Computation
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Approximate String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Simple Optimal String Matching Algorithm
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Fuzzy Hamming Distance: A New Dissimilarity Measure
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Multiple Pattern Matching Algorithms on Collage System
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Experimental String Matching by Weak Factor Recognition
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
String Matching with Stopper Encoding and Code Splitting
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Faster Bit-Parallel Approximate String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
The Problem of Context Sensitive String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
DS '00 Proceedings of the Third International Conference on Discovery Science
Fast Multi-dimensional Approximate Pattern Matching
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Eliminating Useless Parts in Semi-structured Documents Using Alternation Counts
DS '01 Proceedings of the 4th International Conference on Discovery Science
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On Maximal Repetitions in Words
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Time/Space Efficient Compressed Pattern Matching
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Combinatorial and Computational Problems on Finite Sets of Words
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
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
On the Complexity of Decidable Cases of Commutation Problem for Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Discovering instances of poetic allusion from anthologies of classical Japanese poems
Theoretical Computer Science
Discovering characteristic expressions in literary works
Theoretical Computer Science
Information and Computation
Periodicity, morphisms, and matrices
Theoretical Computer Science - Mathematical foundations of computer science
Development reuse and the logic program derivation of two string-matching algorithms
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Collage system: a unifying framework for compressed pattern matching
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
String pattern matching for a deluge survival kit
Handbook of massive data sets
Approximate pattern matching and transitive closure logics
Theoretical Computer Science
A new regular grammar pattern matching algorithm
Theoretical Computer Science
On maximal suffixes and constant-space linear-time versions of KMP algorithm
Theoretical Computer Science
Approximate Pattern Matching is Expressible in Transitive Closure Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of 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
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Conjugacy and episturmian morphisms
Theoretical Computer Science
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Faster Approximate String Matching over Compressed Text
DCC '01 Proceedings of the Data Compression Conference
Truncated suffix trees and their application to data compression
Theoretical Computer Science
Disjunctive partial deduction of a right-to-left string-matching algorithm
Information Processing Letters
A unifying look at the Apostolico--Giancarlo string-matching algorithm
Journal of Discrete Algorithms
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
A Boyer--Moore-style algorithm for regular expression pattern matching
Science of Computer Programming
Reliable Detection of Episodes in Event Sequences
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Special issue - Computing patterns in strings: foreword
Fundamenta Informaticae - Special issue on computing patterns in strings
Time/space efficient compressed pattern matching
Fundamenta Informaticae - Special issue on computing patterns in strings
Combinatorics of periods in strings
Journal of Combinatorial Theory Series A
Transposition invariant pattern matching for multi-track strings
Nordic Journal of Computing
Random Structures & Algorithms
Efficient K-NN search in polyphonic music databases using a lower bounding mechanism
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
Approximate string matching on Ziv-Lempel compressed text
Journal of Discrete Algorithms
String transformation learning
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Compact directed acyclic word graphs for a sliding window
Journal of Discrete Algorithms - SPIRE 2002
Two-dimensional pattern matching with rotations
Theoretical Computer Science
An algorithm for analysis of images in spatial information systems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Theoretical Computer Science
SPARE parts: a C++ toolkit for string pattern recognition
Software—Practice & Experience
Average complexity of exact and approximate multiple string matching
Theoretical Computer Science
Average-optimal single and multiple approximate string matching
Journal of Experimental Algorithmics (JEA)
Linear-time computation of local periods
Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Ternary directed acyclic word graphs
Theoretical Computer Science - Implementation and application of automata
Scaled and permuted string matching
Information Processing Letters
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Reliable detection of episodes in event sequences
Knowledge and Information Systems
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Meta-evaluation of summaries in a cross-lingual environment using content-based metrics
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Evaluation challenges in large-scale document summarization
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Space efficient search for maximal repetitions
Theoretical Computer Science - Combinatorics on words
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles
Software—Practice & Experience
Transposition invariant string matching
Journal of Algorithms
Efficient evaluation of parameterized pattern queries
Proceedings of the 14th ACM international conference on Information and knowledge management
Geoinformatica
WARP: Time Warping for Periodicity Detection
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
A Genetic Engineering Approach to Genetic Algorithms
Evolutionary Computation
Journal of the ACM (JACM)
Automatic indexing of online health resources for a French quality controlled gateway
Information Processing and Management: an International Journal
Discrete Applied Mathematics
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Multipattern string matching with q-grams
Journal of Experimental Algorithmics (JEA)
The wide window string matching algorithm
Theoretical Computer Science
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science
Testing primitivity on partial words
Discrete Applied Mathematics
The influence of polyphony on the dynamical modelling of musical timbre
Pattern Recognition Letters
An automata-theoretic approach to the word problem for ω -terms over R
Theoretical Computer Science
Efficient parameterized string matching
Information Processing Letters
Equivalence of simple functions
Theoretical Computer Science
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Journal of Discrete Algorithms
Data & Knowledge Engineering
The number of runs in a string
Information and Computation
Theoretical Computer Science
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
Theoretical Computer Science
Fast nGram-based string search over data encoded using algebraic signatures
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Parallel text searching applications on a heterogeneous cluster architecture
International Journal of Computational Science and Engineering
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters
Fast profile matching algorithms – A survey
Theoretical Computer Science
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
Information Processing Letters
Recovering Repetitive Sub-functions from Observations
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Searching for Gapped Palindromes
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
Algorithms for subsequence combinatorics
Theoretical Computer Science
Discrete Applied Mathematics
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Discovering subword associations in strings in time linear in the output size
Journal of Discrete Algorithms
Parameterized matching on non-linear structures
Information Processing Letters
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
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
International Journal of Bioinformatics Research and Applications
On the size of Boyer-Moore automata
Theoretical Computer Science
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
Accelerating Boyer-Moore searches on binary texts
Theoretical Computer Science
Biologically inspired defenses against computer viruses
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Searching for gapped palindromes
Theoretical Computer Science
Human activity encoding and recognition using low-level visual features
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Improving practical exact string matching
Information Processing Letters
Discrete Applied Mathematics
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
Automatic indexing of online health resources for a French quality controlled gateway
Information Processing and Management: an International Journal
Scaled and permuted string matching
Information Processing Letters
Transposition invariant string matching
Journal of Algorithms
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
On the implementation of compact DAWG's
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Two-dimensional pattern matching with rotations
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Average-optimal multiple approximate string matching
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Tuning string matching for huge pattern sets
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Ternary directed acyclic word graphs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Fast search algorithms for position specific scoring matrices
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Accelerating Boyer Moore searches on binary texts
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete 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
Average case analysis of algorithms
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Finding Significant Matches of Position Weight Matrices in Linear Time
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient decision tree for protocol analysis in intrusion detection
International Journal of Security and Networks
Worst case efficient single and multiple string matching in the RAM model
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Simple real-time constant-space string matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Near real-time suffix tree construction via the fringe marked ancestor problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On-line construction of position heaps
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A new family of string classifiers based on local relatedness
DS'06 Proceedings of the 9th international conference on Discovery Science
All semi-local longest common subsequences in subquadratic time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Finding the position of the k-mismatch and approximate tandem repeats
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Algorithms for finding a most similar subforest
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Finding common motifs with gaps using finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
String matching with mismatches by real-valued FFT
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Crochemore factorization of sturmian and other infinite words
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the structure of compacted subword graphs of Thue-Morse words and their applications
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On bit-parallel processing of multi-byte text
AIRS'04 Proceedings of the 2004 international conference on Asian Information Retrieval Technology
An efficient pattern matching algorithm on a subclass of context free grammars
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
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
Equivalence of functions represented by simple context-free grammars with output
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A taxonomy of some right-to-left string-matching algorithms
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms
On suffix extensions in suffix trees
Theoretical Computer Science
An efficient linear pseudo-minimization algorithm for aho-corasick automata
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Efficient algorithm for circular burrows-wheeler transform
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Time/Space Efficient Compressed Pattern Matching
Fundamenta Informaticae - Computing Patterns in Strings
Fundamenta Informaticae - Computing Patterns in Strings
Performance assessment of dead-zone single keyword pattern matching
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Privacy preserving monitoring and surveillance in sensor networks
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
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
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
Simple real-time constant-space string matching
Theoretical Computer Science
A note on a simple computation of the maximal suffix of a string
Journal of Discrete Algorithms
On-line construction of position heaps
Journal of Discrete Algorithms
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Journal of Experimental Algorithmics (JEA)
Compressed automata for dictionary matching
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Fast Longest Common Subsequence with General Integer Scoring Support on GPUs
Proceedings of Programming Models and Applications on Multicores and Manycores
Text searching allowing for inversions and translocations of factors
Discrete Applied Mathematics
| Hi-index | 0.04 |