Parametric genome rearrangement, Gene, vol.172, issue.1, pp.11-18, 1996. ,
Sorting by weighted inversions considering length and symmetry, BMC Bioinform, vol.16, p.3, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01316998
Breaking good: accounting for the diversity of fragile regions for estimating rearrangement distances ,
, Genome Biol Evol, vol.8, pp.1427-1466, 2016.
Lengths of chromosomal segments conserved since divergence of man and mouse, Proc Natl Acad Sci, vol.81, issue.3, pp.814-822, 1984. ,
Evolution by gene duplication, p.160, 1970. ,
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes, Algorithms Mol Biol, vol.12, issue.1, p.16, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01533200
Genome rearrangements with indels in intergenes restrict the scenario space, BMC Bioinform, vol.17, issue.14, p.426, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01396842
Comprehensive mapping of long-range interactions reveals folding principles of the human genome, Science, vol.326, issue.5950, pp.289-93, 2009. ,
):303. cost(i, j) = max(cost(i, s) + cost(s + 1, q) + cost(q, j) + ?(i, q)| i ? s < q ? j), BMC Genomics, vol.12, issue.1, 2011. ,
Rearrangement scenarios guided by chromatin structure, RECOMB international workshop on comparative genomics, pp.141-55, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01791974
Models and algorithms for genome rearrangement with positional constraints, Algorithms Mol Biol, vol.11, issue.1, p.13, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01348502
Finding local genome rearrangements, Algorithms Mol Biol, vol.13, issue.1, p.9, 2018. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01794757
Efficient sorting of genomic permutations by translocation, inversion and block interchange, Bioinformatics, vol.21, issue.16, pp.3340-3346, 2005. ,
A unifying view of genome rearrangements, International workshop on algorithms in bioinformatics, pp.163-73, 2006. ,
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion, BMC Bioinform, vol.13, p.13, 2012. ,
Configuring random graph models with fixed degree sequences, SIAM Rev, vol.60, issue.2, pp.315-55, 2018. ,
Genome rearrangements and sorting by reversals, SIAM J Comput, vol.25, issue.2, pp.272-89, 1996. ,
String rearrangement metrics: a survey. Algorithms and applications, pp.1-33, 2010. ,
Sorting of permutations by cost-constrained transpositions, IEEE Trans Inf Theory, vol.58, issue.1, pp.3-23, 2012. ,
A degree sequence problem related to network design, Networks, vol.24, issue.4, pp.195-205, 1994. ,
A local switch markov chain on given degree graphs with application in connectivity of peer-to-peer networks, FOCS'06. 47th annual IEEE symposium on foundations of computer science, pp.69-76, 2006. ,
Sorting by reversals is difficult, Proceedings of the first annual international conference on computational molecular biology, pp.75-83, 1997. ,
Bioinformatics research and applications: proceedings from ISBRA. The solution space of sorting by reversals, 2007. ,
An asymptotically optimal algorithm for the dutch national flag problem, SIAM J Comput, vol.11, issue.2, pp.243-62, 1982. ,
Sorting genomes with rearrangements and segmental duplications through trajectory graphs, BMC Bioinform, vol.14, p.9, 2013. ,
Optimal listing of cycles and st-paths in undirected graphs, Proceedings of the twenty-fourth annual ACM-SIAM symposium on discrete algorithms, pp.1884-96, 2013. ,
Packing cycles and cuts in undirected graphs, European symposium on algorithms, pp.512-535, 2001. ,
Orthocluster: a new tool for mining synteny blocks and applications in comparative genomics, Proceedings of the 11th international conference on extending database technology: advances in database technology, pp.656-67, 2008. ,
Estimation of the true evolutionary distance under the fragile breakage model, BMC Genomics, vol.18, issue.4, p.356, 2017. ,
, Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations