{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:45Z","timestamp":1759638165801},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741251"},{"type":"electronic","value":"9783540741268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74126-8_26","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T11:37:50Z","timestamp":1187869070000},"page":"277-288","source":"Crossref","is-referenced-by-count":24,"title":["Algorithms for the Extraction of Synteny Blocks from Comparative Maps"],"prefix":"10.1007","author":[{"given":"Vicky","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunfang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Choi, V.: BARNACLE: An assembly algorithm for clone-based sequences of whole genomes. Ph.D dissertation, Rutgers University (2002)","DOI":"10.1016\/S0378-1119(03)00825-4"},{"key":"26_CR2","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. ms. cf: The ultimate interval graph recognition algorithm? In: SODA 1998, pp. 175\u2013180 (2006)"},{"key":"26_CR3","unstructured":"Kumlander, D.: A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. ms. and poster. In: 4th European Congress of Mathematics (2005)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Liang, Y.D., Dhall, S.K., Lakshmivarahan, S.: On the problem of finding all maximum weight independent sets in interval and circular-arc graphs. IEEE Symposium on Applied Computing, 465\u2013470 (1991)","DOI":"10.1109\/SOAC.1991.143921"},{"key":"26_CR5","first-page":"424","volume":"8","author":"P.R.J. Ostergard","year":"2001","unstructured":"Ostergard, P.R.J.: A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing\u00a08, 424\u2013436 (2001)","journal-title":"Nordic Journal of Computing"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. Ostergard","year":"2002","unstructured":"Ostergard, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics\u00a0120, 195\u2013205 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences\u00a065, 587\u2013609 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/nar\/30.1.103","volume":"30","author":"D. Ware","year":"2002","unstructured":"Ware, D., Jaiswal, P., Ni, J., et al.: Gramene: a resource for comparative grass genomics. Nucleic Acids Research\u00a030, 103\u2013105 (2002)","journal-title":"Nucleic Acids Research"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Zheng, C., Zhu, Q., Sankoff, D.: Removing noise and ambiguities from comparative maps in rearrangement analysis. Transactions on Computational Biology and Bioinformatics (forthcoming, 2007), doi:10.1109\/TCBB.2007.1075","DOI":"10.1109\/TCBB.2007.1075"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74126-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:33Z","timestamp":1619503893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74126-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741251","9783540741268"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74126-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}