Open AccessShould nueleotide sequence analyzing computer algorithms always extend homologies by extending homologies?
Author(s) -
Leslie Burnett,
Anthony Basten,
W.J. Hensley
Publication year - 1986
Publication title -
nucleic acids research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 9.008
H-Index - 537
eISSN - 1362-4954
pISSN - 0305-1048
DOI - 10.1093/nar/14.1.425
Subject(s) - biology , homology (biology) , sequence (biology) , computational biology , nucleic acid sequence , sequence alignment , base sequence , genetics , algorithm , dna , peptide sequence , computer science , gene
Most computer algorithms used for comparing or aligning nucleotide sequences rely on the premise that the best way to extend a homology between the two sequences is to select a match rather than a mismatch. We have tested this assumption and found that it is not always valid.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom