Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Smith-Waterman alignment search

A sequence alignment is a way of determining the similarity between two strings. This is a classical question in computer science, and has an exact solution referred to as the Smith/Waterman alignment. Unfortunately, this exact solution can be slow when analyzing large sequences, and therefore, approximate methods, such as Basic Local Alignment Search Tool (BLAST), have been developed to identify very similar sequences. [Pg.517]

See other pages where Smith-Waterman alignment search is mentioned: [Pg.200]    [Pg.200]    [Pg.62]    [Pg.59]    [Pg.550]    [Pg.128]    [Pg.75]    [Pg.95]    [Pg.179]    [Pg.139]    [Pg.58]    [Pg.59]    [Pg.45]    [Pg.252]    [Pg.96]    [Pg.534]    [Pg.193]    [Pg.193]    [Pg.195]    [Pg.414]    [Pg.213]    [Pg.344]    [Pg.1787]    [Pg.540]    [Pg.79]    [Pg.271]    [Pg.58]    [Pg.524]    [Pg.77]    [Pg.271]   
See also in sourсe #XX -- [ Pg.200 ]



SEARCH



Smith-Waterman

Waterman

© 2024 chempedia.info