|P is for Practical|
Maximal Parsimony Problemby neversaint (Deacon)
|on Sep 03, 2008 at 13:54 UTC||Need Help??|
neversaint has asked for the wisdom of the Perl Monks concerning the following question:
Given a set of align sequences I want to compute the minimum number of substitution for each column. The example is below:
Is there a way to compute the value above? My current code does not do the job:
Actually I want to mimic Fitch's classical parsimony algorithm. But cannot fathom how to implement it.
Update:Problem resolved. Thanks everybody. psini+++.
neversaint and everlastingly indebted.......