COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Finding All Common Intervals of k Permutations
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Perfect Sorting by Reversals Is Not Always Difficult
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Computing common intervals of K permutations, with applications to modular decomposition of graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Using PQ trees for comparative genomics
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Conservation of combinatorial structures in evolution scenarios
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
| Hi-index | 0.00 |
Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definition: ancestral species are not bound to perfection. Here we develop a new theory of perfection that takes an egalitarian view of species, and apply it to the complex evolution of mammal chromosome X.