OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Smith–Waterman algorithm

 Home Mathematics Fields of mathematics Applied mathematics Algorithms Bioinformatics algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Smith-Waterman algorithm is a dynamic programming algorithm used for local sequence alignment in bioinformatics. It helps to find the most similar regions between two biological sequences, such as DNA, RNA, or protein sequences. Unlike global alignment algorithms (like the Needleman-Wunsch algorithm), which align entire sequences, the Smith-Waterman algorithm focuses on identifying the best matching subsequences.

 Ancestors (6)

  1. Bioinformatics algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook