Enumeration of strings in Dyck paths: A bijective approach.

Aristidis Sapounakis Ioannis Tasoulas Panagiotis Tsikouras

Published in: Discret. Math. (2009)

Keyphrases

edit distance
shortest path
optimal path
finite alphabet
approximate string matching
search space
finite automata
shortest common supersequence
real time
path length
path finding
exhaustive search
distance measure
xml documents
case study
computer vision
databases