Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
Efficient algorithms for multichromosomal genome rearrangements
Journal of Computer and System Sciences - Computational biology 2002
The Median Problem for Breakpoints in Comparative Genomics
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
The Reconstruction of Doubled Genomes
SIAM Journal on Computing
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On Some Tighter Inapproximability Results, Further Improvements
On Some Tighter Inapproximability Results, Further Improvements
INFORMS Journal on Computing
Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Colored de Bruijn Graphs and the Genome Halving Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Genome rearrangements: a correct algorithm for optimal capping
Information Processing Letters
Bioinformatics
Genome Halving under DCJ Revisited
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Reactive stochastic local search algorithms for the genomic median problem
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
A unifying view of genome rearrangements
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
A Fast and Exact Algorithm for the Median of Three Problem--A Graph Decomposition Approach
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
On sorting genomes with DCJ and indels
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
On exploring genome rearrangement phylogenetic patterns
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Genome median and halving problems aim at reconstructing ancestral genomes and the evolutionary events leading from the ancestor to extant species. The NP-hardness of the breakpoint distance and reversal distance median problems for unichromosomal genomes do not easily imply the same for the multichromosomal case. Here we find the complexity of several genome median and halving problems, including a surprising polynomial result for the breakpoint median and guided halving problems in genomes with circular and linear chromosomes; the multichromosomal problem is thus easier than the unichromosomal one.