{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:58:31Z","timestamp":1742385511340},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_20","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"218-232","source":"Crossref","is-referenced-by-count":20,"title":["Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms"],"prefix":"10.1007","author":[{"given":"Shlomo","family":"Moran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagi","family":"Snir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1142\/S0129054196000038","volume":"7","author":"R. Agrawala","year":"1996","unstructured":"Agrawala, R., Fernandez-Baca, D.: Simple algorithms for perfect phylogeny and triangulating colored graphs. International Journal of Foundations of Computer Science\u00a07(1), 11\u201321 (1996)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Dor, A., Friedman, N., Yakhini, Z.: Class discovery in gene expression data. In: RECOMB, pp. 31\u201338 (2001)","DOI":"10.1145\/369133.369167"},{"issue":"6795","key":"20_CR3","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1038\/35020115","volume":"406","author":"M. Bittner","year":"2000","unstructured":"Bittner, M., et al.: Molecular classification of cutaneous malignant melanoma by gene expression profiling. Nature\u00a0406(6795), 536\u201340 (2000)","journal-title":"Nature"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fellows, M.R., Warnow, T.: Two strikes against perfect phylogeny. In: ICALP, pp. 273\u2013283 (1992)","DOI":"10.1007\/3-540-55719-9_80"},{"key":"20_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Newblock Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Newblock Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0893-9659(92)90026-6","volume":"5","author":"A. Dress","year":"1992","unstructured":"Dress, A., Steel, M.A.: Convex tree realizations of partitions. Applied Mathematics Letters\u00a05(3), 3\u20136 (1992)","journal-title":"Applied Mathematics Letters"},{"issue":"5","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1137\/S0097539799350839","volume":"32","author":"D. Fernndez-Baca","year":"2003","unstructured":"Fernndez-Baca, D., Lagergren, J.: A polynomial-time algorithm for near-perfect phylogeny. SIAM Journal on Computing\u00a032(5), 1115\u20131127 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01733209","volume":"18","author":"W.M. Fitch","year":"1981","unstructured":"Fitch, W.M.: A non-sequential method for constructing trees and hierarchical classifications. Journal of Molecular Evolution\u00a018(1), 30\u201337 (1981)","journal-title":"Journal of Molecular Evolution"},{"key":"20_CR9","doi-asserted-by":"publisher","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, Z., Warnow, T.: Minimizing phylogenetic number to find good evolutionary trees. Discrete Applied Mathematics\u00a071, 111\u2013136 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary history. Networks\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"4871","DOI":"10.1073\/pnas.0305627101","volume":"101","author":"A. Hirsh","year":"2004","unstructured":"Hirsh, A., Tsolaki, A., DeRiemer, K., Feldman, M., Small, P.: From the cover: Stable association between strains of mycobacterium tuberculosis and their human host populations. PNAS\u00a0101, 4871\u20134876 (2004)","journal-title":"PNAS"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","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. Computing\u00a023(3), 713\u2013737 (1994)","journal-title":"SIAM J. Computing"},{"issue":"6","key":"20_CR13","doi-asserted-by":"publisher","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 when the number of character states is fixed. SIAM J. Computing\u00a026(6), 1749\u20131763 (1997)","journal-title":"SIAM J. Computing"},{"key":"20_CR14","unstructured":"Moran, S., Snir, S.: Convex recoloring of strings and trees. Technical Report CS-2003-13, Technion (November 2003)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1137\/0128004","volume":"28","author":"D. Sankoff","year":"1975","unstructured":"Sankoff, D.: Minimal mutation trees of sequences. SIAM Journal on Applied Mathematics\u00a028, 35\u201342 (1975)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"20_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.A.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification\u00a09(1), 91\u2013116 (1992)","journal-title":"Journal of Classification"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T02:11:08Z","timestamp":1711332668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11534273_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}