{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:37:21Z","timestamp":1742996241733,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21260-4_2","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T00:26:59Z","timestamp":1304036819000},"page":"2-3","source":"Crossref","is-referenced-by-count":3,"title":["OMG! Orthologs for Multiple Genomes - Competing Formulations"],"prefix":"10.1007","author":[{"given":"David","family":"Sankoff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1093\/bioinformatics\/btr008","volume":"27","author":"J. Fostier","year":"2011","unstructured":"Fostier, J., et al.: A greedy, graph-based algorithm for the alignment of multiple homologous gene lists. Bioinformatics\u00a027, 749\u2013756 (2011)","journal-title":"Bioinformatics"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1111\/j.1365-313X.2007.03326.x","volume":"53","author":"E. Lyons","year":"2008","unstructured":"Lyons, E., Freeling, M.: How to usefully compare homologous plant genes and chromosomes as DNA sequences. Plant J.\u00a053, 661\u2013673 (2008)","journal-title":"Plant J."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1104\/pp.108.124867","volume":"148","author":"E. Lyons","year":"2008","unstructured":"Lyons, E., et al.: Finding and comparing syntenic regions among Arabidopsis and the outgroups papaya, poplar and grape: CoGe with rosids. Plant Phys.\u00a0148, 1772\u20131781 (2008)","journal-title":"Plant Phys."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00021","volume":"4","author":"G. He","year":"2000","unstructured":"He, G., Liu, J., Zhao, C.: Approximation algorithms for some graph partitioning problems. Journal of Graph Algorithms and Applications\u00a04, 1\u201311 (2000)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"2_CR5","series-title":"LNBI","first-page":"99","volume-title":"ISBRA 2011","author":"C. Zheng","year":"2011","unstructured":"Zheng, C., Sankoff, D.: Gene order in Rosid phylogeny, inferred from pairwise syntenies among extant genomes. In: Chen, J., Wang, J., Zelikovsky, A. (eds.) ISBRA 2011. LNCS (LNBI), vol.\u00a06674, pp. 99\u2013110. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:30:50Z","timestamp":1578533450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_2"}},"subtitle":["(Keynote Talk)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}