Theory of linear and integer programming
Theory of linear and integer programming
Comparing Genomes with Duplications: A Computational Complexity Point of View
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the similarity of sets of permutations and its applications to genome comparison
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On the approximability of comparing genomes with duplicates
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
| Hi-index | 0.00 |
Comparing bacterial genomes implies the use of a dedicated measure. It relies on comparing circular genomes based on a set of conserved genes. Following this assumption, the common interval appears to be a good candidate. For evidences, we propose herein an approach to compute the common intervals between two circular genomes that takes into account duplications. Its application on a concrete case, comparing E. coli and V. cholerae, is accurate. It indeed emphasizes sets of conserved genes that present high impacts on bacterial functions.