{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:35Z","timestamp":1725516635144},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_30","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"319-327","source":"Crossref","is-referenced-by-count":5,"title":["On Recovering Syntenic Blocks from Comparative Maps"],"prefix":"10.1007","author":[{"given":"Zhixiang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghui","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M. (Selfi) Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal on Computing\u00a036, 1\u201315 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.tcs.2007.07.002","volume":"385","author":"G. Blin","year":"2007","unstructured":"Blin, G., Fertin, G., Vialette, S.: Extracting constrained 2-interval subsets in 2-interval sets. Theoretical Computer Science\u00a0385, 241\u2013263 (2007)","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-73437-6_14","volume-title":"Combinatorial Pattern Matching","author":"Z. Chen","year":"2007","unstructured":"Chen, Z., Fu, B., Yang, B., Xu, J., Zhao, Z., Zhu, B.: Non-breaking similarity of genomes with gene repetitions. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 119\u2013130. Springer, Heidelberg (2007)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I., Xia, G.: Linear FPT reductions and computational lower bounds. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC 2004), pp. 212\u2013221 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10878-006-9030-8","volume":"13","author":"E. Chen","year":"2007","unstructured":"Chen, E., Yang, L., Yuan, H.: Improved algorithms for largest cardinality 2-interval pattern problem. Journal of Combinatorial Optimization\u00a013, 263\u2013275 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Choi, V., Zheng, C., Zhu, Q., Sankoff, D.: Algorithms for the extraction of synteny blocks from comparative maps. In: Proceedings of the 7th International Workshop on Algorithms in Bioinformatics (WABI 2007), pp. 277\u2013288 (2007)","DOI":"10.1007\/978-3-540-74126-8_26"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/11561071_39","volume-title":"Algorithms \u2013 ESA 2005","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., Hermelin, D., Landau, G.M., Rawitz, D., Vialette, S.: Approximating the 2-interval pattern problem. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 426\u2013437. Springer, Heidelberg (2005)"},{"key":"30_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10878-006-9024-6","volume":"13","author":"M. Jiang","year":"2007","unstructured":"Jiang, M.: A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. Journal of Combinatorial Optimization\u00a013, 217\u2013221 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-72870-2_38","volume-title":"Algorithmic Aspects in Information and Management","author":"M. Jiang","year":"2007","unstructured":"Jiang, M.: Improved approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 399\u2013410. Springer, Heidelberg (2007)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-540-73556-4_39","volume-title":"Proceedings of the 1st Annual International Conference on Combinatorial Optimization and Applications (COCOA 2007)","author":"M. Jiang","year":"2007","unstructured":"Jiang, M.: A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 378\u2013387. Springer, Heidelberg (2007)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1007\/978-3-540-27836-8_77","volume-title":"Automata, Languages and Programming","author":"R.B. Lyngs\u00f8","year":"2004","unstructured":"Lyngs\u00f8, R.B.: Complexity of pseudoknot prediction in simple models. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 919\u2013931. Springer, Heidelberg (2004)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Schaefer, T.: The complexity of satisfiability problem. In: Proceedings of the 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.tcs.2003.08.010","volume":"312","author":"S. Vialette","year":"2004","unstructured":"Vialette, S.: On the computational complexity of 2-interval pattern matching problems. Theoretical Computer Science\u00a0312, 223\u2013249 (2004)","journal-title":"Theoretical Computer Science"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G. Watterson","year":"1982","unstructured":"Watterson, G., Ewens, W., Hall, T., Morgan, A.: The chromosome inversion problem. Journal of Theoretical Biology\u00a099, 1\u20137 (1982)","journal-title":"Journal of Theoretical Biology"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TCBB.2007.1075","volume":"4","author":"C. Zheng","year":"2007","unstructured":"Zheng, C., Zhu, Q., Sankoff, D.: Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a04, 515\u2013522 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:04Z","timestamp":1619523664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}