{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:45:58Z","timestamp":1725511558441},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540794493"},{"type":"electronic","value":"9783540794509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79450-9_13","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T09:54:22Z","timestamp":1209462862000},"page":"134-145","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Gene Adjacencies, Graph Bandwidth and Clusters in Yeast Evolution"],"prefix":"10.1007","author":[{"given":"Qian","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaky","family":"Adam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vicky","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45784-4_36","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 464\u2013476. Springer, Heidelberg (2002)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Konjevod, G., Ravi, R., Vempala, S.: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. In: Proceedings of the 30th ACM Symposium on the Theory of Computing, pp. 95\u2013100 (1997)","DOI":"10.1145\/276698.276717"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1101\/gr.3672305","volume":"15","author":"K.P. Byrne","year":"2005","unstructured":"Byrne, K.P., Wolfe, K.H.: The Yeast Gene Order Browser: combining curated homology and syntenic context reveals gene fate in polyploid species. Genome Research\u00a015, 1456\u20131461 (2005)","journal-title":"Genome Research"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th National Conference of the ACM, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"13_CR5","unstructured":"Felsenstein, J.: Inferring phylogenies. Sinauer Associates, Sunderland, MA (2004)"},{"key":"13_CR6","unstructured":"George, A.: Computer implementation of the finite element method, STAN-CS-71-208, Computer Science Dept., Stanford Univ., Stanford, CA (1971)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1089\/cmb.2005.12.1083","volume":"12","author":"R. Hoberman","year":"2005","unstructured":"Hoberman, R., Sankoff, D., Durand, D.: The statistical analysis of spatially clustered genes under the maximum gap criterion. Journal of Computational Biology\u00a012, 1081\u20131100 (2005)","journal-title":"Journal of Computational Biology"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1137\/0713020","volume":"13","author":"J. Liu","year":"1975","unstructured":"Liu, J., Sherman, A.: Comparative analysis of the Cuthill-Mckee and the reverse Cuthill-Mckee ordering algorithms for sparse matrices. SIAM Journal of Numerical Analysis\u00a013, 198\u2013213 (1975)","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing\u00a016, 263\u2013270 (1976)","journal-title":"Computing"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J. Saxe","year":"1980","unstructured":"Saxe, J.: Dynamic-programming algorithms for recognizing small-band-width graphs in polynomial time. SIAM Journal of Algebraic and Discrete Methods\u00a01, 363\u2013369 (1980)","journal-title":"SIAM Journal of Algebraic and Discrete Methods"}],"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-540-79450-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:58Z","timestamp":1619522518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79450-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540794493","9783540794509"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79450-9_13","relation":{},"subject":[]}}