Đang chuẩn bị liên kết để tải về tài liệu:
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve instances with reticulation number larger than 40-50. |