Complexity decompositions in the problem of comparison of polytene chromosome banding sequences

摘要

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.