Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Constructing computer virus phylogenies

Tools
- Tools
+ Tools

Goldberg, Leslie Ann, Goldberg, Paul W., Phillips, Cynthia A. and Sorking, Gregory B. (1996) Constructing computer virus phylogenies. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

[img]
Preview
PDF (Department of Computer Science Research Report)
WRAP_cs-rr-297.pdf - Other - Requires a PDF viewer.

Download (1481Kb) | Preview

Request Changes to record.

Abstract

There has been much recent algorithmic work on the problem of reconstructing the evolutionary history of biological species. Computer virus specialists are interested in finding the evolutionary history of computer viruses - a virus is often written using code fragments from one or more other viruses, which are its immediate ancestors. A phylogeny for a collection of computer viruses is a directed acyclic graph whose nodes are the viruses and whose edges map ancestors to descendants and satisfy the property that each code fragment is "invented" only once. To provide a simple explanation for the data, we consider the problem of constructing such a phylogeny with a minimum number of edges. In general this optimization problem is NP-complete; some associated approximation problems are also hard, but others are easy. When tree solutions exist, they can be constructed and randomly sampled in polynomial time.

Item Type: Report
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Phylogeny -- Mathematical models, Computer viruses -- Mathematical models, Evolution (Biology) -- Mathematical models
Series Name: Department of Computer Science research report
Publisher: University of Warwick. Department of Computer Science
Official Date: January 1996
Dates:
DateEvent
January 1996Completion
Number: Number 297
Number of Pages: 17
DOI: CS-RR-297
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Publisher Statement: L.A.&nbsp;Goldberg, P.W.&nbsp;Goldberg, C.A.&nbsp;Phillips and G.B.&nbsp;Sorkin, &ldquo;Constructing Computer Virus Phylogenies&rdquo;, <i>Journal of Algorithms</i> <b>26</b>(1) pp.&nbsp188-208(1998); to appear
Funder: United States. Department of Energy, European Strategic Programme of Research and Development in Information Technology (ESPRIT)
Grant number: DE-AC04-76AL85000 (DOE), 7141 (ESPRIT)
Version or Related Resource: Goldberg, L.A., Goldberg, P.W., Phillips, C.A. and Sorkin, G.B. (1998). Constructing computer virus phylogenies. Journal of Algorithms, 26(1). pp. 188-208.
Related URLs:
  • Organisation
  • Related item in WRAP

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us