Searching DNA databases for similarities to DNA sequences: when is a match significant? | Zendy

Isobel Anderson | Zendy; Andy Brass | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Searching DNA databases for similarities to DNA sequences: when is a match significant?

Author(s) -

Isobel Anderson,

Andy Brass

Publication year - 1998

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/14.4.349

Subject(s) - smith–waterman algorithm , computer science , database , algorithm , set (abstract data type) , dna sequencing , sequence (biology) , sequence database , dna , sequence analysis , alignment free sequence analysis , sequence alignment , data mining , genetics , biology , gene , peptide sequence , programming language

Searching DNA sequences against a DNA database is an essential element of sequence analysis. However, few systematic studies have been carried out to determine when a match between two DNA sequences has biological significance and this is limiting the use that can be made of DNA searching algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research