{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:38Z","timestamp":1725455018876},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_1","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Preserving Inversion Phylogeny Reconstruction"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bernt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyun-Wei","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Tannier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1093\/molbev\/msi134","volume":"22","author":"E. Belda","year":"2005","unstructured":"Belda, E., Moya, A., Silva, F.J.: Genome rearrangement distances and gene order phylogeny in \u03b3-proteobacteria. Mol. Biol. Evol.\u00a022, 1456\u20131467 (2005)","journal-title":"Mol. Biol. Evol."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCBB.2007.1011","volume":"4","author":"S. B\u00e9rard","year":"2007","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a04, 4\u201316 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2007.10.012","volume":"106","author":"S. B\u00e9rard","year":"2008","unstructured":"B\u00e9rard, S., Chauve, C., Paul, C.: A more efficient algorithm for perfect sorting by reversals. Inform. Process. Lett.\u00a0106, 90\u201395 (2008)","journal-title":"Inform. Process. Lett."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1137\/060651331","volume":"22","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. SIAM J. Discrete Math.\u00a022, 1022\u20131039 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR5","unstructured":"Bernt, M.: Gene Order Rearrangement Methods for the Reconstruction of Phylogeny. PhD thesis, Universit\u00e4t Leipzig (2010)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/TCBB.2008.39","volume":"5","author":"M. Bernt","year":"2008","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: Solving the preserving reversal median problem. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a05, 332\u2013347 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"2957","DOI":"10.1093\/bioinformatics\/btm468","volume":"23","author":"M. Bernt","year":"2007","unstructured":"Bernt, M., Merkle, D., Ramsch, K., Fritzsch, G., Perseke, M., Bernhard, D., Schlegel, M., Stadler, P.F., Middendorf, M.: CREx: inferring genomic rearrangements based on common intervals. Bioinformatics\u00a023, 2957\u20132958 (2007)","journal-title":"Bioinformatics"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013, 335\u2013339 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-02441-2_28","volume-title":"Combinatorial Pattern Matching","author":"M. Bouvel","year":"2009","unstructured":"Bouvel, M., Chauve, C., Mishna, M., Rossin, D.: Average-Case Analysis of Perfect Sorting by Reversals. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 314\u2013325. Springer, Heidelberg (2009)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.2307\/2413432","volume":"35","author":"W.H.E. Day","year":"1986","unstructured":"Day, W.H.E., Sankoff, D.: Computational complexity of inferring phylogenies by compatibility. Syst. Zool.\u00a035, 224\u2013229 (1986)","journal-title":"Syst. Zool."},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1186\/1471-2105-7-188","volume":"7","author":"J. Dutheil","year":"2006","unstructured":"Dutheil, J., Gaillard, S., Bazin, E., Glemin, S., Ranwez, V., Galtier, N., Belkhir, K.: Bio++: a set of C++ libraries for sequence analysis, phylogenetics, molecular evolution and population genetics. BMC Bioinformatics\u00a07(1), 188 (2006)","journal-title":"BMC Bioinformatics"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P. Feijao","year":"2011","unstructured":"Feijao, P., Meidanis, J.: SCJ: A breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a08, 1318\u20131329 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"1_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30219-3_3","volume-title":"Algorithms in Bioinformatics","author":"M. Figeac","year":"2004","unstructured":"Figeac, M., Varr\u00e9, J.-S.: Sorting by Reversals with Common Intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 26\u201337. Springer, Heidelberg (2004)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"W. Fitch","year":"1971","unstructured":"Fitch, W.: Toward defining the course of evolution: minimum change for a specified tree topology. Syst. Zool.\u00a020, 406\u2013416 (1971)","journal-title":"Syst. Zool."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L.R. Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math.\u00a03, 43\u201349 (1982)","journal-title":"Adv. Appl. Math."},{"key":"1_CR17","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":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Combinatorial Pattern Matching","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Finding All Common Intervals of k Permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 207\u2013218. Springer, Heidelberg (2001)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1471-2105-10-S6-S3","volume":"10","author":"S. Penel","year":"2009","unstructured":"Penel, S., Arigon, A.M., Dufayard, J.F., Sertier, A.S., Daubin, V., Duret, L., Gouy, M., Perri\u00e8re, G.: Databases of homologous gene families for comparative genomics. BMC Bioinformatics\u00a010, S3 (2009)","journal-title":"BMC Bioinformatics"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"Combinatorial Pattern Matching","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit Distance for Genome Comparison Based on Non-Local Operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 121\u2013135. Springer, Heidelberg (1992)"},{"key":"1_CR21","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, 120 (2009)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:48Z","timestamp":1620129348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}