The statistical significance of max-gap clusters
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Exemplar Longest Common Subsequence
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Comparing Genomes with Duplications: A Computational Complexity Point of View
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
On the approximability of comparing genomes with duplicates
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
How pseudo-boolean programming can help genome rearrangement distance computation
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Genomes containing duplicates are hard to compare
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Inapproximability of (1,2)-exemplar distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Inapproximability of (1,2)-Exemplar Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
Gene cluster significance tests that are based on the number of genes in a cluster in two genomes, and how compactly they are distributed, but not their order, may be made more powerful by the addition of a test component that focuses solely on the similarity of the ordering of the common genes in the clusters in the two genomes. Here we suggest four such tests, compare them, and investigate one of them, the maximum adjacency disruption criterion, in some detail, analytically and through simulation.