{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:18Z","timestamp":1740099138559,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008338"},{"type":"electronic","value":"9783030008345"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00834-5_3","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T23:53:16Z","timestamp":1536277996000},"page":"49-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A General Framework for Genome Rearrangement with Biological Constraints"],"prefix":"10.1007","author":[{"given":"Pijus","family":"Simonaitis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krister M.","family":"Swenson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"issue":"19","key":"3_CR2","doi-asserted-by":"publisher","first-page":"S3","DOI":"10.1186\/1471-2105-16-S19-S3","volume":"16","author":"C Baudet","year":"2015","unstructured":"Baudet, C., Dias, U., Dias, Z.: Sorting by weighted inversions considering length and symmetry. BMC Bioinform. 16(19), S3 (2015)","journal-title":"BMC Bioinform."},{"issue":"15","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1093\/bioinformatics\/btq301","volume":"26","author":"C Baudet","year":"2010","unstructured":"Baudet, C., Lemaitre, C., Dias, Z., Gautier, C., Tannier, E., Sagot, M.-F.: Cassis: detection of genomic rearrangement breakpoints. Bioinformatics 26(15), 1897\u20131898 (2010)","journal-title":"Bioinformatics"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11851561_16","volume-title":"Algorithms in Bioinformatics","author":"A Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS, vol. 4175, pp. 163\u2013173. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11851561_16"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bhuiyan, H., Chen, J., Khan, M., Marathe, M.: Fast parallel algorithms for edge-switching to achieve a target visit rate in heterogeneous graphs. In: 43rd International Conference on Parallel Processing (ICPP), pp. 60\u201369. IEEE (2014)","DOI":"10.1109\/ICPP.2014.15"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230240402","volume":"24","author":"D Bienstock","year":"1994","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: A degree sequence problem related to network design. Networks 24(4), 195\u2013205 (1994)","journal-title":"Networks"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1093\/gbe\/evw083","volume":"8","author":"P Biller","year":"2016","unstructured":"Biller, P., Knibbe, C., Gu\u00e9guen, L., Tannier, E.: Breaking good: accounting for the diversity of fragile regions for estimating rearrangement distances. Genome Biol. Evol. 8, 1427\u201339 (2016)","journal-title":"Genome Biol. Evol."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/0211019","volume":"11","author":"JR Bitner","year":"1982","unstructured":"Bitner, J.R.: An asymptotically optimal algorithm for the dutch national flag problem. SIAM J. Comput. 11(2), 243\u2013262 (1982)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0378-1119(95)00878-0","volume":"172","author":"M Blanchette","year":"1996","unstructured":"Blanchette, M., Kunisawa, T., Sankoff, D.: Parametric genome rearrangement. Gene 172(1), 11\u201317 (1996)","journal-title":"Gene"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-72031-7_27","volume-title":"Bioinformatics Research and Applications","author":"MDV Braga","year":"2007","unstructured":"Braga, M.D.V., Sagot, M.-F., Scornavacca, C., Tannier, E.: The solution space of sorting by reversals. In: M\u0103ndoiu, I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS, vol. 4463, pp. 293\u2013304. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72031-7_27"},{"issue":"9","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"MDV Braga","year":"2010","unstructured":"Braga, M.D.V., Stoye, J.: The solution space of sorting by DCJ. J. Comput. Biol. 17(9), 1145\u20131165 (2010)","journal-title":"J. Comput. Biol."},{"issue":"14","key":"3_CR12","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1186\/s12859-016-1264-6","volume":"17","author":"L Bulteau","year":"2016","unstructured":"Bulteau, L., Fertin, G., Tannier, E.: Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 17(14), 426 (2016)","journal-title":"BMC Bioinform."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In Proceedings of the First Annual International Conference on Computational Molecular Biology, pp. 75\u201383. ACM (1997)","DOI":"10.1145\/267521.267531"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIT.2011.2171532","volume":"58","author":"F Farnoud","year":"2012","unstructured":"Farnoud, F., Milenkovic, O.: Sorting of permutations by cost-constrained transpositions. IEEE Trans. Inf. Theory 58(1), 3\u201323 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s13015-017-0107-y","volume":"12","author":"G Fertin","year":"2017","unstructured":"Fertin, G., Jean, G., Tannier, E.: Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms Mol. Biol. 12(1), 16 (2017)","journal-title":"Algorithms Mol. Biol."},{"issue":"5950","key":"3_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1126\/science.1181369","volume":"326","author":"E Lieberman-Aiden","year":"2009","unstructured":"Lieberman-Aiden, E., Van Berkum, N.L., Williams, L., Imakaev, M., Ragoczy, T., Telling, A., Amit, I., Lajoie, B.R., Sabo, P.J., Dorschner, M.O., et al.: Comprehensive mapping of long-range interactions reveals folding principles of the human genome. science 326(5950), 289\u2013293 (2009)","journal-title":"science"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"JH Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. 81(3), 814\u2013818 (1984)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-86659-3","volume-title":"Evolution by Gene Duplication","author":"S Ohno","year":"1970","unstructured":"Ohno, S.: Evolution by Gene Duplication. Springer, Heidelberg (1970)"},{"key":"3_CR19","series-title":"LNCS","first-page":"141","volume-title":"Comparative Genomics. RECOMB-CG 2017","author":"S Pulicani","year":"2017","unstructured":"Pulicani, S., Simonaitis, P., Rivals, E., Swenson, K.M.: Rearrangement scenarios guided by chromatin structure. In: Meidanis, J., Nakhleh, L. (eds.) Comparative Genomics. RECOMB-CG 2017. LNCS, vol. 10562, pp. 141\u2013155. Springer, Cham (2017)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Shao, M., Lin, Y.: Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. In: BMC bioinformatics, vol. 13, p. S13. BioMed Central (2012)","DOI":"10.1186\/1471-2105-13-S19-S13"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Shao, M., Lin, Y., Moret, B.M.E.: Sorting genomes with rearrangements and segmental duplications through trajectory graphs. In: BMC bioinformatics, vol. 14, p. S9. BioMed Central (2013)","DOI":"10.1186\/1471-2105-14-S15-S9"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/s13015-018-0127-2","volume":"13","author":"P Simonaitis","year":"2018","unstructured":"Simonaitis, P., Swenson, K.M.: Finding local genome rearrangements. Algorithms Mol. Biol. 13(1), 9 (2018)","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/s13015-016-0065-9","volume":"11","author":"KM Swenson","year":"2016","unstructured":"Swenson, K.M., Simonaitis, P., Blanchette, M.: Models and algorithms for genome rearrangement with positional constraints. Algorithms Mol. Biol. 11(1), 13 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1186\/1471-2164-12-303","volume":"12","author":"A Veron","year":"2011","unstructured":"Veron, A., Lemaitre, C., Gautier, C., Lacroix, V., Sagot, M.-F.: Close 3D proximity of evolutionary breakpoints argues for the notion of spatial synteny. BMC Genomics 12(1), 303 (2011)","journal-title":"BMC Genomics"},{"issue":"16","key":"3_CR25","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00834-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T17:39:49Z","timestamp":1571852389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00834-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008338","9783030008345"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00834-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}