{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T07:40:06Z","timestamp":1746344406738,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447529"},{"type":"electronic","value":"9783662447536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44753-6_8","type":"book-chapter","created":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T12:08:34Z","timestamp":1408104514000},"page":"97-106","source":"Crossref","is-referenced-by-count":1,"title":["Linearization of Median Genomes under DCJ"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Max A.","family":"Alekseyev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01732471","volume":"7","author":"D. Sankoff","year":"1976","unstructured":"Sankoff, D., Cedergren, R.J., Lapalme, G.: Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA. Journal of Molecular Evolution\u00a07(2), 133\u2013149 (1976)","journal-title":"Journal of Molecular Evolution"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-23038-7_15","volume-title":"Algorithms in Bioinformatics","author":"J. Kov\u00e1\u010d","year":"2011","unstructured":"Kov\u00e1\u010d, J., Brejov\u00e1, B., Vina\u0159, T.: A practical algorithm for ancestral rearrangement reconstruction. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS, vol.\u00a06833, pp. 163\u2013174. Springer, Heidelberg (2011)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Gao, N., Yang, N., Tang, J.: Ancestral genome inference using a genetic algorithm approach. PLoS One\u00a08(5), e62156 (2013)","DOI":"10.1371\/journal.pone.0062156"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Moret, B.M., Wyman, S., Bader, D.A., Warnow, T., Yan, M.: A New Implementation and Detailed Study of Breakpoint Analysis. In: Pacific Symposium on Biocomputing, vol.\u00a06, pp. 583\u2013594 (2001)","DOI":"10.1142\/9789814447362_0056"},{"issue":"1","key":"8_CR5","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.A.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Research\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Research"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A. Caprara","year":"2003","unstructured":"Caprara, A.: The reversal median problem. INFORMS Journal on Computing\u00a015(1), 93\u2013113 (2003)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E. Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics\u00a010(1), 120 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"16","key":"8_CR8","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(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"issue":"2-3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2008.01.013","volume":"395","author":"M.A. Alekseyev","year":"2008","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Multi-Break Rearrangements and Chromosomal Evolution. Theoretical Computer Science\u00a0395(2-3), 193\u2013202 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1089\/cmb.2009.0087","volume":"16","author":"A.W. Xu","year":"2009","unstructured":"Xu, A.W.: A fast and exact algorithm for the median of three problem: A graph decomposition approach. Journal of Computational Biology\u00a016(10), 1369\u20131381 (2009)","journal-title":"Journal of Computational Biology"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-04744-2_7","volume-title":"Comparative Genomics","author":"A.W. Xu","year":"2009","unstructured":"Xu, A.W.: DCJ median problems on linear multichromosomal genomes: Graph representation and fast exact solutions. In: Ciccarelli, F.D., Mikl\u00f3s, I. (eds.) RECOMB-CG 2009. LNCS, vol.\u00a05817, pp. 70\u201383. Springer, Heidelberg (2009)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, M., Arndt, W., Tang, J.: An exact solver for the DCJ median problem. In: Pacific Symposium on Biocomputing, vol.\u00a014, pp. 138\u2013149 (2009)","DOI":"10.1142\/9789812836939_0014"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Ma\u0148uch, J., Patterson, M., Wittler, R., Chauve, C., Tannier, E.: Linearization of ancestral multichromosomal genomes. BMC Bioinformatics\u00a013(suppl. 19), S11 (2012)","DOI":"10.1186\/1471-2105-13-S19-S11"},{"issue":"12","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1101\/gr.5383506","volume":"16","author":"J. Ma","year":"2006","unstructured":"Ma, J., Zhang, L., Suh, B.B., Raney, B.J., Burhans, R.C., Kent, W.J., Blanchette, M., Haussler, D., Miller, W.: Reconstructing contiguous regions of an ancestral genome. Genome Research\u00a016(12), 1557\u20131565 (2006)","journal-title":"Genome Research"},{"issue":"8","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1093\/bioinformatics\/btq079","volume":"26","author":"M. Muffato","year":"2010","unstructured":"Muffato, M., Louis, A., Poisnel, C.-E., Crollius, H.R.: Genomicus: a database and a browser to study gene synteny in modern and ancestral genomes. Bioinformatics\u00a026(8), 1119\u20131121 (2010)","journal-title":"Bioinformatics"},{"issue":"8","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1089\/cmb.2008.0069","volume":"15","author":"J. Ma","year":"2008","unstructured":"Ma, J., Ratan, A., Raney, B.J., Suh, B.B., Zhang, L., Miller, W., Haussler, D.: Dupcar: reconstructing contiguous ancestral regions with duplications. Journal of Computational Biology\u00a015(8), 1007\u20131027 (2008)","journal-title":"Journal of Computational Biology"},{"issue":"8","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2008.0080","volume":"15","author":"M.A. Alekseyev","year":"2008","unstructured":"Alekseyev, M.A.: Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes. Journal of Computational Biology\u00a015(8), 1117\u20131131 (2008)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences\u00a065(3), 587\u2013609 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR19","series-title":"Lecture Notes in Bioinformatics","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 (LNBI), vol.\u00a04175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"issue":"5","key":"8_CR20","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1101\/gr.082784.108","volume":"19","author":"M.A. Alekseyev","year":"2009","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Breakpoint graphs and ancestral genome reconstructions. Genome Research\u00a019(5), 943\u2013957 (2009)","journal-title":"Genome Research"},{"key":"8_CR21","unstructured":"Jiang, S., Avdeyev, P., Hu, F., Alekseyev, M.A.: Reconstruction of ancestral genomes in presence of gene gain and loss (2014) (submitted)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44753-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T06:58:11Z","timestamp":1746341891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44753-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447529","9783662447536"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44753-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}