We prove that the average complexity of the pairwise ordered tree alignment algorithm of Jiang, Wang and Zhang is in O(nm), where n and m stand for the sizes of the two trees, respectively. We show that the same result holds for the average complexity of pairwise comparison of RNA secondary structures, using a set of biologically relevant operations.

There are many priority deriving methods for pairwise comparison matrices. It is known that when these matrices consistent all result in the same vector. However, they inconsistent, results may vary. The presented work formulates an estimation of difference between vectors two most popular ranking methods: eigenvalue method and geometric mean method. provided refers to inconsistency matrix. The...