Numerical taxonomy on data: Experimental results

Conference · Mon Dec 01 00:00:00 EST 1997

OSTI ID:549035

Cohen, J; Farach, M ^[1]

---

1. Rutgers Univ., Piscataway, NJ (United States)

The numerical taxonomy problems associated with most of the optimization criteria described above are NP - hard [3, 5, 1, 4]. In, the first positive result for numerical taxonomy was presented. They showed that if e is the distance to the closest tree metric under the L{sub {infinity}} norm. i.e., e = min{sub T} [L{sub {infinity}} (T-D)], then it is possible to construct a tree T such that L{sub {infinity}} (T-D) {le} 3e, that is, they gave a 3-approximation algorithm for this problem. We will refer to this algorithm as the Single Pivot (SP) heuristic.

• Research Organization: Association for Computing Machinery, New York, NY (United States); Sloan (Alfred P.) Foundation, New York, NY (United States)
• OSTI ID: 549035
• Report Number(s): CONF-970137-; TRN: 97:005298-0047
• Resource Relation: Conference: RECOMB `97: 1. annual conference on research in computational molecular biology, Santa Fe, NM (United States), 20-22 Jan 1997; Other Information: PBD: 1997; Related Information: Is Part Of RECOMB 97. Proceedings of the first annual international conference on computational molecular biology; PB: 370 p.
• Country of Publication: United States
• Language: English

Related Subjects

55 BIOLOGY AND MEDICINE
BASIC STUDIES
99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
TAXONOMY
MATHEMATICAL MODELS
NUMERICAL ANALYSIS
ALGORITHMS
OPTIMIZATION
DATA
ERRORS
MATRICES
METRICS
BIOLOGICAL EVOLUTION