Ignore:
Timestamp:
Sep 18, 2007, 3:14:38 AM (16 years ago)
Author:
Peter
Message:

fixing some docs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/yat/utility/Alignment.h

    r869 r873  
    7272     whichever maximises the similarity measure.
    7373
    74      \param s score matrix in which element $(i,j)$ is the score between
    75      element $i$ in first sequence vs element $j$ in second sequence.
     74     \param s score matrix in which element \f$(i,j)\f$ is the score between
     75     element \f$i\f$ in first sequence vs element \f$j\f$ in second sequence.
    7676     \param gap cost for having a gap (insertion or deletion)
    7777     \param open_gap cost for open up a gap in sequence, in other words, for a
    78      gap of length $l$ the total cost is $open_gap + l*gap$.
     78     gap of length \f$l\f$ the total cost is \f$open_gap + l*gap\f$.
    7979   */
    8080  double SmithWaterman(const utility::matrix& s,
Note: See TracChangeset for help on using the changeset viewer.