The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Algorithms to speed up tree searches under Sankoff parsimony are described. ForTterminal taxa, an exact algorithm allows calculating length during searchesTto 2Ttimes faster than a complete down-pass optimization. An approximate but accurate method is from 3Tto 8Ttimes faster than a down-pass. Other algorithms that provide additional increases of speed for simple symmetrical transformation costs are described.