A PTAS For The k-Consensus Structures Problem Under Squared Euclidean Distance
In this paper we consider a basic clustering problem that has uses in bioinformatics. A structural fragment is a sequence of l points in a 3D space, where l is a fixed natural number. Two structural fragments f1 and f2 are equivalent if and only if f1 = f2 x R + Ä under some rotation R and transla...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2008-10-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1999-4893/1/2/43/ |