UNSPECIFIED (1998) Constructing computer virus phylogenies. JOURNAL OF ALGORITHMS, 26 (1). pp. 188-208. ISSN 0196-6774

Full text not available from this repository.

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. 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. (C) 1998 Academic Press.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics
Journal or Publication Title:	JOURNAL OF ALGORITHMS
Publisher:	ACADEMIC PRESS INC
ISSN:	0196-6774
Date:	January 1998
Volume:	26
Number:	1
Number of Pages:	21
Page Range:	pp. 188-208
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/16093

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item