Constructing computer virus phylogenies

Journal of Algorithms

Volumn 26, Issue 1, 1998, Pages 188-208

  Goldberg, Leslie Ann ^a   Goldberg, Paul W ^a   Phillips, Cynthia A ^b   Sorkin, Gregory B ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344113893     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0897     Document Type: Article

References (20)

1. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in "Proceedings of the Twentyfifth Annual ACM Symposium on the Theory of Computing, 1993," pp. 294-304.
2. C. Benham, S. Kannan, M. Paterson, and T. Warnow, Hen's teeth and whale's feet: Generalized characters and their compatibility, J. Math. Biol. 2(4) (1995), 515-525.
3. H. Bodlaender, M. Fellows, and T. Warnow, Two strikes against perfect phylogeny, in "Proceedings of the Nineteenth International Colloquium on Automata, Languages, and Programming, 1992," Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, pp. 273-283.
4. C. Colbourn and M. Jerrum, 1995, personal communication.
5. C. Colbourn, W. Myrvoid, and E. Neufeld, Two algorithms for unranking arborescences, J. Algorithms, to appear.
6. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 251-280.
7. M. Corchemore and W. Rytter, "Text Algorithms," Oxford Univ. Press, London, 1994.
8. U. Feige, A threshold of In n for approximating set cover, in "Proceedings of the Twentyeighth Annual ACM Symposium on the Theory of Computing, 1996," pp. 286-293.
9. A. Gibbons, "Algorithmic Graph Theory," Cambridge Univ. Press, Cambridge, U.K., 1985.
10. L. Goldberg, P. Goldberg, C. Phillips, and G. Sorkin, Constructing computer virus phylogenies, in "Proceedings of Combinatorial Pattern matching, 1996," pp. 253-270.
11. L. Goldberg, P. Goldberg, C. Phillips, E. Sweedyk, and T. Warnow, Computing the phylogenetic number to find good evolutionary trees, Discrete Appl. Math. 71, 1-3 (1996), 111-136.
12. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21 (1991), 12-28.
13. W. Jiklik, H. Willett, D. Amos, and C. Wilfert, Eds. "Zinsser Microbiology," Appleton & Lange, East Norwalk, CT, 20th ed., 1992.
14. D. Karger, P. Klein, and R. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. Assoc. Comput. Mach. 42(2) (1995).
15. J. Kephart and W. Arnold, Automatic extraction of computer virus signatures, in "Proceedings of the Fourth Virus Bulletin International Conference, 1994" (R. Ford, Ed.), Virus Bulletin Ltd., pp. 179-194.
16. A. Nijenhuis and H. Wilf, "Combinatorial Algorithms for Computers and Calculators," Academic Press, 2nd ed., 1978.
17. R. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36 (1957), 1389-1401.
18. G. Sorkin, Grouping related computer viruses into families, in "Proceedings of the IBM Security ITS," October 1994.
19. M. Steel, The comlexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992), 91-116.
20. D. Wilson, Generating random spanning trees more quickly than the cover time, submitted for publication.