Smith-Waterman algorithm

This is a discussion on Smith-Waterman algorithm within the C++ Programming forums, part of the General Programming Boards category; Thank you guys. I really appreciate it. I have also been looking for how to implement this algorithm:The Smith-Waterman algorithm ...

  1. #1
    Registered User
    Join Date
    Nov 2008
    Posts
    3

    Smith-Waterman algorithm

    Thank you guys. I really appreciate it.
    I have also been looking for how to implement this algorithm:The Smith-Waterman algorithm is a well-known algorithm for performing local sequence alignment; that is, for determining similar regions between two nucleotide or protein sequences. Instead of looking at the total sequence, the Smith-Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure.
    I want to search a FASTA format file in a data base. Any reference will be good. I know the biology, i just cant put it in c++!!

  2. #2
    Cat without Hat CornedBee's Avatar
    Join Date
    Apr 2003
    Posts
    8,893
    Wikipedia is usually the first stop. It probably won't give you enough information to implement an algorithm this complex, but its references might be informative.
    All the buzzt!
    CornedBee

    "There is not now, nor has there ever been, nor will there ever be, any programming language in which it is the least bit difficult to write bad code."
    - Flon's Law

  3. #3
    Registered User
    Join Date
    Nov 2008
    Posts
    3
    Quote Originally Posted by CornedBee View Post
    Wikipedia is usually the first stop. It probably won't give you enough information to implement an algorithm this complex, but its references might be informative.
    Any one knows any good place I can learn about this code?

  4. #4
    and the hat of wrongness Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    32,452
    By "good" you mean "with C++ code examples" right?
    If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
    If at first you don't succeed, try writing your phone number on the exam paper.
    I support http://www.ukip.org/ as the first necessary step to a free Europe.

  5. #5
    Registered User
    Join Date
    Nov 2008
    Posts
    3
    Quote Originally Posted by Salem View Post
    By "good" you mean "with C++ code examples" right?
    Exactly!!!!!!!!!!! Thats what I mean. Please advise!

  6. #6
    and the hat of wrongness Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    32,452
    Did you add "source code" to your search terms?
    http://clusty.com/search?query=Smith...Mozilla-search
    If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
    If at first you don't succeed, try writing your phone number on the exam paper.
    I support http://www.ukip.org/ as the first necessary step to a free Europe.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Implement of a Fast Time Series Evaluation Algorithm
    By BiGreat in forum C Programming
    Replies: 7
    Last Post: 12-04-2007, 01:30 AM
  2. Replies: 4
    Last Post: 12-10-2006, 06:08 PM
  3. Binary Search Trees Part III
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  4. Request for comments
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 15
    Last Post: 01-02-2004, 09:33 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21