Introducing efficient parallelism into approximate string matching and a new serial algorithm

Fast parallel algorithms for the unit cost editing distance between trees

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

Efficient 2-dimensional approximate matching of non-rectangular figures

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Optimal parallel suffix tree construction

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Neighborhood preserving hashing and approximate queries

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Dynamic LCA queries on trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Approximate string matching: a simpler faster algorithm

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Suffix arrays: a new method for on-line string searches

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms

The string edit distance matching problem with moves

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

A System for Approximate Tree Matching

IEEE Transactions on Knowledge and Data Engineering

Fast Evolutionary Chains

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics

A sublinear algorithm for weakly approximating edit distance

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Secure and private sequence comparisons

Proceedings of the 2003 ACM workshop on Privacy in the electronic society

An exact parallel algorithm to compare very long biological sequences in clusters of workstations

Cluster Computing

Note: Pattern matching with pair correlation distance

Theoretical Computer Science

δ γ --- Parameterized Matching

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

Pattern Matching with Pair Correlation Distance

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

Practical Algorithms for the Longest Common Extension Problem

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval

The longest common extension problem revisited and applications to approximate string searching

Journal of Discrete Algorithms

General pattern matching

Algorithms and theory of computation handbook

Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

Secure outsourcing of sequence comparisons

PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies

A modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays

BSB'05 Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology

A new algorithm for the characteristic string problem under loose similarity criteria

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Longest common extensions via fingerprinting

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

A bibliography on computational molecular biology and genetics

Mathematical and Computer Modelling: An International Journal