Constructing computer virus phylogenies
Goldberg, L.A., Goldberg, P.W., Phillips, C.A. and Sorking, G.B. (1996) Constructing computer virus phylogenies. Technical Report. Department of Computer Science, Coventry, UK.
- Published Version
Download (1385Kb) | Preview
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:||Monograph (Technical Report)|
|Additional Information:||L.A. Goldberg, P.W. Goldberg, C.A. Phillips and G.B. Sorkin, “Constructing Computer Virus Phylogenies”, <i>Journal of Algorithms</i> <b>26</b>(1) pp. 188-208(1998); to appear|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||22 Dec 2011 09:36|
|Last Modified:||01 Nov 2012 18:06|
Actions (login required)