A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Heuristic Algorithms for the Protein Model Assignment Problem
[chapter]
2013
Lecture Notes in Computer Science
Assigning an optimal combination of empirical amino acid substitution models (e.g., WAG, LG, MTART) to partitioned multi-gene datasets when branch lengths across partitions are linked, is suspected to be an NP-hard problem. Given p partitions and the approximately 20 empirical protein models that are available, one needs to compute the log likelihood score of 20 p possible model-to-partition assignments for obtaining the optimal assignment. Initially, we show that protein model assignment (PMA)
doi:10.1007/978-3-642-38036-5_16
fatcat:zmwtmgtcn5gzdanwll3zaelida