{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:31:04Z","timestamp":1742401864403},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343813"},{"type":"electronic","value":"9783540343820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758525_106","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T11:03:32Z","timestamp":1147345412000},"page":"791-798","source":"Crossref","is-referenced-by-count":1,"title":["Rearrangement of Noisy Genomes"],"prefix":"10.1007","author":[{"given":"Chunfang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"106_CR1","first-page":"193","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. JCCS\u00a058, 193\u2013210 (1999)","journal-title":"JCCS"},{"key":"106_CR2","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: RECOMB 1997, pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"106_CR3","first-page":"178","volume":"27","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). STOC\u00a027, 178\u2013189 (1995)","journal-title":"STOC"},{"key":"106_CR4","first-page":"304","volume":"7","author":"S. Hannenhalli","year":"1996","unstructured":"Hannenhalli, S., Pevzner, P.A.: To cut or not to cut (applications of comparative physical maps in molecular evolution). SODA\u00a07, 304\u2013313 (1996)","journal-title":"SODA"},{"key":"106_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0029799","volume-title":"Combinatorial Pattern Matching","author":"J. Kececioglu","year":"1993","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two permutations. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 87\u2013105. Springer, Heidelberg (1993)"},{"key":"106_CR6","unstructured":"Kumlander, D.: A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. Fourth European Congress of Mathematics. Poster and manuscript (2005)"},{"key":"106_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11554714_12","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Lenert, A., Zheng, C.: Reversals of fortune. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 131\u2013141. Springer, Heidelberg (2005)"},{"key":"106_CR8","first-page":"587","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. JCSS\u00a065, 587\u2013609 (2002)","journal-title":"JCSS"},{"key":"106_CR9","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"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758525_106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:01:18Z","timestamp":1553353278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758525_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343813","9783540343820"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11758525_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}