Changeset 3192
- Timestamp:
- Apr 22, 2014, 7:25:02 AM (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/yat/utility/Alignment.h
r2815 r3192 69 69 algorithm. 70 70 71 The original paper can be found here:72 http://gel.ym.edu.tw/~chc/AB_papers/03.pdf73 74 71 Instead of looking at each sequence in its entirety the S-W algorithm 75 72 compares segment of all possible lengths (LOCAL alignment) and chooses … … 96 93 /** 97 94 SSearch does a rigorous Smith-Waterman search for similarity between 98 sequ nces. For long sequences this may be very expensive (both in time and95 sequences. For long sequences this may be very expensive (both in time and 99 96 space) and BLAST or FASTA is preferable. 100 97
Note: See TracChangeset
for help on using the changeset viewer.