{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:26:27Z","timestamp":1770323187584,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,18]],"date-time":"2007-10-18T00:00:00Z","timestamp":1192665600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00224-007-9069-7","type":"journal-article","created":{"date-parts":[[2007,10,17]],"date-time":"2007-10-17T17:57:10Z","timestamp":1192643830000},"page":"3-18","source":"Crossref","is-referenced-by-count":14,"title":["Improved Approximation Algorithm for Convex Recoloring of Trees"],"prefix":"10.1007","volume":"43","author":[{"given":"Reuven","family":"Bar-Yehuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ido","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,18]]},"reference":[{"issue":"3","key":"9069_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A\u00a02-approximation algorithm for the undirected feedback vertex set problem. SIAM J.\u00a0Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J.\u00a0Discrete Math."},{"issue":"5","key":"9069_CR2","first-page":"1069","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A\u00a0unified approach to approximating resource allocation and scheduling. J.\u00a0ACM 48(5), 1069\u20131090 (2001)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9069_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s004530010009","volume":"27","author":"R. Bar-Yehuda","year":"2000","unstructured":"Bar-Yehuda, R.: One for the price of two: a\u00a0unified approach for approximating covering problems. Algorithmica 27(2), 131\u2013144 (2000)","journal-title":"Algorithmica"},{"key":"9069_CR4","first-page":"27","volume":"25","author":"R. Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27\u201346 (1985)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"9069_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/1041680.1041683","volume":"36","author":"R. Bar-Yehuda","year":"2004","unstructured":"Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: a unified framework for approximation algorithms. ACM Comput. Surv. 36(4), 422\u2013463 (2004)","journal-title":"ACM Comput. Surv."},{"key":"9069_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-55719-9_80","volume-title":"19th International Colloquium on Automata, Languages, and Programming","author":"H.L. Bodlaender","year":"1992","unstructured":"Bodlaender, H.L., Fellows, M.R., Warnow, T.J.: Two strikes against perfect phylogeny. In: 19th International Colloquium on Automata, Languages, and Programming. LNCS, vol. 623, pp. 273\u2013283. Springer, Berlin (1992)"},{"key":"9069_CR7","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/TC.1984.5009360","volume":"33","author":"M. Er","year":"1984","unstructured":"Er, M.: On generating the n-ary reflected gray codes. IEEE Trans. Comput. 33, 739\u2013741 (1984)","journal-title":"IEEE Trans. Comput."},{"issue":"1\u20133","key":"9069_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0166-218X(96)00060-1","volume":"71","author":"L.A. Goldberg","year":"1996","unstructured":"Goldberg, L.A., Goldberg, P.W., Phillips, C.A., Sweedyk, E., Warnow, T.: Minimizing phylogenetic number to find good evolutionary trees. Discrete Appl. Math. 71(1\u20133), 111\u2013136 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9069_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21(1), 19\u201328 (1991)","journal-title":"Networks"},{"issue":"4","key":"9069_CR10","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/S0097539791222171","volume":"23","author":"S. Kannan","year":"1994","unstructured":"Kannan, S., Warnow, T.: Inferring evolutionary history from DNA sequences. SIAM J. Comput. 23(4), 713\u2013737 (1994)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9069_CR11","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1137\/S0097539794279067","volume":"26","author":"S. Kannan","year":"1997","unstructured":"Kannan, S., Warnow, T.: A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM J. Comput. 26(6), 1749\u20131763 (1997)","journal-title":"SIAM J. Comput."},{"key":"9069_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/11534273_20","volume-title":"9th Workshop on Algorithms and Data Structures","author":"S. Moran","year":"2005","unstructured":"Moran, S., Snir, S.: Convex recoloring of trees and strings: definitions, hardness results, and algorithms. In: 9th Workshop on Algorithms and Data Structures. LNCS, vol. 3608, pp. 218\u2013232. Springer, Berlin (2005)"},{"key":"9069_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/11538462_17","volume-title":"8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems","author":"S. Moran","year":"2005","unstructured":"Moran, S., Snir, S.: Efficient approximation of convex recoloring. In: 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS, vol. 3624, pp. 192\u2013208. Springer, Berlin (2005)"},{"key":"9069_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0128004","volume":"28","author":"D. Sankoff","year":"1975","unstructured":"Sankoff, D.: Minimal mutation trees of sequences. SIAM J. Appl. Math. 28, 35\u201342 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"9069_CR15","series-title":"Mathematics and its Applications Series","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Mathematics and its Applications Series, vol.\u00a022. Oxford University Press, London (2003)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9069-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9069-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9069-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T14:31:47Z","timestamp":1708266707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9069-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,18]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9069"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9069-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,18]]}}}