A Fast Approximation Algorithm for the k Partition-Distance Problem
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
A graph and hierarchical clustering based approach for population structure inference
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
An efficient algorithm for computing the distance between close partitions
Discrete Applied Mathematics
| Hi-index | 3.84 |
Motivation: Accuracy testing of various pedigree reconstruction methods requires an efficient algorithm for the calculation of distance between a known partition and its reconstruction. The currently used algorithm of Almudevar and Field takes a prohibitively long time for certain partitions and population sizes. Results: We present an algorithm that very efficiently reduces the partition-distance calculation to the classic assignment problem of weighted bipartite graphs that has known polynomial-time solutions. The performance of the algorithm is tested against the Almudevar and Field partition-distance algorithm to verify the significant improvement in speed. Availability: Computer code written in java is available upon request from the first author. Contact: dmitry.konovalov@jcu.edu.au