{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:47:06Z","timestamp":1773280026406,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223412","type":"print"},{"value":"9783540278016","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_17","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:00:15Z","timestamp":1283713215000},"page":"230-243","source":"Crossref","is-referenced-by-count":4,"title":["Small Phylogeny Problem: Character Evolution Trees"],"prefix":"10.1007","author":[{"given":"Arvind","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Stacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/2406441","volume":"19","author":"J.H. Camin","year":"1965","unstructured":"Camin, J.H., Sokal, R.R.: A method for deducing branching sequences in phylogeny. Evolution\u00a019, 311\u2013326 (1965)","journal-title":"Evolution"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.2307\/2419070","volume":"17","author":"J.J. Doyle","year":"1992","unstructured":"Doyle, J.J.: Gene trees and species trees: Molecular systematics as onecharacter taxonomy. Systematic Botany\u00a017, 144\u2013163 (1992)","journal-title":"Systematic Botany"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.2307\/2413432","volume":"35","author":"W.I.E. Day","year":"1986","unstructured":"Day, W.I.E., Sankoff, D.: Computational complexity of inferring phylogenies by compatibility. Systematic Zoology\u00a035, 224\u2013229 (1986)","journal-title":"Systematic Zoology"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.2307\/2412028","volume":"19","author":"J.S. Farris","year":"1970","unstructured":"Farris, J.S.: Methods for computing Wagner trees. Systematic Zoology\u00a019, 83\u201392 (1970)","journal-title":"Systematic Zoology"},{"key":"17_CR5","first-page":"314","volume":"31","author":"J.S. Farris","year":"1982","unstructured":"Farris, J.S.: Outgroups and parsimony. Zoology\u00a031, 314\u2013320 (1982)","journal-title":"Zoology"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J. Felsenstein","year":"1981","unstructured":"Felsenstein, J.: Evolutionary trees from DNA sequences: a maximum likelihood approach. Journal of Molecular Evolution\u00a017, 368\u2013376 (1981)","journal-title":"Journal of Molecular Evolution"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L.R. Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NPcomplete. Advances In Applied mathematics\u00a03, 43\u201349 (1982)","journal-title":"Advances In Applied mathematics"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"W.M. Fitch","year":"1971","unstructured":"Fitch, W.M.: Toward defining the course of evolution: Minimum change for a specific tree topology. Systematic Zoology\u00a020, 406\u2013416 (1971)","journal-title":"Systematic Zoology"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"W.M. Fitch","year":"1967","unstructured":"Fitch, W.M., Margoliash, E.: Construction of phylogenetic trees. Science\u00a0155, 279\u2013284 (1967)","journal-title":"Science"},{"key":"17_CR10","unstructured":"Hennig, W.: Phylogenetic Systematics. University of Illinois Press (1966)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1111\/j.1096-0031.1997.tb00320.x","volume":"13","author":"J.A. Hawkins","year":"1997","unstructured":"Hawkins, J.A., Hughes, C.E., Scotland, R.W.: Primary homology assessment, characters and character states. Cladistics\u00a013, 275\u2013283 (1997)","journal-title":"Cladistics"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013, 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1111\/j.1096-0031.1992.tb00050.x","volume":"8","author":"D.L. Lipscomb","year":"1992","unstructured":"Lipscomb, D.L.: Parsimony, homology and the analysis of multistate characters. Cladistics\u00a08, 45\u201365 (1992)","journal-title":"Cladistics"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.2307\/2413369","volume":"31","author":"M.F. Mickevich","year":"1982","unstructured":"Mickevich, M.F.: Transformation series analysis. Systematic Zoology\u00a031, 461\u2013478 (1982)","journal-title":"Systematic Zoology"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1111\/j.1096-0031.1991.tb00028.x","volume":"7","author":"M.F. Mickevich","year":"1991","unstructured":"Mickevich, M.F., Lipscomb, D.L.: Parsimony and the choice between different transformations for the same character set. Cladistics\u00a07, 111\u2013139 (1991)","journal-title":"Cladistics"},{"key":"17_CR16","first-page":"343","volume":"108","author":"J. Matousek","year":"1992","unstructured":"Matousek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Journal of Algorithms\u00a0108, 343\u2013364 (1992)","journal-title":"Journal of Algorithms"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1111\/j.1096-0031.1990.tb00533.x","volume":"6","author":"M.F. Mickevich","year":"1990","unstructured":"Mickevich, M.F., Weller, S.: Evolutionary character analysis: Tracing character change on a cladogram. Cladistics\u00a06, 137\u2013170 (1990)","journal-title":"Cladistics"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"268","DOI":"10.2307\/2413066","volume":"36","author":"R.T. O\u2019Grady","year":"1987","unstructured":"O\u2019Grady, R.T., Deets, G.B.: Coding mulitistate characters, with special reference to the use of parasites as characters of their hosts. Systematic Zoology\u00a036, 268\u2013279 (1987)","journal-title":"Systematic Zoology"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1111\/j.1096-0031.1990.tb00549.x","volume":"6","author":"M. Pogue","year":"1990","unstructured":"Pogue, M., Michevich, M.F.: Character definitons and character state delineations: the bete noire of phylogenetics. Cladistics\u00a06, 365\u2013369 (1990)","journal-title":"Cladistics"},{"key":"17_CR20","first-page":"568","volume":"5","author":"P. Pamilo","year":"1988","unstructured":"Pamilo, P., Nei, M.: Relationships between gene trees and species trees. Mo. Biol. Evol.\u00a05, 568\u2013583 (1988)","journal-title":"Mo. Biol. Evol."},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1137\/0128004","volume":"28","author":"D.D. Sankoff","year":"1975","unstructured":"Sankoff, D.D.: Minimal mutation trees of sequences. SIAM Journal on Applied Mathematics\u00a028, 35\u201342 (1975)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"17_CR23","first-page":"253","volume-title":"Time Warp, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison","author":"D. Sankoff","year":"1983","unstructured":"Sankoff, D., Cedergren, R.: Simultaneous comparisons of three or more sequences related by a tree. In: Sankoff, D., Kruskal, J. (eds.) Time Warp, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, pp. 253\u2013264. Addison Wesley, Reading (1983)"},{"key":"17_CR24","first-page":"514","volume":"6","author":"N. Saitou","year":"1989","unstructured":"Saitou, N., Imanishi, T.: Relative efficiencies of the Fitch-Margoliash, maximum parsimony, maximum likelihood, minimum-evolution, and neighborjoining methods of phylogenetic tree construction in obtaining the correct tree. Journal of Molecular Evolution\u00a06, 514\u2013525 (1989)","journal-title":"Journal of Molecular Evolution"},{"key":"17_CR25","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution\u00a04, 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolution"},{"key":"17_CR26","first-page":"261","volume":"11","author":"Y. Tateno","year":"1994","unstructured":"Tateno, Y., Takezaki, N., Nei, M.: Relative efficiencies of the maximumlikelihood, neighbor-joining and maximum-parsimony methods when substitution rate varies with site. Journal of Molecular Evolution\u00a011, 261\u2013277 (1994)","journal-title":"Journal of Molecular Evolution"},{"key":"17_CR27","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1093\/genetics\/127.2.429","volume":"127","author":"C.-I. Wu","year":"1991","unstructured":"Wu, C.-I.: Inferences of species phylogeny in relation to segregation of acient polymorphisms. Genetics\u00a0127, 429\u2013435 (1991)","journal-title":"Genetics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T13:03:31Z","timestamp":1636376611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}