Literature DB >> 3003678

Should nucleotide sequence analyzing computer algorithms always extend homologies by extending homologies?

L Burnett, A Basten, W J Hensley.   

Abstract

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.

Mesh：

Substances：

Year:  1986        PMID： 3003678      PMCID： PMC339426          DOI： 10.1093/nar/14.1.425

Source DB:  PubMed          Journal:  Nucleic Acids Res        ISSN： 0305-1048            Impact factor:   16.971


  6 in total

1.  Computer analysis of nucleic acid regulatory sequences.

Authors:  L J Korn; C L Queen; M N Wegman
Journal:  Proc Natl Acad Sci U S A       Date:  1977-10       Impact factor: 11.205

2.  Computer analysis of nucleic acids and proteins.

Authors:  C L Queen; L J Korn
Journal:  Methods Enzymol       Date:  1980       Impact factor: 1.600

3.  Complementary relationship between repetitive sequences in the SV40 early gene pre-promoter enhancing region and big-T antigen splice junction exons.

Authors:  L Burnett; A Basten; W J Hensley
Journal:  J Theor Biol       Date:  1984-10-21       Impact factor: 2.691

4.  SEQ: a nucleotide sequence analysis and recombination system.

Authors:  D L Brutlag; J Clayton; P Friedland; L H Kedes
Journal:  Nucleic Acids Res       Date:  1982-01-11       Impact factor: 16.971

5.  Further procedures for sequence analysis by computer.

Authors:  R Staden
Journal:  Nucleic Acids Res       Date:  1978-03       Impact factor: 16.971

6.  Sequence data handling by computer.

Authors:  R Staden
Journal:  Nucleic Acids Res       Date:  1977-11       Impact factor: 16.971
  6 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.