{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:57Z","timestamp":1725533517174},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_27","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T13:19:32Z","timestamp":1245244772000},"page":"301-313","source":"Crossref","is-referenced-by-count":0,"title":["Finding All Sorting Tandem Duplication Random Loss Operations"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bernt","sequence":"first","affiliation":[]},{"given":"Ming-Chiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Merkle","sequence":"additional","affiliation":[]},{"given":"Hung-Lung","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45784-4_23","volume-title":"Algorithms in Bioinformatics","author":"Y. Ajana","year":"2002","unstructured":"Ajana, Y., Lefebvre, J.-F., Tillier, E.R.M., El-Mabrouk, N.: Exploring the set of all minimal sequences of reversals an application to test the replication-directed reversal hypothesis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 300\u2013315. Springer, Heidelberg (2002)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics\u00a011, 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1093\/bioinformatics\/btl300","volume":"23","author":"M. Bernt","year":"2007","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: Using median sets for inferring phylogenetic trees. Bioinformatics\u00a023(2), 129\u2013135 (2007)","journal-title":"Bioinformatics"},{"key":"27_CR4","series-title":"Computational biology series","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-94-011-4309-7_13","volume-title":"Comparative genomics","author":"J.L. Boore","year":"2000","unstructured":"Boore, J.L.: The duplication\/random loss model for gene rearrangement exemplified by mitochondrial genomes of deuterostome animals. In: Comparative genomics. Computational biology series, vol.\u00a01, pp. 133\u2013147. Kluwer, Dordrecht (2000)"},{"issue":"8-10","key":"27_CR5","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1016\/j.tcs.2008.11.017","volume":"410","author":"M. Bouvel","year":"2009","unstructured":"Bouvel, M., Rossin, D.: A variant of the tandem duplication - random loss model of genome rearrangement. Theoretical Computer Science\u00a0410(8-10), 847\u2013858 (2009)","journal-title":"Theoretical Computer Science"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TCBB.2008.16","volume":"5","author":"M. Braga","year":"2008","unstructured":"Braga, M., Sagot, M.-F., Scornavacca, C., Tannier, E.: Exploring the solution space of sorting by reversals, with experiments and an application to evolution. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a05, 348\u2013356 (2008)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Chen, K., Mihaescu, R., Rao, S.: On the tandem duplication-random loss model of genome rearrangement. In: SODA, pp. 564\u2013570 (2006)","DOI":"10.1145\/1109557.1109619"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45123-4_20","volume-title":"Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"2000","unstructured":"El-Mabrouk, N.: Genome rearrangement by reversals and insertions\/deletions of contiguous segments. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 222\u2013234. Springer, Heidelberg (2000)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: ACM Symposium on Theory of Computing, pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1093\/molbev\/msg206","volume":"20","author":"J.G. Inoue","year":"2003","unstructured":"Inoue, J.G., Miya, M., Tsukamoto, K., Nishida, M.: Evolution of the deep-sea gulper eel mitochondrial genomes: Large-scale gene rearrangements originated within the eels. Mol. Biol. Evol.\u00a020, 1917\u20131924 (2003)","journal-title":"Mol. Biol. Evol."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/oxfordjournals.molbev.a004068","volume":"19","author":"D.V. Lavrov","year":"2002","unstructured":"Lavrov, D.V., Boore, J.L., Brown, W.M.: Complete mtdna sequences of two millipedes suggest a new model for mitochondrial gene rearrangements: Duplication and nonrandom loss. Mol. Biol. Evol.\u00a019, 163\u2013169 (2002)","journal-title":"Mol. Biol. Evol."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/molbev\/msj025","volume":"23","author":"D.S. Mauro","year":"2006","unstructured":"Mauro, D.S., Gower, D.J., Zardoya, R., Wilkinson, M.: A hotspot of gene order rearrangement by tandem duplication and random loss in the vertebrate mitochondrial genome. Mol. Biol. Evol.\u00a023, 227\u2013234 (2006)","journal-title":"Mol. Biol. Evol."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1111\/j.1095-8312.2005.00483.x","volume":"85","author":"M. Miya","year":"2005","unstructured":"Miya, M., Satoh, T.P., Nishida, M.: The phylogenetic position of toadfishes (order batrachoidiformes) in the higher ray-finned fish as inferred from partitioned bayesian analysis of 102 whole mitochondrial genome sequences. Biol. J. Linn. Soc. Lond.\u00a085, 289\u2013306 (2005)","journal-title":"Biol. J. Linn. Soc. Lond."},{"issue":"3-4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1089\/10665270360688200","volume":"10","author":"A.C. Siepel","year":"2003","unstructured":"Siepel, A.C.: An algorithm to enumerate sorting reversals for signed permutations. Journal of Computational Biology\u00a010(3-4), 575\u2013597 (2003)","journal-title":"Journal of Computational Biology"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. ACM Journal on Experimental Algorithmics\u00a012(3.5) (2008)","DOI":"10.1145\/1227161.1402297"},{"key":"27_CR16","unstructured":"Tang, J., Moret, B.M.E., Cui, L., de Pamphilis, C.W.: Phylogenetic reconstruction from arbitrary gene-order data. In: Proc. 4th IEEE Conf. on Bioinformatics and Bioengineering BIBE 2004, pp. 592\u2013599 (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:33:38Z","timestamp":1558395218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}