Skip Navigation

Biometrika 1975 62(3):661-664; doi:10.1093/biomet/62.3.661
© 1975 by Biometrika Trust
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by DELCOIGNE, A.
Right arrow Articles by HANSEN, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Sequence comparison by dynamic programming

A. DELCOIGNE and P. HANSEN

Facvlté Universitaire Catholique de Mons Belgium
Institut d'Economie Scientifique et de Gestion Lille, France

A dynamic programming algorithm is proposed for slotting together two ordered sequences in an optimal manner. Computational experience is discussed.

Key Words: Comparison of sequences • Dynamic programming • Slotting


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Geological Society, London, Special PublicationsHome page
R. Thompson and R. M. Clark
Quantitative marine sediment core matching using a modified sequence-slotting algorithm
Geological Society, London, Special Publications, January 1, 1993; 70(1): 39 - 49.
[Abstract] [PDF]

Home page
 Progress in Physical GeographyHome page
K. J. Edwards and K. J. Edwards
Quaternary palynology: multiple profile studies and pollen variability
Progress in Physical Geography, December 1, 1983; 7(4): 587 - 609.
[PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.