Applying an edit distance to the matching of tree ring sequences in dendrochronology.
Carola WenkPublished in: J. Discrete Algorithms (2003)
Keyphrases
- edit distance
- approximate string matching
- approximate matching
- graph matching
- tree edit distance
- string matching
- string similarity
- tree structured data
- edit operations
- longest common subsequence
- suffix tree
- normalized edit distance
- subgraph isomorphism
- finite alphabet
- distance measure
- similarity measure
- pattern matching
- levenshtein distance
- sequence matching
- dynamic time warping
- distance computation
- matching algorithm
- tree structures
- hidden markov models
- sequence databases
- graph edit distance
- distance function
- string edit distance
- tree structure
- dissimilarity measure
- object recognition
- data structure
- pattern recognition
- sequential patterns
- dynamic programming
- maximum weight
- suffix array
- record linkage
- image registration
- relaxation labeling
- point matching
- feature matching
- keypoints