ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Discrete Algorithms
Volume 1, Issues 5-6, October 2003, Pages 367-385
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (363 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
doi:10.1016/S1570-8667(03)00028-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Published by Elsevier Science B.V.

Applying an edit distance to the matching of tree ring sequences in dendrochronology*1, , *2

Carola WenkE-mail The Corresponding Author, E-mail The Corresponding Author, 1

Institut für Informatik, Freie Universität Berlin, Takustr. 9, D-14195, Berlin, Germany

Available online 15 November 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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 therefore introduce a Image algorithm for dating such a sample sequence against an error-free master sequence, where n and m are the lengths of the sequences. Our algorithm takes into account that the sample might contain up to α missing or double rings and suggests possible positions for these kind of inconsistencies. This is done by employing an edit distance as the distance measure.

Author Keywords: Edit distance; Crossdating; Dendrochronology


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.