This paper gives a formal definition of the biological concept of evolutionary distance and an algorithm to compute it. For any set S of finite sequences of varying lengths this distance is a real-valued function on $S S$, and it is shown to be a metric under conditions which are wide enough to include the biological application. The algorithm, introduced here, lends itself to computer programming and provides a method to compute evolutionary distance which is shorter than the other methods currently in use.
Description
This article delineates the concept of evolutionary distance. The evolutionary distance between two proteins is the number of mutations necessary to convert one to the other. The algorithm used in this article built on the Needleman-Wunsch algorithm and would later form a basis for the Smith-Waterman algorithm.
%0 Journal Article
%1 sellers1974theory
%A Sellers, Peter H.
%D 1974
%J SIAM Journal of Applied Mathematics
%K 8 background dna methods phylogeny
%N 4
%P 787-793
%R 10.1137/0126070
%T On the theory and computation of evolutionary distances
%V 26
%X This paper gives a formal definition of the biological concept of evolutionary distance and an algorithm to compute it. For any set S of finite sequences of varying lengths this distance is a real-valued function on $S S$, and it is shown to be a metric under conditions which are wide enough to include the biological application. The algorithm, introduced here, lends itself to computer programming and provides a method to compute evolutionary distance which is shorter than the other methods currently in use.
@article{sellers1974theory,
abstract = {This paper gives a formal definition of the biological concept of evolutionary distance and an algorithm to compute it. For any set S of finite sequences of varying lengths this distance is a real-valued function on $S \times S$, and it is shown to be a metric under conditions which are wide enough to include the biological application. The algorithm, introduced here, lends itself to computer programming and provides a method to compute evolutionary distance which is shorter than the other methods currently in use.},
added-at = {2017-10-26T01:24:26.000+0200},
author = {Sellers, Peter H.},
biburl = {https://www.bibsonomy.org/bibtex/2193c8635deda05ca45f0a6f412c78210/artheibault},
description = {This article delineates the concept of evolutionary distance. The evolutionary distance between two proteins is the number of mutations necessary to convert one to the other. The algorithm used in this article built on the Needleman-Wunsch algorithm and would later form a basis for the Smith-Waterman algorithm.},
doi = {10.1137/0126070},
interhash = {ead00cc5173048b5656d732675aa0645},
intrahash = {193c8635deda05ca45f0a6f412c78210},
journal = {SIAM Journal of Applied Mathematics},
keywords = {8 background dna methods phylogeny},
number = 4,
pages = {787-793},
timestamp = {2017-10-26T01:24:26.000+0200},
title = {On the theory and computation of evolutionary distances},
volume = 26,
year = 1974
}