A more sensitive method of searching for a homologous relation between two proteins is presented. The method depends on determining the minimum number of nucleotides which must be altered to permit tho conversion of one sequence into the other. Results for α- and β-hemoglobin, for which the homology is already known, are presented and shown to be consistent.
Description
This article describes an algorithm used to determine the homology between two proteins. It accomplishes this by calculating the number of mutations that would need to occur to convert one protein sequence to the other. The Needleman-Wunsch algorithm builds off of the algorithm shown here.
%0 Journal Article
%1 fitch1966improved
%A Fitch, Walter M.
%D 1966
%J Journal of Molecular Biology
%K 8 algorithms background methods proteins
%P 9-16
%R 10.1016/S0022-2836(66)80258-9
%T An Improved Method of Testing for Evolutionary Homology
%V 16
%X A more sensitive method of searching for a homologous relation between two proteins is presented. The method depends on determining the minimum number of nucleotides which must be altered to permit tho conversion of one sequence into the other. Results for α- and β-hemoglobin, for which the homology is already known, are presented and shown to be consistent.
@article{fitch1966improved,
abstract = {A more sensitive method of searching for a homologous relation between two proteins is presented. The method depends on determining the minimum number of nucleotides which must be altered to permit tho conversion of one sequence into the other. Results for α- and β-hemoglobin, for which the homology is already known, are presented and shown to be consistent.},
added-at = {2017-10-25T20:16:16.000+0200},
author = {Fitch, Walter M.},
biburl = {https://www.bibsonomy.org/bibtex/2074645772742d4c1f4826c9074a2b19b/artheibault},
description = {This article describes an algorithm used to determine the homology between two proteins. It accomplishes this by calculating the number of mutations that would need to occur to convert one protein sequence to the other. The Needleman-Wunsch algorithm builds off of the algorithm shown here.},
doi = {10.1016/S0022-2836(66)80258-9},
interhash = {2bf067d03f058e030f2449ad9c973150},
intrahash = {074645772742d4c1f4826c9074a2b19b},
journal = {Journal of Molecular Biology},
keywords = {8 algorithms background methods proteins},
month = mar,
pages = {9-16},
timestamp = {2017-10-25T21:29:32.000+0200},
title = {An Improved Method of Testing for Evolutionary Homology},
volume = 16,
year = 1966
}