Parallel Algorithm for Longest Common Subsequence in a String.
Tirtharaj DashTanistha NayakPublished in: CoRR (2013)
Keyphrases
- parallel algorithm
- longest common subsequence
- edit distance
- dynamic time warping
- biological sequences
- finite automata
- approximation algorithms
- similarity measure
- similarity function
- parallel computation
- sequence matching
- cluster of workstations
- subsequence matching
- regular expressions
- distance function
- parallel version
- high dimensional
- multiscale
- similarity search
- computationally efficient
- distance measure
- worst case
- nearest neighbor
- feature vectors