Constant time approximation scheme for largest well predicted subset

The largest well predicted subset problem is formulated for comparison of two predicted 3D protein structures from the same sequence. A 3D protein structure is represented by an ordered point set A ={ a 1 ,…, a n }, where each a i is a point in 3D space. Given two ordered point sets A ={ a 1 ,…, a n...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization Jg. 25; H. 3; S. 352 - 367
Hauptverfasser:	Fu, Bin, Wang, Lusheng
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.04.2013 Springer Science + Business Media
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Approximation scheme Constant time Randomization
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!