A large version of the small parsimony problem
Given a multiple alignment over k sequences, an evolutionary tree relating the sequences, and a subadditive gap penalty function (e.g. an affine function), we reconstruct the internal nodes of the tree optimally we find the optimal explanation in terms of indels of the observed gaps and find the mos...
Main Authors: | , , |
---|---|
Format: | Conference item |
Published: |
2003
|