Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference16 articles.
1. V. Berry, S. Guillemot, F. Nicolas, C. Paul, On the approximation of computing of evolutionary trees, Technical report, Département Informatique, LIRMM–CNRS, 2005
2. An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees;Cole;SIAM J. Comput.,2000
3. A. Dessmark, J. Jansson, A. Lingas, E.M. Lundell, Polynomial-time algorithms for the ordered maximum agreement subtree problem, in: 15th Annual Symposium on Combinatorial Pattern Matching, 2004, pp. 220–229
4. M. Farach, M. Throup, Optimal evolutionary tree comparison by sparse dynamic programming, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 770–779
5. M. Farach, M. Throup, Fast comparison of evolutionary trees, in: Proceedings of the 5th Annual ACM–SIAM Symposium on Discrete Algorithms, 1995, pp. 481–488