Advertisement

A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem

  • Gang Wu
  • Jia-Huai You
  • Guohui Lin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3692)

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.

Keywords

Dynamic Programming Search Tree Real Dataset Exact Algorithm Constraint Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bandelt, H., Dress, A.: Advance in Applied Mathematics 7, 309–343 (1986)Google Scholar
  2. 2.
    Ben-Dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: In: Proceedings of RECOMB 1998, pp. 9–19 (1998)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Colonius, H., Schultze, H.H.: British Journal of Mathematical and Statistical Psychology 34, 167–180 (1981)Google Scholar
  6. 6.
    Della Vedova, G., Wareham, H.T.: Bioinformatics 18, 1297–1304 (2002)Google Scholar
  7. 7.
    Erdos, P., Steel, M., Szekely, L., Warnow, T.: Random Structures and Algorithms 14, 153–184 (1999)Google Scholar
  8. 8.
    Erdos, P.L., Steel, M.A., Szekely, L.A., Warnow, T.J.: Computers and Artificial Intelligence 16, 217–227 (1997)Google Scholar
  9. 9.
    Gramm, J., Niedermeier, R.: Journal of Computer and System Science 67, 723–741 (2003)Google Scholar
  10. 10.
    Jiang, T., Kearney, P.E., Li, M.: In: Proceedings of FOCS 1998, pp. 416–425 (1998)Google Scholar
  11. 11.
    Jiang, T., Kearney, P.E., Li, M.: Journal of Algorithms 34, 194–201 (2000)Google Scholar
  12. 12.
    Jiang, T., Kearney, P.E., Li, M.: SIAM Journal on Computing 30, 1942–1961 (2001)Google Scholar
  13. 13.
    Saitou, N., Nei, M.: Molecular Biology and Evolution 4, 406–425 (1987)Google Scholar
  14. 14.
    Steel, M.: Journal on Classification 9, 91–116 (1992)Google Scholar
  15. 15.
    Wu, G., Lin, G.-H., You, J.: In: Proceedings of ICTAI 2004, pp. 612–619 (2004)Google Scholar
  16. 16.
    Wu, G., You, J., Lin, G.-H.: Technical Report TR05-05, Department of Computing Science, University of Alberta (January 2005)Google Scholar
  17. 17.
    Wu, X., Wan, X., Wu, G., Xu, D., Lin, G.-H.: Technical Report TR05-06, Department of Computing Science, University of Alberta (January 2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Gang Wu
    • 1
  • Jia-Huai You
    • 1
  • Guohui Lin
    • 1
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmonton, AlbertaCanada

Personalised recommendations