Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
An algorithm to enumerate all sorting reversals
Proceedings of the sixth annual international conference on Computational biology
Algorithmic approaches for genome rearrangement: a review
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
On the Complexity of Finite Sequences
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The paper considers computing aspects of constructing phylogenetic trees from unique data of polytene chromosome banding sequences. The possibilities of exactly and approximately calculating the inversion distances are studied. The trees of phylogenetic links among 65 species of the genus Chironomus (nonbiting midges) are constructed and analyzed.