{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:26Z","timestamp":1725664226151},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612582"},{"type":"electronic","value":"9783540683902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61258-0_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:21:12Z","timestamp":1330291272000},"page":"253-270","source":"Crossref","is-referenced-by-count":2,"title":["Constructing computer virus phylogenies"],"prefix":"10.1007","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia A.","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory B.","family":"Sorkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 294\u2013304, 1993.","DOI":"10.1145\/167088.167174"},{"issue":"4","key":"19_CR2","first-page":"515","volume":"2","author":"C. Benham","year":"1995","unstructured":"C. Benham, S. Kannan, M. Paterson, and T. Warnow. Hen's teeth and whale's feet: Generalized characters and their compatibility. Journal of Mathematical Biology, 2(4):515\u2013525, 1995.","journal-title":"Journal of Mathematical Biology"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, M. Fellows, and T. Warnow. Two strikes against perfect phylogeny. In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, pages 273\u2013283. Springer Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_80"},{"key":"19_CR4","unstructured":"C. Colbourn and M. Jerrum, 1995. Personal communication."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"C. Colbourn, W. Myrvold, and E. Neufeld. Two algorithms for unranking arborescences. Journal of Algorithms. To appear.","DOI":"10.1006\/jagm.1996.0014"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251\u2013280, 1990.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR7","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige. A threshold of ln n for approximating set cover. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 286\u2013293, 1996.","DOI":"10.1145\/237814.237977"},{"key":"19_CR9","unstructured":"A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"L. Goldberg, P. Goldberg, C. Phillips, E. Sweedyk, and T. Warnow. Computing the phylogenetic number to find good evolutionary trees. In Proceedings of the 6th Symposium on Combinatorial Pattern Matching, July 1995.","DOI":"10.1007\/3-540-60044-2_38"},{"key":"19_CR11","first-page":"12","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:12\u201328, 1991.","journal-title":"Networks"},{"key":"19_CR12","volume-title":"Zinsser Microbiology","year":"1992","unstructured":"W. Joklik, H. Willett, D. Amos, and C. Wilfert, editors. Zinsser Microbiology. Appleton & Lange, Norwalk, Connecticut, 20th edition, 1992.","edition":"20th edition"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"D. Karger, P. Klein, and R. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the Association for Computing Machinery, 42(2), 1995.","DOI":"10.1145\/201019.201022"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"J. Kephart and W. Arnold. Automatic extraction of computer virus signatures. In R. Ford, editor, Proceedings of the 4th Virus Bulletin International Conference, pages 179\u2013194. Virus Bulletin Ltd; 1994.","DOI":"10.1016\/0142-0496(94)90045-0"},{"key":"19_CR15","unstructured":"A. Nijenhuis and H. Wilf. Combinatorial Algorithms for Computers and Calculators. Academic Press, 2nd edition, 1978."},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389\u20131401, 1957.","journal-title":"Bell System Technical Journal"},{"key":"19_CR17","unstructured":"G. B. Sorkin. Grouping related computer viruses into families. In Proceedings of the IBM Security ITS, Oct. 1994."},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9:91\u2013116, 1992.","journal-title":"Journal of Classification"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"D. Wilson. Generating random spanning trees more quickly than the cover time. Submitted for publication, 1995.","DOI":"10.1145\/237814.237880"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61258-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:41Z","timestamp":1605647081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61258-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612582","9783540683902"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61258-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}