{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:08:11Z","timestamp":1649214491062},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T00:00:00Z","timestamp":1244160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00287-009-0350-9","type":"journal-article","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T18:13:11Z","timestamp":1244225591000},"page":"288-300","source":"Crossref","is-referenced-by-count":1,"title":["Approximative Gencluster und ihre Anwendung in der komparativen Genomik"],"prefix":"10.1007","volume":"32","author":[{"given":"Katharina","family":"Jahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,5]]},"reference":[{"issue":"4","key":"350_CR1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ipl.2007.03.006","volume":"103","author":"A Amir","year":"2007","unstructured":"Amir A, Gasieniec L, Shalom R (2007) Improved approximate common interval. Inf Process Lett 103(4):142\u2013149","journal-title":"Inf Process Lett"},{"key":"350_CR2","doi-asserted-by":"crossref","unstructured":"Bergeron A, Chauve C, de Mongolfier F, Raffinot M (2005) Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. In: Proceedings of ESA 2005, volume 3669 of LNCS, pp 779\u2013790","DOI":"10.1007\/11561071_69"},{"key":"350_CR3","doi-asserted-by":"crossref","unstructured":"Bergeron A, Corteel S, Raffinot M (2002) The Algorithmic of Gene Teams. In: Proceedings of WABI 2002, volume 2452 of LNCS, pp 464\u2013476","DOI":"10.1007\/3-540-45784-4_36"},{"key":"350_CR4","doi-asserted-by":"crossref","unstructured":"Blin G, Chauve C, Fertin G (2005) Genes Order and Phylogenetic Reconstruction: Application to Gamma-Proteobacteria. In: Proc. of the RECOMB 2005 International Workshop on Comparative Genomics, RCG 2005, volume 3678 of LNBI, pp 11\u201320","DOI":"10.1007\/11554714_2"},{"key":"350_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6cker S, Jahn K, Mixtacki J, Stoye J (2008) Computation of Median Gene Clusters. In: Proceedings of RECOMB 2008, volume 4955 of LNCS, pp 331\u2013345. Langfassung erscheint demn\u00e4chst in J Comput Biol","DOI":"10.1007\/978-3-540-78839-3_28"},{"key":"350_CR6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.jda.2006.03.021","volume":"5","author":"G Didier","year":"2007","unstructured":"Didier G, Schmidt T, Stoye J, Tsur D (2007) Character sets of strings. J Discr Alg 5:330\u2013340","journal-title":"J Discr Alg"},{"key":"350_CR7","first-page":"164","volume":"5","author":"J Felsenstein","year":"1989","unstructured":"Felsenstein J (1989) PHYLIP \u2013 Phylogeny Inference Package (Version 3.2). Cladistics 5:164\u2013166","journal-title":"Cladistics"},{"key":"350_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"WM Fitch","year":"1967","unstructured":"Fitch WM, Margoliash E (1967) Construction of phylogenetic trees. Science 155:279\u2013284","journal-title":"Science"},{"key":"350_CR9","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1089\/cmb.2005.12.638","volume":"12","author":"X He","year":"2005","unstructured":"He X, Goldwasser MH (2005) Identifying conserved gene clusters in the presence of homology families. J Comp Biol 12:638\u2013656","journal-title":"J Comp Biol"},{"key":"350_CR10","doi-asserted-by":"crossref","unstructured":"Heber S, Stoye J (2001) Algorithms for Finding Gene Clusters. In: Proceedings of WABI 2001, volume 2149 of LNCS, pp 252\u2013263","DOI":"10.1007\/3-540-44696-6_20"},{"key":"350_CR11","doi-asserted-by":"crossref","unstructured":"Heber S, Stoye J (2001) Finding all Common Intervals of k Permutations. In: Proceedings of CPM 2001, volume 2089 of LNCS, pp 207\u2013218","DOI":"10.1007\/3-540-48194-X_19"},{"issue":"3","key":"350_CR12","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1093\/molbev\/msi036","volume":"22","author":"JT Herbeck","year":"2005","unstructured":"Herbeck JT, Degnan PH, Wernegreen JJ (2005) Nonhomogeneous model of sequence evolution indicates independent origins of primary endosymbionts within the enterobacteriales (gamma-Proteobacteria). Mol Biol Evol 22(3):520\u2013532","journal-title":"Mol Biol Evol"},{"key":"350_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1371\/journal.pbio.0000019","volume":"1","author":"E Lerat","year":"2003","unstructured":"Lerat E, Daubin V, Moran NA (2003) From gene trees to organismal phylogeny in prokaryotes: The case of the \u03b3-proteobacteria. PLoS Biol 1:101\u2013109","journal-title":"PLoS Biol"},{"key":"350_CR14","doi-asserted-by":"crossref","unstructured":"Rahmann S, Klau GW (2006) Integer Linear Programs for Discovering Approximate Gene Clusters. Proceedings of WABI 2006, volume 4175 of LNBI, pp 298\u2013309","DOI":"10.1007\/11851561_28"},{"key":"350_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DR Robinson","year":"1982","unstructured":"Robinson DR, Foulds LR (1982) Comparison of phylogenetic trees. Math Biosci 53:131\u2013147","journal-title":"Math Biosci"},{"key":"350_CR16","doi-asserted-by":"crossref","unstructured":"Schmidt T, Stoye J (2004) Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. In: Proceedings of CPM 2004, volume 3109 of LNCS, pp 347\u2013358","DOI":"10.1007\/978-3-540-27801-6_26"},{"issue":"1","key":"350_CR17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1093\/nar\/29.1.22","volume":"29","author":"RL Tatusov","year":"2001","unstructured":"Tatusov RL, Natale DA, Garkavtsev IV, Tatusova TA, Shankavaram UT, Rao BS, Kiryutin B, Galperin MY, Fedorova ND, Koonin EV (2001) The COG database: new developments in phylogenetic classification of proteins from complete genomes. Nucl Acids Res 29(1):22\u201328","journal-title":"Nucl Acids Res"},{"key":"350_CR18","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T Uno","year":"2000","unstructured":"Uno T, Yagiura M (2000) Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26:290\u2013309","journal-title":"Algorithmica"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-009-0350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-009-0350-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-009-0350-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:42:32Z","timestamp":1559040152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-009-0350-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,5]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s00287-009-0350-9","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,5]]}}}