Constructing computer virus phylogenies
Goldberg, Leslie Ann, Goldberg, Paul W., Phillips, Cynthia A. and Sorkin, Gregory B.. (1998) Constructing computer virus phylogenies. Journal of Algorithms, Volume 26 (Number 1). pp. 188-208. ISSN 0196-6774Full text not available from this repository.
Official URL: http://dx.doi.org/10.1006/jagm.1997.0897
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. This optimization problem is NP-hard, and we present positive and negative results for associated approximation problems. When tree solutions exist, they can be constructed and randomly sampled in polynomial time.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
|Divisions:||Faculty of Science > Computer Science|
|Journal or Publication Title:||Journal of Algorithms|
|Official Date:||January 1998|
|Number of Pages:||21|
|Page Range:||pp. 188-208|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)