A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology
[chapter]
1999
Lecture Notes in Computer Science
In dendrochronology wood samples are dated according to the tree rings they contain. The dating process consists of comparing the sequence of tree ring widths in the sample to a dated master sequence. Assuming that a tree forms exactly one ring per year a simple sliding algorithm solves this matching task. But sometimes a tree produces no ring or even two rings in a year. If a sample sequence contains this kind of inconsistencies it cannot be dated correctly by the simple sliding algorithm. We
doi:10.1007/3-540-48452-3_17
fatcat:xhtetdkisrffrnmizr7nzghamm