Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Martin Farach-Colton
Optimal Spaced Seeds for Faster Approximate String Matching
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Discovering Temporal Relations in Molecular Pathways Using Protein-Protein Interactions
Related publications
Vector Algorithms for Approximate String Matching
International Journal of Foundations of Computer Science
Computer Science
Fast Algorithms for Approximate Circular String Matching
Algorithms for Molecular Biology
Computational Theory
Applied Mathematics
Structural Biology
Molecular Biology
Mathematics
Correction To: New Algorithms for Fixed-Length Approximate String Matching and Approximate Circular String Matching Under the Hamming Distance
Journal of Supercomputing
Hardware
Information Systems
Theoretical Computer Science
Architecture
Software
A Comparison of Approximate String Matching Algorithms
Software - Practice and Experience
Software
Catchem: A Browser Plugin for the Panama Papers Using Approximate String Matching
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
Journal of the ACM
Control
Systems Engineering
Information Systems
Hardware
Architecture
Artificial Intelligence
Software
An Optimal Implementation of the Approximate String Matching on the Hierarchical Memory Machine, With Performance Evaluation on the GPU
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Implementation of a Programmable Array Processor Architecture for Approximate String Matching Algorithms on FPGAs
Parallel String Matching
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science