Login / Signup
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements.
Johra Muhammad Moosa
M. Sohel Rahman
Fatema Tuz Zohora
Published in:
J. Discrete Algorithms (2013)
Keyphrases
</>
longest common subsequence
biological sequences
dynamic time warping
edit distance
finite automata
approximation algorithms
similarity function
sequence matching
similarity measure
hidden markov models
np hard
pattern recognition
knowledge discovery
sequence data
molecular biology
subsequence matching