SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Theoretical Computer Science - Special issue: Genome informatics
Signed genome rearrangement by reversals and transpositions: models and approximations
Theoretical Computer Science
On computing Hilbert bases via the Elliot-MacMahon algorithm
Theoretical Computer Science
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
Efficient algorithms for multichromosomal genome rearrangements
Journal of Computer and System Sciences - Computational biology 2002
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Reversals and Transpositions Over Finite Alphabets
SIAM Journal on Discrete Mathematics
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Whole genome duplications, multi-break rearrangements, and genome halving problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Working on the problem of sorting by transpositions on genome rearrangements
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
A 1.375-approximation algorithm for sorting by transpositions
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Sorting by weighted reversals, transpositions, and inverted transpositions
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Reactive stochastic local search algorithms for the genomic median problem
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Limited lifespan of fragile regions in mammalian evolution
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Weighted genomic distance can hardly impose a bound on the proportion of transpositions
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 5.23 |
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While multi-break rearrangements were studied in depth for k=2 breaks, the k-break distance problem for arbitrary k remains unsolved. We prove a duality theorem for multi-break distance problem and give a polynomial algorithm for computing this distance.