{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:07:57Z","timestamp":1725898077210},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382550"},{"type":"electronic","value":"9783642382567"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38256-7_11","type":"book-chapter","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T03:22:23Z","timestamp":1368501743000},"page":"162-174","source":"Crossref","is-referenced-by-count":0,"title":["Single Tandem Halving by Block Interchange"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Thomas","sequence":"first","affiliation":[]},{"given":"A\u00efda","family":"Ouangraoua","sequence":"additional","affiliation":[]},{"given":"Jean-St\u00e9phane","family":"Varr\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Thomas, A., Ouangraoua, A., Varr\u00e9, J.S.: Genome halving by block interchange. In: BIOINFORMATICS 2012, Third International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Portugal, February 1-4 (2012)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett.\u00a060, 165\u2013169 (1996)","journal-title":"Inf. Process. Lett."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1089\/cmb.2005.12.102","volume":"12","author":"Y.C. Lin","year":"2005","unstructured":"Lin, Y.C., Lu, C.L., Chang, H.Y., Tang, C.Y.: An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. Journal of Computational Biology\u00a012, 102\u2013112 (2005)","journal-title":"Journal of Computational Biology"},{"key":"11_CR4","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\u00a021, 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BFb0030793","volume-title":"Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"1998","unstructured":"El-Mabrouk, N., Nadeau, J.H., Sankoff, D.: Genome Halving. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 235\u2013250. Springer, Heidelberg (1998)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1137\/S0097539700377177","volume":"32","author":"N. El-Mabrouk","year":"2003","unstructured":"El-Mabrouk, N., Sankoff, D.: The reconstruction of doubled genomes. SIAM J. Comput.\u00a032, 754\u2013792 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87361-7_1","volume-title":"Algorithms in Bioinformatics","author":"E. Tannier","year":"2008","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal Genome Median and Halving Problems. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 1\u201313. Springer, Heidelberg (2008)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Warren, R., Sankoff, D.: Genome halving with double cut and join. In: Brazma, A., Miyano, S., Akutsu, T. (eds.) Proceedings of APBC 2008. Advances in Bioinformatics and Computational Biology, vol.\u00a06, pp. 231\u2013240. Imperial College Press (2008)","DOI":"10.1142\/9781848161092_0025"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-69733-6_28","volume-title":"Computing and Combinatorics","author":"J. Mixtacki","year":"2008","unstructured":"Mixtacki, J.: Genome Halving under DCJ Revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 276\u2013286. Springer, Heidelberg (2008)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-16181-0_2","volume-title":"Comparative Genomics","author":"J. Kov\u00e1\u010d","year":"2010","unstructured":"Kov\u00e1\u010d, J., Braga, M.D.V., Stoye, J.: The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol.\u00a06398, pp. 13\u201324. Springer, Heidelberg (2010)"}],"container-title":["Communications in Computer and Information Science","Biomedical Engineering Systems and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38256-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:14:41Z","timestamp":1557695681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38256-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382550","9783642382567"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38256-7_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}