Changeset 867 for trunk/yat/utility
- Timestamp:
- Sep 13, 2007, 9:36:50 PM (15 years ago)
- Location:
- trunk/yat/utility
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/yat/utility/Alignment.cc
r865 r867 33 33 namespace yat { 34 34 namespace utility { 35 36 unsigned int ssearch(std::string first, std::string second) 37 { 38 matrix m(first.size(), second.size()); 39 for (size_t i=0; i<first.size(); ++i) 40 for (size_t j=0; j<second.size(); ++j) 41 m(i,j) = (first[i]==second[j] ? 1 : 0); 42 std::vector<std::pair<size_t, size_t> > path; 43 return static_cast<unsigned int>(NeedlemanWunsch(m,path,0)); 44 } 45 35 46 36 47 double NeedlemanWunsch(const utility::matrix& s, -
trunk/yat/utility/Alignment.h
r865 r867 60 60 const double gap); 61 61 62 /** 63 SSearch does a rigorous Smith-Waterman (Needleman-Wunsch with no gap 64 cost) search for similarity between a sequnces. For long sequences this 65 may be very expensive (both in time and space) and BLAST or FASTA is 66 preferable. 67 68 @return number of matches 69 */ 70 unsigned int ssearch(std::string first, std::string second); 71 62 72 }}} // of namespace utility, yat, and theplu 63 73
Note: See TracChangeset
for help on using the changeset viewer.