Abstract
A lookahead branch-and-bound algorithm (LBnB) is proposed for solving the Maximum Quartet Consistency (MQC) Problem where the input is a complete set of quartets on the taxa and the goal is to construct a phylogeny that satisfies the maximum number of given quartets. It integrates a number of previous efforts on exact algorithms, heuristics, and approximation algorithms for the NP-hard MQC problem, and a few improved search techniques, especially a lookahead scheme, to solve the problem optimally. The theoretical running time analysis of the LBnB algorithm is provided, and an extensive simulation study has been well designed to compare the algorithm to previous existing exact algorithms and a best heuristic Hypercleaning. The experimental results on both synthetic and real datasets show that LBnB outperformed other exact algorithms, and it was competitive to Hypercleaning on many datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bandelt, H., Dress, A.: Advance in Applied Mathematics 7, 309–343 (1986)
Ben-Dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: In: Proceedings of RECOMB 1998, pp. 9–19 (1998)
Berry, V., Bryant, D., Jiang, T., Kearney, P., Li, M., Wareham, T., Zhang, H.: In: Proceedings of SODA 2000, San Francisco, California, January 9–11, pp. 287–296 (2000)
Berry, V., Jiang, T., Kearney, P.E., Li, M., Wareham, H.T.: In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 313–324. Springer, Heidelberg (1999)
Colonius, H., Schultze, H.H.: British Journal of Mathematical and Statistical Psychology 34, 167–180 (1981)
Della Vedova, G., Wareham, H.T.: Bioinformatics 18, 1297–1304 (2002)
Erdos, P., Steel, M., Szekely, L., Warnow, T.: Random Structures and Algorithms 14, 153–184 (1999)
Erdos, P.L., Steel, M.A., Szekely, L.A., Warnow, T.J.: Computers and Artificial Intelligence 16, 217–227 (1997)
Gramm, J., Niedermeier, R.: Journal of Computer and System Science 67, 723–741 (2003)
Jiang, T., Kearney, P.E., Li, M.: In: Proceedings of FOCS 1998, pp. 416–425 (1998)
Jiang, T., Kearney, P.E., Li, M.: Journal of Algorithms 34, 194–201 (2000)
Jiang, T., Kearney, P.E., Li, M.: SIAM Journal on Computing 30, 1942–1961 (2001)
Saitou, N., Nei, M.: Molecular Biology and Evolution 4, 406–425 (1987)
Steel, M.: Journal on Classification 9, 91–116 (1992)
Wu, G., Lin, G.-H., You, J.: In: Proceedings of ICTAI 2004, pp. 612–619 (2004)
Wu, G., You, J., Lin, G.-H.: Technical Report TR05-05, Department of Computing Science, University of Alberta (January 2005)
Wu, X., Wan, X., Wu, G., Xu, D., Lin, G.-H.: Technical Report TR05-06, Department of Computing Science, University of Alberta (January 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, G., You, JH., Lin, G. (2005). A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem. In: Casadio, R., Myers, G. (eds) Algorithms in Bioinformatics. WABI 2005. Lecture Notes in Computer Science(), vol 3692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557067_6
Download citation
DOI: https://doi.org/10.1007/11557067_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29008-7
Online ISBN: 978-3-540-31812-5
eBook Packages: Computer ScienceComputer Science (R0)