A. H. Sturtevant, The linear arrangement of six sex-linked factors in Drosophila, as shown by their mode of association, Journal of Experimental Zoology, vol.14, pp.43-59, 1913.

K. C. Cone and E. H. Coe, Genetic Mapping and Maps, pp.507-522, 2009.

F. Brandenburg, A. Gleißner, and A. Hofmeier, The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders, J Comb Optim, vol.26, issue.2, pp.310-332, 2013.

J. B. Endelman, New algorithm improves fine structure of the barley consensus SNP map, BMC Genomics, vol.12, issue.1, p.407, 2011.

J. B. Endelman and C. Plomion, LPmerge: an R package for merging genetic maps by linear programming, Bioinformatics, vol.30, issue.11, pp.1623-1624, 2014.

H. Tang, X. Zhang, C. Miao, J. Zhang, R. Ming et al., ALLMAPS: robust scaffold ordering based on multiple maps, Genome Biology, vol.16, issue.1, p.25583564, 2015.

S. Jachner, K. G. Van-den-boogaart, and T. Petzoldt, Statistical Methods for the Qualitative Assessment of Dynamic Models with Time Delay (R Package qualV), Journal of Statistical Software, vol.22, issue.8, pp.1-30, 2007.

G. Li, D. Serba, M. C. Saha, J. Bouton, C. L. Lanzatella et al., Genetic Linkage Mapping and Transmission Ratio Distortion in a Three-Generation Four-Founder Population of Panicum virgatum, L.), vol.4, pp.5-913, 2014.

J. Fiedler, C. Lanzatella, M. Okada, J. Jenkins, J. Schmutz et al., High-Density Single Nucleotide Polymorphism Linkage Maps of Lowland Switchgrass using Genotyping-by-Sequencing, vol.8, 2015.

Y. Wang, H. Tang, J. D. Debarry, X. Tan, J. Li et al., MCScanX: A toolkit for detection and evolutionary analysis of gene synteny and collinearity, vol.40, p.49, 2012.

Y. Xu, C. Bi, G. , S. Dai, X. Yin et al., VGSC: A Web-Based Vector Graph Toolkit of, Genome Synteny and Collinearity, p.8, 2016.

Y. Holtz, J. David, and V. Ranwez, The genetic map comparator: a user-friendly application to display and compare genetic maps, Bioinformatics, vol.33, issue.9, pp.1387-1388, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01604150

M. Silfverberg, L. Liu, and M. Hulden, A Computational Model for the Linguistic Notion of Morphological Paradigm, In: COLING, pp.1615-1626, 2018.

R. Beal, T. Afrin, A. Farheen, and D. Adjeroh, A new algorithm for "the LCS problem" with application in compressing genome resequencing data, 2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp.69-74, 2015.

J. W. Hunt and T. G. Szymanski, A Fast Algorithm for Computing Longest Subsequences, Commun ACM, vol.20, issue.5, pp.350-353, 1977.

W. J. Masek and M. Paterson, A Faster Algorithm Computing String Edit Distances, J Comput Syst Sci, vol.20, issue.1, pp.90002-90003, 1980.

A. Apostolico, Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings, Inf Process Lett, vol.23, issue.2, p.90044, 1986.

D. Maier, The Complexity of Some Problems on Subsequences and Supersequences, J ACM, vol.25, issue.2, pp.322-336, 1978.

A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White et al., Alignment of whole genomes, Nucleic Acids Research, vol.27, issue.11, p.2369, 1999.

S. Vialette, P. Bonizzoni, R. Dondi, D. Vedova, G. Fertin et al., Exemplar Longest Common Subsequence, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, pp.535-543, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00417728

R. Beal, T. Afrin, A. Farheen, and D. Adjeroh, A new algorithm for "the LCS problem" with application in compressing genome resequencing data, BMC Genomics, vol.17, issue.4, p.27556803, 2016.

M. Habib, C. Paul, and L. Viennot, Partition Refinement Techniques: An Interesting Algorithmic Tool Kit, Int J Found Comput Sci, vol.10, issue.2, pp.147-170, 1999.

R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee, Comparing Partial Rankings, SIAM J Discrete Math, vol.20, issue.3, pp.628-648, 2006.

W. Wen, Z. He, F. Gao, J. Liu, H. Jin et al., A High-Density Consensus Map of Common Wheat Integrating Four Mapping Populations Scanned by the 90K SNP Array, Front Plant Sci, vol.8, p.1389, 2017.

J. Holub and W. F. Smyth, Algorithms on indeterminate strings, pp.36-45, 2003.

J. W. Daykin and B. Watson, Indeterminate String Factorizations and Degenerate Text Transformations, Mathematics in Computer Science, vol.11, issue.2, pp.209-218, 2017.

E. W. Dijkstra, Smoothsort, an Alternative for Sorting In Situ, Sci Comput Program, vol.1, issue.3, pp.223-233, 1982.

M. S. Bansal and D. Ferná-ndez-baca, Computing distances between partial rankings, Inf Process Lett, vol.109, issue.4, pp.238-241, 2009.

F. J. Brandenburg and A. Gleißner, Ranking chain sum orders, Theor Comput Sci, vol.636, pp.66-76, 2016.

R. A. Wagner and M. J. Fischer, The String-to-String Correction Problem, J ACM, vol.21, issue.1, pp.168-173, 1974.

G. Jacobson and K. Vo, Heaviest Increasing/Common Subsequence Problems, Combinatorial Pattern Matching, Third Annual Symposium, pp.52-66, 1992.

Y. Holtz, M. Ardisson, V. Ranwez, A. Besnard, P. Leroy et al., Genotyping by Sequencing Using Specific Allelic Capture to Build a High-Density Genetic Map of Durum Wheat, Plos One, vol.11, issue.5, 2016.

L. Bulteau, G. Fertin, and I. Rusu, Revisiting the Minimum Breakpoint Linearization Problem, Theor Comput Sci, vol.494, pp.122-133, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00482856

Y. Wu, T. J. Close, and S. Lonardi, Accurate Construction of Consensus Genetic Maps via Integer Linear Programming, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.2, pp.381-394, 2011.